waashk/acm huggingface dataset:
the five color concurrency control protocol: non- two-phase locking in general databases  concurrency control protocols based on two-phase locking are a popular family of locking protocols that preserve serializability in general (unstructured) database systems. a concurrency control algorithm (for databases with no inherent structure) is presented that is practical, non two-phase, and allows varieties of serializable logs not possible with any commonly known locking schemes. all transactions are required to predeclare the data they intend to read or write. using this information, the protocol anticipates the existence (or absence) of possible conflicts and hence can allow non-two-phase locking.  it is well known that serializability is characterized by acyclicity of the conflict graph representation of interleaved executions. the two-phase locking protocols allow only forward growth of the paths in the graph. the five color protocol allows the conflict graph to grow in any direction (avoiding two- phase constraints) and prevents cycles in the graph by maintaining transaction access information in the form of data- item markers. the read and write set information can also be used to provide relative immunity from deadlocks.  partha dasgupta zvi m. kedem
data base directions information resource management-making it work, executive summary  on october 21-23, 1985, the institute for computer sciences and technology of the national bureau of standards (nbs), in cooperation with the association for computing machinery special interest group on management of data (acm sigmod), the ieee computer society technical committee on database engineering, and the federal data management users group (fedmug), held the fourth in their series of data base directions workshops. the purpose of this workshop was to assess the nature of current information resource management (irm) practice and problems, and to explore solutions which have proven workable.  elizabeth n. fong alan h. goldfine
generalizations of boolean query processing  substantial work has been done recently applying fuzzy subset theory to the problems of document and query representation and processing in retrieval systems. the motivation has often been to generalize boolean query processing to allow for non-boolean index weights or measures of importance to be attached to the individual terms in the document or in the query representation. the problems of generalizing the boolean lattice structure have been noted. criteria have been generated for query processing mechanisms with relevance weights in the query, but these have been shown to be inconsistent. an alternative approach using thresholds in the query has been suggested, with the generation of appropriate document evaluation criteria for boolean query processing.  donald h. kraft
structural analysis of verbal data  current methods of analyzing verbal reports (protocol analysis) from human- computer interactions fall short of their potential. although there are systematic methods for collecting complete and objective verbal reports applicable to a broad range of problem- solving tasks, currently available analyses of verbal reports are ad hoc and apply only to well constrained tasks. structural analysis is a systematic method, currently under development, for analyzing real-world tasks involving human-computer interaction. starting with a rule that assigns utterances to two dichotomous categories related to a behavior of interest, rules are generated that expose the goal building and evaluation underlying that behavior. the resulting data yield time distributions that characterize subjects' goal-directed behavior and that allow comparisons among tasks or among subjects.  wayne a. bailey edwin j. kay
missing information (applicable and inapplicable) in relational databases  there has been some technical and justified criticism of the treatment of missing information in the data sublanguage sql and in ibm's database 2 system (a relational database management system). some of this criticism has been directed (by mistake) at the relational model. the purpose of this paper is to clarify and extend the treatment of missing information by the relational model.  the clarification places heavy emphasis on the semantic aspects of missing information. the extension, which is relatively minor, provides a systematic approach (independent of data type) to dealing with the inapplicability of certain properties to some objects. this extension does not invalidate any part of the present version of the relational model.  e. f. codd
lurker demographics: counting the silent  as online groups grow in number and type, understanding lurking is becoming increasingly important. recent reports indicate that lurkers make up over 90% of online groups, yet little is known about them.  this paper presents a demographic study of lurking in email-based discussion lists (dls) with an emphasis on health and software-support dls. four primary questions are examined. one, how prevalent is lurking, and do health and software-support dls differ? two, how do lurking levels vary as the definition is broadened from zero posts in 12 weeks to 3 or fewer posts in 12 weeks? three, is there a relationship between lurking and the size of the dl, and four, is there a relationship between lurking and traffic level?  when lurking is defined as no posts, the mean lurking level for all dls is lower than the reported 90%. health-support dls have on average significantly fewer lurkers (46%) than software-support dls (82%). lurking varies widely ranging from 0 to 99%. the relationships between lurking, group size and traffic are also examined.  blair nonnecke jenny preece
the map information facility - a cooperative federal and private venture in geocoding  the use of a nationwide information inquiry system based on a geographic location will be and has been heralded for some years. we take for granted that the post office, the "phone system", and a number of private firms have been and will continue to provide such service. any of us can call most airlines and get a reasonable answer on route planning for our trips with the various options explained to us by skilled operators at anytime of day from any place. private companies evaluate the economic utility of such systems in serving their customers. obviously, the existence of geographic-based inquiry systems is not new; their emergence to perform nationwide service to specific segments of inquirers in a federal program is rather new. i predict that this system, the federal insurance administration's (fia) map information facility, excited as we are about it and pleased as we are with the current accomplishments, will be replicated and expanded very frequently by many agencies. we can consider this particular project, and no doubt others which are emerging, as an early example of geographic information systems in the federal sector.  robert t. aangeenbrug
an adaptive query execution system for data integration  query processing in data integration occurs over network-bound, autonomous data sources. this requires extensions to traditional optimization and execution techniques for three reasons: there is an absence of quality statistics about the data, data transfer rates are unpredictable and bursty, and slow or unavailable data sources can often be replaced by overlapping or mirrored sources. this paper presents the tukwila data integration system, designed to support adaptivity at its core using a two-pronged approach. interleaved planning and execution with partial optimization allows tukwila to quickly recover from decisions based on inaccurate estimates. during execution, tukwila uses adaptive query operators such as the double pipelined hash join, which produces answers quickly, and the dynamic collector, which robustly and efficiently computes unions across overlapping data sources. we demonstrate that the tukwila architecture extends previous innovations in adaptive execution (such as query scrambling, mid-execution re-optimization, and choose nodes), and we present experimental evidence that our techniques result in behavior desirable for a data integration system.  zachary g. ives daniela florescu marc friedman alon levy daniel s. weld
evolution of contact point: a case study of a help desk and its users  this paper describes the evolution of a concept, contact point, the research process through which it evolved, and the work context and practices which drove its evolution. contact point is a web-based application that helps a business manage its relationships with its customers. it can also be used within a business as a means for managing the relationship between parts of the business. in this paper we describe a study of the applicability of contact point to the technical services organization and field personnel of a medical device manufacturer. we found that there were opportunities to potentially reduce call volume through contact point. we discovered, however, that the technical service representatives sometimes filled roles other than providing information in their telephone conversations with field personnel. these functions included reassuring callers that the callers' answers to questions were correct, providing a rationale for information, and redirecting calls to other departments. the ability to share a document and collaborate in real time was viewed as very valuable. we also discovered that the field personnel need information from a variety of other people in order to do their jobs. these observations were used to enhance the next iteration of contact point and to develop strategies for the introduction of contact point to users.  lena mamykina catherine g. wolf
towards a theory of cost management for digital libraries and electronic commerce  one of the features that distinguishes digital libraries from traditional databases is new cost models for client access to intellectual property. clients will pay for accessing data items in digital libraries, and we believe that optimizing these costs will be as important as optimizing performance in traditional databases. in this article we discuss cost models and protocols for accessing digital libraries, with the objective of determining the minimum cost protocol for each model. we expect that in the future information appliances will come equipped with a cost optimizer, in the same way that computers today come with a built-in operating system. this article makes the initial steps towards a thery and practice of intellectual property cost management.  a. prasad sistla ouri wolfson yelena yesha robert sloan
the egg/yolk reliability hierarchy: semantic data integration using sorts with prototypes  integration of disparate heterogeneous databases requires translation of types. because a type in one system often has no exact counterpart in the others, fully reliable integration requires deep understanding of the subject domain, with conceptual analysis of type meanings. so far, reliable translation has had to be done by hand. in practice, few types are so crucial as to require full reliability. the egg/yolk hierarchy ranks types by the tolerable rashness in translation, based on prototypes in each type. each defined class (egg) has a subclass of typical members (yolk) defined. we exploit cui, cohn and randell's qualitative spatial simulation program to create the hierarchy of all possible relations between source and target egg/yolk types, ranked by reliability. our eventual ranking is based on a poset combining four different preference criteria.  fritz lehmann anthony g. cohn
vague: a user interface to relational databases that permits vague queries  a specific query establishes a rigid qualification and is concerned only with data that match it precisely. a vague query establishes a target qualification and is concerned also with data that are close to this target. most conventional database systems cannot handle vague queries directly, forcing their users to retry specific queries repeatedly with minor modifications until they match data that are satisfactory. this article describes a system called vague that can handle vague queries directly. the principal concept behind vague is its extension to the relational data model with data metrics, which are definitions of distances between values of the same domain. a problem with implementing data distances is that different users may have different interpretations for the notion of distance. vague incorporates several features that enable it to adapt itself to the individual views and priorities of its users.  amihai motro
auto-construction of a live thesaurus from search term logs for interactive web search (poster session)  the purpose of this paper is to present an on-going research that is intended to construct a live thesaurus directly from search term logs of real-world search engines. such a thesaurus designed can contain representative search terms, their frequency in use, the corresponding subject categories, the associated and relevant terms, and the hot visiting web sites/pages the search terms may reach.  shui-lung chuang hsiao-tieh pu wen-hsiang lu lee-feng chien
browsing and querying in online documentation: a study of user interfaces and the interaction process  a user interface study concerning the usage effectiveness of selected retrieval modes was conducted using an experimental text retrieval system, tess, giving access to online documentation of certain programming tools. four modes of tess were compared: (1) browsing, (2) conventional boolean retrieval, (3) boolean retrieval based on venn diagrams, and (4) these three combined. further, the modes of tess were compared to the use of printed manuals. the subjects observed were 87 computing new to them. in the experiment the use of printed manuals is faster and provides answers of higher quality than any of the electronic modes. therefore, claims about the effectiveness of computer- based text retrieval have to by vary in situations where printed manuals are manageable to the user. among the modes of tess, browsing is the fastest and the one causing the fewest operational errors. on the same two variables, time and operational errors, the venn diagram mode performs better than conventional boolean retrieval. the combined mode scores worst on the objective performance measures; nonetheless nearly all subject prefer this mode. concerning the interaction process, the subjects tend to manage the complexities of the information retrieval tasks by issuing series of simple commands and exploiting the interactive capabilities of tess. to characterize the dynamics of the interaction process two concepts are introduced; threads and sequences of tactics. threads in a query sequence describes the continuity during retrieval. sequences of tactics concern the combined mode and describe how different retrieval modes succeed each other as the retrieval process evolves.  morten hertzum erik frøkjær
on modeling of information retrieval concepts in vector spaces  the vector space model (vsm) has been adopted in information retrieval as a means of coping with inexact representation of documents and queries, and the resulting difficulties in determining the relevance of a document relative to a given query. the major problem in employing this approach is that the explicit representation of term vectors is not known a priori. consequently, earlier researchers made the assumption that the vectors corresponding to terms are pairwise orthogonal. such an assumption is clearly unrealistic. although attempts have been made to compensate for this assumption by some separate, corrective steps, such methods are ad hoc and, in most cases, formally inconsistent.  in this paper, a generalization of the vsm, called the gvsm, is advanced. the developments provide a solution not only for the computation of a measure of similarity (correlation) between terms, but also for the incorporation of these similarities into the retrieval process.  the major strength of the gvsm derives from the fact that it is theoretically sound and elegant. furthermore, experimental evaluation of the model on several test collections indicates that the performance is better than that of the vsm. experiments have been performed on some variations of the gvsm, and all these results have also been compared to those of the vsm, based on inverse document frequency weighting. these results and some ideas for the efficient implementation of the gvsm are discussed.  s. k.m. wong w. ziarko v. v. raghavan p. c.n. wong
community design of dlese's collections review policy: a technological frames analysis  in this paper, i describe the design of a collection review policy for the digital library for earth system education (dlese). a distinctive feature of dlese as a digital library is the dlese community , composed of voluntary members who contribute metadata and resource reviews to dlese. as the dlese community is open, the question of how to evaluate community contributions is a crucial part of the review policy design process. in this paper, technological frames theory is used to analyse this design process by looking at how the designers work with two differing definitions of the peer reviewer , (a) peer reviewer as arbiter or editor, and (b) peer reviewer as colleague. content analysis of dlese documents shows that these frames can in turn be related to two definitions that dlese offers of itself: dlese as a library, and dlese as a digital artifact. the implications of the presence of divergent technological frames for the design process are summarised, and some suggestions for future research are outlined.  michael khoo
force-feedback improves performance for steering and combined steering- targeting tasks  the introduction of a force-feedback mouse, which provides high fidelity tactile cues via force output, may represent a long- awaited technological breakthrough in pointing device designs. however, there have been few studies examining the benefits of force-feedback for the desktop computer human interface. ten adults performed eighty steering tasks, where the participants moved the cursor through a small tunnel with varying indices of difficulty using a conventional and force-feedback mouse. for the force- feedback condition, the mouse displayed force that pulled the cursor to the center of the tunnel. the tasks required both horizontal and vertical screen movements of the cursor. movement times were on average 52 percent faster during the force-feedback condition when compared to the conventional mouse. furthermore, for the conventional mouse vertical movements required more time to complete than horizontal screen movements. another ten adults completed a combined steering and targeting task, where the participants navigated through a tunnel and then clicked a small box at the end of the tunnel. again, force- feedback improved times to complete the task. although movement times were slower than the pure steering task, the steering index of difficulty dominated the steering-targeting relationship. these results further support that human computer interfaces benefit from the additional sensory input of tactile cues to the human user.  jack tigh dennerlein david b. martin christopher hasser
pixel-oriented database visualizations  in this paper, we provide an overview of several pixel-oriented visualization techniques which have been developed over the last years to support an effective querying and exploration of large databases. pixel-oriented techniques use each pixel of the display to visualize one data value and therefore allow the visualization of the largest amount of data possible. the techniques may be divided into query-independent techniques which directly visualize the data (or a certain portion of it) and query-dependent techniques which visualize the relevance of the data with respect to a specific query. an example for the class of query-independent techniques is the recursive pattern technique which is based on a generic recursive scheme generalizing a wide range of pixel-oriented arrangements for visualizing large databases. examples for the class of query-dependent techniques are the generalized spiral and circle-segments techniques, which visualize the distance with respect to a database query and arrange the most relevant data items in the center of the display.  daniel a. keim
supporting presence in collaborative environments by haptic force feedback  an experimental study of interaction in a collaborative desktop virtual environment is described. the aim of the experiment was to investigate if added haptic force feedback in such an environment affects perceived virtual presence, perceived social presence, perceived task performance, and task performance. a between-group design was employed, where seven pairs of subjects used an interface with graphic representation of the environment, audio connection, and haptic force feedback. seven other pairs of subjects used an interface without haptic force feedback, but with identical features otherwise. the phantom, a one-point haptic device, was used for the haptic force feedback, and a program especially developed for the purpose provided the virtual environment. the program enables for two individuals placed in different locations to simultaneously feel and manipulate dynamic objects in a shared desktop virtual environment. results show that haptic force feedback significantly improves task performance, perceived task performance, and pereceived virtual presence in the collaborative distributed environment. the results suggest that haptic force feedback increases perceived social presence, but the difference is not significant.  eva-lotta sallnäs kirsten rassmus-gröhn calle sjöström
a serialization graph construction for nested transactions  this paper makes three contributions. first, we present a proof technique that offers system designers the same ease of reasoning about nested transaction systems as is given by the classical theory for systems without nesting, and yet can be used to verify that a system satisfies the robust "user view" definition of correctness of [10]. second, as applications of the technique, we verify the correctness of moss' read/write locking algorithm for nested transactions, and of an undo logging algorithm that has not previously been presented or proved for nested transaction systems. third, we make explicit the assumptions used for this proof technique, assumptions that are usually made implicitly in the classical theory, and therefore we clarify the type of system for which the classical theory itself can reliably be used.  alan fekete nancy lynch william e. weihl
a cost model for query processing in high dimensional data spaces  during the last decade, multimedia databases have become increasingly important in many application areas such as medicine, cad, geography, and molecular biology. an important research topic in multimedia databases is similarity search in large data sets. most current approaches that address similarity search use the feature approach, which transforms important properties of the stored objects into points of a high-dimensional space (feature vectors). thus, similarity search is transformed into a neighborhood search in feature space. multidimensional index structures are usually applied when managing feature vectors. query processing can be improved substantially with optimization techniques such as blocksize optimization, data space quantization, and dimension reduction. to determine optimal parameters, an accurate estimate of index-based query processing performance is crucial. in this paper we develop a cost model for index structures for point databases such as the r*-tree and the x-tree. it provides accurate estimates of the number of data page accesses for range queries and nearest-neighbor queries under a euclidean metric and a maximum metric and a maximum metric. the problems specific to high-dimensional data spaces, called boundary effects, are considered. the concept of the fractal dimension is used to take the effects of correlated data into account.  christian böhm