waashk/acm huggingface dataset:
a corpus analysis approach for automatic query expansion and its extension to multiple databases  searching online text collections can be both rewarding and frustrating. while valuable information can be found, typically many irrelevant documents are also retrieved, while many relevant ones are missed. terminology mismatches between the user's query and document contents are a main cause of retrieval failures. expanding a user's query with related words can improve search performances, but finding and using related words is an open problem. this research uses corpus analysis techniques to automatically discover similar words directly from the contents of the databases which are not tagged with part-of-speech labels. using these similarities, user queries are automatically expanded, resulting in conceptual retrieval rather than requiring exact word matches between queries and documents. we are able to achieve a 7.6% improvement for trec 5 queries and up to a 28.5% improvement on the narrow-domain cystic fibrosis collection. this work has been extended to multidatabase collections where each subdatabase has a collection-specific similarity matrix associated with it. if the best matrix is selected, substantial search improvements are possible. various techniques to select the appropriate matrix for a particular query are analyzed, and a 4.8% improvement in the results is validated.  susan gauch jianying wang satya mahesh rachakonda
outerjoin optimization in multidatabase systems  outerjoin is used in distributed relational multidatabase systems for integrating local schemas to a global schema. queries against the global schema need to be modified, optimized, and decomposed into subqueries at local sites for processing. since outerjoin combines local relations in different databases to form a global relation, it is expensive to process. in this paper, based on the structure of the query and the definition of the schemas, queries with outerjoin, join, select and project operations are optimized. conditions where outerjoin can be avoided or be transformed into a one-side outerjoin are identified. by considering these conditions the response time for query processing can be reduced.  arbee l. p. chen
data integration using similarity joins and a word-based information representation language  the integration of distributed, heterogeneous databases, such as those available on the world wide web, poses many problems. herer we consider the problem of integrating data from sources that lack common object identifiers. a solution to this problem is proposed for databases that contain informal, natural-language "names" for objects; most web-based databases satisfy this requirement, since they usually present their information to the end-user through a veneer of text. we describe whirl, a "soft" database management system which supports "similarity joins," based on certain robust, general- purpose similarity metrics for text. this enables fragments of text (e.g., informal names of objects) to be used as keys. whirl includes textual objects as a built-in type, similarity reasoning as a built-in predicate, and answers every query with a list of answer substitutions that are ranked according to an overall score. experiments show that whirl is much faster than naive inference methods, even for short queries, and efficient on typical queries to real-world databases with tens of thousands of tuples. inferences made by whirl are also surprisingly accurate, equaling the accuracy of hand- coded normalization routines on one benchmark problem, and outerperforming exact matching with a plausible global domain on a second.  william w. cohen
retrieval performance of a distributed text database utilizing a parallel processor document server  this paper considers text retrieval systems which store extremely huge amounts of text while providing a multi-user retrieval service for a large customer base. due to the severe i/o demands of such a system, it is usually beneficial if not necessary to utilize a multi- processor system with multiple i/o facilities in an effort to increase the parallel i/o activity, the objective being to lower search response times.  after defining the problem, we model a solution and show that the application can be handled in a very effective fashion by a multi-processor system with a simple lan-based topology. the final discussion describes a type of functional splitting which, if done in a careful manner, helps improve search response time.  forbes j. burkowski
effects of spatial audio on memory, comprehension, and preference during desktop conferences  an experiment was conducted to determine the effect of spatial audio on memory, focal assurance, perceived comprehension and listener preferences during desktop conferences. nineteen participants listened to six, pre- recorded, desktop conferences. each conference was presented using either non- spatial audio, co-located spatial audio, or scaled spatial audio, and during half of the conferences, static visual representations of the conferees were present. in the co-located condition, each conferees voice originated from directly above their image on the screen, and in the scaled spatial audio condition, the spatial separation between conferee voices was increased beyond the visual separation. results showed that spatial audio improved all measures, increasing memory, focal assurance, and perceived comprehension. in addition, participants preferred spatial audio to non-spatial audio. no strong differences were found in the visual conditions, or between the co-located spatial condition and the scaled spatial conditions.  jessica j. baldis
concept based design of data warehouses: the dwq demonstrators  the esprit project dwq (foundations of data warehouse quality) aimed at improving the quality of dw design and operation through systematic enrichment of the semantic foundations of data warehousing. logic-based knowledge representation and reasoning techniques were developed to control accuracy, consistency, and completeness via advanced conceptual modeling techniques for source integration, data reconciliation, and multi-dimensional aggregation. this is complemented by quantitative optimization techniques for view materialization, optimizing timeliness and responsiveness without losing the semantic advantages from the conceptual approach. at the operational level, query rewriting and materialization refreshment algorithms exploit the knowledge developed at design time. the demonstration shows the interplay of these tools under a shared metadata repository, based on an example extracted from an application at telecom italia.  m. jarke c. quix d. calvanese m. lenzerini e. franconi s. ligoudistianos p. vassiliadis y. vassiliou
video conferencing as a technology to support group work: a review of its failures  teleconferencing systems and services, are the main set of technologies developed thus far to support group work. within this set of technologies, videoconferencing is often thought of as a new, futuristic communication mode that lies between the telephone call and the face-to-face meeting. in fact, videoconferencing has been commercially available for over two decades, and, despite consistently brilliant market forecasts, to date it has failed to succeed except in limited niche markets. this paper reviews existing teleconferencing literature and provides an analysis of the reasons behind the failure of videoconferencing.  carmen egido
controlling the complexity of menu networks  a common approach to the design of user interfaces for computer systems is the menu selection technique. each menu frame can be considered a node in an information/action network. the set of nodes and the permissible transitions between them (menu selections) form a directed graph which, in a system of substantial size, can be large and enormously complex. the solution to this problem of unmanageable complexity is the same for menu networks as for programs: the disciplined use of a set of well-defined one-in-one-out structures. this paper defines a set of such structures and offers some guidelines for their use.  james w. brown
multiversion concurrency control - theory and algorithms  concurrency control is the activity of synchronizing operations issued by concurrently executing programs on a shared database. the goal is to produce an execution that has the same effect as a serial (noninterleaved) one. in a multiversion database system, each write on a data item produces a new copy (or version) of that data item. this paper presents a theory for analyzing the correctness of concurrency control algorithms for multiversion database systems. we use the theory to analyze some new algorithms and some previously published ones.  philip a. bernstein nathan goodman
an architecture for a relational dataflow database  a relational database system based on the principles of functional, data- driven computation is proposed. an architecture composed of a large number of independent, asynchronously operating processing units, each equiped with a separate memory unit holding a portion of the database is shown which implements the relational database system. all processing units are interconnected via 1) a circular shift-register bus, and 2) a daisy chain connection.  relations are represented as streams of values (tuples) where each value is carried by a unique token. to perform a query on the data base, relations involved in the query are replicated from the database as streams and used as inputs to dataflow programs (graphs) implementing the relational algebra.  all operators represented within the dataflow program are executed by independent processing units and are data-driven. proceeding asynchronously as stream values needed as inputs are produced.  a time complexity of o(n) is achieved for any relational algebra query assuming a sufficient number of processing units are available.  lubomir bic mike herendeen
automatic indexing  in information retrieval and text processing systems the search requests and stored information items are normally represented by sets of content identifiers, known as keywords or index terms. the choice of effective indexing products designed accurately to reflect document content is by far the most crucial task in retrieval. a wide variety of automatic indexing theories and systems have been developed over the years based in part on the occurrence frequencies of individual terms in the documents of a collection, on the ability of specific terms to distinguish the documents from each other, and on the distribution of terms in the relevant as opposed to the nonrelevant items in a collection. these theories lead to the automatic generation of content identifiers consisting of individual terms, term phrases, and classes of terms, and to the assignment of term weights reflecting the relative importance of the terms for content representation.  the various indexing theories are covered and analytical as well as experimental results are given to demonstrate their effectiveness.  gerard salton
a system architecture for the extension of structured information spaces by coordinated cscw services  the world wide web is an emerging platform for information systems; however established system architectures for web systems focus mainly on the creation and storage of consistent hypermedia information structures and on the efficient distribution of the resulting documents. the interaction between the information users is seldom supported.  as many application scenarios profit greatly from human interaction, the paper presents a platform- and application-independent generic system architecture designed to extend existing web-based information systems by coordinated services for human interaction. one prototype implementation of the architecture supports user awareness and human interaction on corporate web sites.  peter manhart
towards an efficient evaluation of general queries: quantifier and disjunction processing revisited  database applications often require to evaluate queries containing quantifiers or disjunctions, e.g., for handling general integrity constraints. existing efficient methods for processing quantifiers depart from the relational model as they rely on non- algebraic procedures. looking at quantified query evaluation from a new angle, we propose an approach to process quantifiers that makes use of relational algebra operators only. our approach performs in two phases. the first phase normalizes the queries producing a canonical form. this form permits to improve the translation into relational algebra performed during the second phase. the improved translation relies on a new operator - the complement-join - that generalizes the set difference, on algebraic expressions of universal quantifiers that avoid the expensive division operator in many cases, and on a special processing of disjunctions by means of constrained outer-joins. our method achieves an efficiency at least comparable with that of previous proposals, better in most cases. furthermore, it is considerably simpler to implement as it completely relies on relational data structures and operators.  francois bry
a digital strategy for the library of congress  digital libraries challenge the core practices of libraries and archiv es in many respects, not only in terms of accommodating digital information and technology, but also through the need to develop new economic and organizational models. as the world's largest library, the library of congress (lc) perhaps faces the most profound questions of how to collect, catalog, preserve, and provide access to digital resources. lc asked the computer science and telecommunications board of the national academies for advice in this area by commissioning the study that culminated with the publication of lc21: a digital strategy for the library of congress. the panelists at this session will provide a brief summary of the lc21 report, review developments subsequent to the publication of lc21, and offer their thoughts on how the library community and information industry could engage lc to the benefit of the nation.  alan inouye margaret hedstrom dale flecker david levy
relativism and views in a conceptual data base model  the purpose of the pingree park workshop was to bring together practitioners from the fields of artificial intelligence (ai), database management (db), and programming languages (pl), to discover common issues, and to explore commonalities and differences in approaches to these issues. at the risk of being superficial let me try to summarily characterize the three fields and point to where i think they may fruitfully interact.  it seems to me that at its best, ai is an interdisciplinary science of cognition. it attempts to understand the bases for natural cognition, primarily by developing models of structures and processes that underlie cognition. by incorporation into interactive systems these models can be both exploited as artificially intelligent technology and explored for their adequacy in explaining natural cognition.  peter kreps
evolvable view environment (eve): non-equivalent view maintenance under schema changes  supporting independent iss and integrating them in distributed data warehouses (materialized views) is becoming more important with the growth of the www. however, views defined over autonomous iss are susceptible to schema changes. in the eve project we are developing techniques to support the maintenance of data warehouses defined over distributed dynamic iss [5, 6, 7]. the eve system is the first to allow views to survive schema changes of their underlying iss while also adapting to changing data in those sources. eve achieves this is two steps: applying view query rewriting algorithms that exploit information about alternative iss and the information they contain, and incrementally adapting the view extent to the view definition changes. those processes are referred to as view synchronization and view adaption, respectively. they increase the survivability of materialized views in changing environments and reduce the necessity of human interaction in system maintenance.  e. a. rundensteiner a. koeller x. zhang a. j. lee a. nica a. van wyk y. lee
the feature quantity: an information theoretic perspective of tfidf-like measures  the _feature quantity_, a quantitative representation of specificity introduced in this paper, is based on an information theoretic perspective of co-occurrence events between terms and documents. mathematically, the feature quantity is defined as a product of probability and information, and maintains a good correspondence with the _tfidf_-like measures popularly used in today's ir systems. in this paper, we present a formal description of the feature quantity, as well as some illustrative examples of applying such a quantity to different types of information retrieval tasks: representative term selection and text categorization.  akiko aizawa
a case study of the evolution of jun: an object-oriented open-source 3d multimedia library  _jun is a large open-source graphics and multimedia library. it is object- oriented and supports 3d geometry, topography and multimedia. this paper reviews the development of the jun library from five perspectives: open- source, software evolution processes, development styles, technological support, and development data. we conclude the paper with lessons learned from the perspective of a for-profit company providing open-source object-oriented software to the community._  atsushi aoki kaoru hayashi kouichi kishida kumiyo nakakoji yoshiyuki nishinaka brent reeves akio takashima yasuhiro yamamoto
indexing images in oracle8i  content-based retrieval of images is the ability to retrieve images that are similar to a query image. oracle8i visual information retrieval provides this facility based on technology licensed from virage, inc. this product is built on top of oracle8i intermedia which enables storage, retrieval and management of images, audios and videos. images are matched using attributes such as color, texture and structure and efficient content-based retrieval is provided using indexes of an image index type. the design of the index type is based on a multi-level filtering algorithm. the filters reduce the search space so that the expensive comparison algorithm operates on a small subset of the data. bitmap indexes are used to evaluate the first filter resulting in a design which performs well and is scalable. the image index type is built using oracle8i extensible indexing technology, allowing users to create, use, and drop instances of this index type as they would any other standard index. in this paper we present an overview of the product, the design of the image index type, and some performance results of our product.  melliyal annamalai rajiv chopra samuel defazio susan mavris
introduction to the special issue on interface issues and designs for safety-critical interactive systems: when there is no room for user errorsoftware is increasingly being used to control safety-critical systems. muchresearch since levesons fundamental article software safety: why, what, andhow (acm computing surveys 18, 2 (1986), pp. 125163) has focused on ways toreduce or avoid software failures. however, the reliability of even the best-engineered software can be undermined by its user interface. indeed, interfacedesign for safety-critical interactive systems poses special challenges to thehuman-computer interaction community. this special issue addresses thechallenge of analyzing, designing, and building reliable and usable safety-critical interactive systems. from a pragmatic point of view a safety-criticalsystem is a system for which the cost of a failure is more important than thecost of developing the system. safety-critical interactive systems add thehuman dimension to a software system by putting control into the hands of ahuman operator. prominent examples of such control systems include nuclearpower plants, railways systems, airplane cockpits, and military systems.recent years have seen much effort put into the reengineering of the controlsystem that is well represented in this special issueair traffic control. whencompared to office automation systems, human- computer interac-tionfor safety-critical interactive systems is both familiar and different.for instance, themanagement of a functionality like undo, that can beseen as a usability issuein an office automation system, can become acritical functionality when theuser interacts with a safety-critical system. the three articles in thisspecial issue provide three snapshots for how human-computer interactionissues play out in the broader field of safety- critical interactive systems.in the first article, is paper safer? the role of flight strips in air trafficcontrol, wendy mackay provides adetailed ethnographic study on how air trafficcontrollers work.as in mackays article, the case study entails en-route air traffic control. animportant contribution of this article is a method for an integrated analysisof three important methods of this field: task performance, analysis of userdeviation and consequent hazard, and cooperation among users. each of thethree articles deals with the analysis and design phases of safety-criticalinteractive systems. if changes are to be made to large, complex, safety-critical control systems, the changes must be made early in the developmentlifecycle, where redesign in response to identified problems is feasible.thisspecial issue arose from a chi98 workshop organized by palanque and paternó("designing user interfaces for safety-critical systems", sigchi bulletin 30,4). the three articles included in this special issue were selected from morethan a score of papers received. the editors thank and acknowledge their debtto the many qualified external reviewers from several countries who havehelped select and improve (through their comments) the contributions in thisspecial issue.wayne d. gray philippe palanque fabio paternÃ³
information retrieval in the office environment  the question of information retrieval in the office environment must be considered in two contexts: personal and organizational. in the personal context the issue is increasing individual effectiveness and productivity; in the organizational context it is one of increasing an organization's overall effectiveness and productivity, partially by improvements at the level of the individual but primarily by improvements to the systems and procedures through which individuals work together. the end user requirements of the two contexts are quite different, a fact which must be taken into account when designing information retrieval systems for the office environment.  m. t. pezarro
transformation-based spatial join  spatial join finds pairs of spatial objects having a specific spatial relationship in spatial database systems. a number of spatial join algorithms have recently been proposed in the literature. most of them, however, perform the join in the original space. joining in the original space has a drawback of dealing with sizes of objects and thus has difficulty in developing a formal algorithm that does not rely on heuristics. in this paper, we propose a spatial join algorithm based on the transformation technique. an object having a size in the two-dimensional original space is transformed into a point in the four-dimensional transform space, and the join is performed on these point objects. this can be easily extended to n-dimensional cases. we show the excellence of the proposed approach through analysis and extensive experiments. the results show that the proposed algorithm has a performance generally better than that of the r*-based algorithm proposed by brinkhoff et al. this is a strong indicating that corner transformation preserves clustering among objects and that spatial operations can be performed better in the transform space than in the original space. this reverses the common belief that transformation will adversely affect clustering. we believe that our result will provide a new insight towards transformation-based spatial query processing.  ju-won song kyu-young whang young-koo lee min-jae lee sang-wook kim