waashk/acm huggingface dataset:
an experimental performance study of a pipelined recursive query processing strategy  in [16] a pipelined strategy is presented for processing recursive queries in deductive database systems. as a follow-up, this paper studies the run-time performance of the proposed strategy. the algorithm, introduced informally by examples in this paper, is coded in occam2 and runs on a network of transputers. a wide range of recursive queries and database structures are used as benchmarks in this study. both the speedup factors achieved and the elapsed time spent by the strategy in answering recursive queries are analysed. experimental results show that it is possible to achieve significant performance improvement when queries are evaluated in parallel, and provide insights into the success of this strategy in meeting the primary objective of focusing on relevant data.  j. shao d. a. bell m. e. c. hull
human factors guidelines for terminal interface design  this paper provides a set of guidelines for the design of software interfaces for video terminals. it describes how to optimize screen layouts, interactive data entry, and error handling, as well as many practical techniques for improving man-machine interaction. emphasis is placed on factors relating to perceptual and cognitive psychology rather than on gross physiological concerns. ways in which interfaces can be evaluated to improve their user friendliness are also suggested. the author summarizes many ideas that can be found in other, more comprehensive texts on the subject. these guidelines will provide practicing software designers with useful insights into some of today's principal terminal interface design considerations.  d. verne morland
daytona and the foruth-generation language cymbal  the daytona data management system is used by at&amp;t; to solve a wide spectrum of data management problems. for example, daytona is managing a 4 terabyte data warehouse whose largest table contains over 10 billion rows. daytona's architecture is based on translating its high-level query language cymbal (which includes sql as a subset) completely into c and then compiling that c into object code. the system resulting from this architecture is fast, powerful, easy to use and administer, reliable and open to unix tools. in particular, two forms of data compression plus robust horizontal partitioning enable daytona to handle terabytes with ease.  rick greer
estimating block accesses and number of records in file management  we consider the problems of estimating the number of secondary storage blocks and the number of distinct records accessed when a transaction consisting of possibly duplicate requested records is presented to a file management system. our main results include (1) a new formula for block access estimation for the case where the requested records may have duplications and their ordering in immaterial and (2) a simple formula for estimating the number of distinct records in the transaction.  to-yat cheung
the context interchange mediator prototype  the context interchange strategy presents a novel approach for mediated data access in which semantic conflicts among heterogeneous systems are not identified a priori, but are detected and reconciled by a context mediator through comparison of contexts. this paper reports on the implementation of a context interchange prototype which provides a concrete demonstration of the features and benefits of this integration strategy.  s. bressan c. h. goh k. fynn m. jakobisiak k. hussein h. kon t. lee s. madnick t. pena j. qu a. shum m. siegel
the maximum entropy approach and probabilistic ir models  this paper takes a fresh look at modeling approaches to information retrieval that have been the basis of much of the probabilistically motivated ir research over the last 20 years. we shall adopt a subjectivist bayesian view of probabilities and argue that classical work on probabilistic retrieval is best understood from this perspective. the main focus of the paper will be the ranking formulas corresponding to the binary independence model (bim), presented originally by roberston and sparck jones [1977] and the combination match model (cmm), developed shortly thereafter by croft and harper [1979]. we will show how these same ranking formulas can result from a probabilistic methodology commonly known as maximum entropy (maxent).  warren r. greiff jay m. ponte
mapping the discourse of hci researchers with citation analysis this paper observes the development of human-computer interaction as a research discipline from 1991 to 1993. from a citation analysis of three volumes of three journals, the field of human computer interaction is identified as emerging from a supporting base of four fields: computer science, information systems, psychology, and human factors/ ergonomics. results of this analysis support the proposition that human-computer interaction is emerging as a distinct field of study. thomas w. dillon
the v3 video server - managing analog and digital video clips  the v3 video server is a demonstration showing a multimedia application developed on top of the vodak database management system. vodak is a prototype of an object-oriented and distributed database management system (dbms) developed at gmd-ipsi. the v3 video server allows a user to interactively store, retrieve, manipulate, and present analog and short digital video clips. a video clip consists of a sequence of pictures and corresponding sound. several attributes like author, title, and a set of keywords are annotated. the highlights of the demonstration are as follows. (1) it is shown that an object-oriented database management systems is very useful for the development of multimedia applications. (2) the video server gives valuable hints for the development of an object-oriented database management system in direction to a multimedia database management system.  thomas c. rakow peter muth
voting class - an approach to achieving high availability for replicated data  in a distributed system, data are often replicated to increase the availability in the face of node and communication failures. however, updates to replicated data must be properly controlled to avoid data inconsistency. this can adversely affect the availability. in this paper, we propose an approach to the design of replica control schemes which can provide higher availability than currently existing voting schemes. the approach is based on the observation that the existing voting schemes actually belong to a general class, called voting class. this class of voting schemes can be represented in a very simple and uniform way. thus a designer can choose the optimal scheme within the voting class by evaluating each of them and choose the one which maximizes the availability.  jian tang
a transient hypergraph-based model for data access  two major methods of accessing data in current database systems are querying and browsing. the more traditional query method returns an answer set that may consist of data values (dbms), items containing the answer (full text), or items referring the user to items containing the answer (bibliographic). browsing within a database, as best exemplified by hypertext systems, consists of viewing a database item and linking to related items on the basis of some attribute or attribute value.  a model of data access has been developed that supports both query and browse access methods. the model is based on hypergraph representation of data instances. the hyperedges and nodes are manipulated through a set of operators to compose new nodes and to instantiate new links dynamically, resulting in transient hypergraphs. these transient hypergraphs are virtual structures created in response to user queries, and lasting only as long as the query session. the model provides a framework for general data access that accommodates user-directed browsing and querying, as well as traditional models of information and data retrieval, such as the boolean, vector space, and probabilistic models. finally, the relational database model is shown to provide a reasonable platform for the implementation of this transient hypergraph-based model of data access.  carolyn watters michael a. shepherd
systems, interactions, and macrotheory  a significant proportion of early hci research was guided by one very clear vision: that the existing theory base in psychology and cognitive science could be developed to yield engineering tools for use in the interdisciplinary context of hci design. while interface technologies and heuristic methods for behavioral evaluation have rapidly advanced in both capability and breadth of application, progress toward deeper theory has been modest, and some now believe it to be unnecessary. a case is presented for developing new forms of theory, based around generic "systems of interactors." an overlapping, layered structure of macro- and microtheories could then serve an explanatory role, and could also bind together contributions from the different disciplines. novel routes to formalizing and applying such theories provide a host of interesting and tractable problems for future basic research in hci.  philip barnard jon may david duke david duce
scaling question answering to the web the wealth of information on the web makes it an attractive resource for seeking quick answers to simple, factual questions such as who was the first american in space? or what is the second tallest mountain in the world? yet today's most advanced web search services (e.g., google and askjeeves) make it surprisingly tedious to locate answers to such questions. in this paper, we extend question-answering techniques, first studied in the information retrieval literature, to the web and experimentally evaluate their performance.first we introduce mulder, which we believe to be the first general-purpose, fully-automated question-answering system available on the web. second, we describe mulder's architecture, which relies on multiple search-engine queries, natural-language parsing, and a novel voting procedure to yield reliable answers coupled with high recall. finally, we compare mulder's performance to that of google and askjeeves on questions drawn from the trec-8 question answering track. we find that mulder's recall is more than a factor of three higher than that of askjeeves. in addition, we find that google requires 6.6 times as much user effort to achieve the same level of recall as mulder. cody kwok oren etzioni daniel s. weld
data abstraction tools: design, specification and application  current research in data modeling is motivated by the following dilemma:  \\- at the application level - being confronted with "slices of reality" \- details are perceived that, in general, cannot be represented.  \\- at the representation level - being confronted with "levels of machines" \- details are represented that, in general, cannot be perceived.  abstraction methods cope with that problem by suppressing unnecessary details and by formalizing and structuring the relevant information.  joachim w. schmidt
role conflict and ambiguity: critical variables in the mis user-designer relationship  one way to make progress in improving the probability of successful management information systems (mis) and management science and operation research (ms/or)1 projects is to take the view that the design process is a politically-based, planned change process. the political dimension emphasizes that mis design is inevitable imbedded in an organization with a political order which acts to shape and constrain the design and use of an mis. the planned change dimension emphasizes the interaction process and relationships among the participants in the design process. recent articles in the mis/ms literature have suggested that the politically-based change approach is the most viable for understanding and managing the design process and enhancing the chances for a successful system (for example, see: bostrom and heinen, 1977; keen and gerson, 1977; and ginzberg, 1978). but to date little research, other than case studies, has been conducted with this focus.  robert p. bostrom
optimal determination of user-oriented clusters  user-oriented clustering schemes enable the classification of documents based upon the user perception of the similarity between documents, rather than on some similarity function presumed by the designer to represent the user criteria. in this paper, an enhancement of such a clustering scheme is presented. this is accomplished by the formulation of the user-oriented clustering as a function- optimization problem. the problem formulated is termed the boundary selection problem (bsp). heuristic approaches to solve the bsp are proposed and a preliminary for evaluation of these approaches is provided.  j. deogun v. raghavan
ensuring consistency in multidatabases by preserving two-level serializability  the concept of serializability has been the traditionally accepted correctness criterion in database systems. however in multidatabase systems (mdbss), ensuring global serializability is a difficult task. the difficulty arises due to the heterogeneity of the concurrency control protocols used by the participating local database management systems (dbmss), and the desire to preserve the autonomy of the local dbmss. in general, solutions to the global serializability problem result in executions with a low degree of concurrency. the alternative, relaxed serializability, may result in data inconsistency.  in this article, we introduce a systematic approach to relaxing the serializability requirement in mdbs environments. our approach exploits the structure of the integrity constraints and the nature of transaction programs to ensure consistency without requiring executions to be serializable. we develop a simple yet powerful classification of mdbss based on the nature of integrity constraints and transaction programs. for each of the identified models we show how consistency can be preserved by ensuring that executions are two-level serializable (2lsr). 2lsr is a correctness criterion for mdbs environments weaker than serializability. what makes our approach interesting is that unlike global serializability, ensuring 2lsr in mdbs environments is relatively simple and protocols to ensure 2lsr permit a high degree of concurrency. furthermore, we believe the range of models we consider cover many practical mdbs environments to which the results of this article can be applied to preserve database consistency.  sharad mehrotra rajeev rastogi henry f. korth abraham silberschatz
data bases: a logical perspective  my work in data base theory is a natural outgrowth of my longstanding concern with the problem of representing and reasoning with domain specific knowledge, a problem of major concern in artificial intelligence. in data base terminology this is the conceptual modelling issue. my own methodological bias favours logic as a representation language for conceptual modelling, a bias which historically arose within ai in response to ai's emphasis on the ability to reason deductively with representations. in this position paper i shall argue that logic has other advantages for data base theory. specifically my objective is to provide the outline of a logical reconstruction of certain aspects of conventional data base theory.  raymond reiter
query-based sampling of text databases the proliferation of searchable text databases on corporate networks and the internet causes a database selection problem for many people. algorithms such as ggloss and cori can automatically select which text databases to search for a given information need, but only if given a set of resource descriptions that accurately represent the contents of each database. the existing techniques for a acquiring resource descriptions have significant limitations when used in wide-area networks controlled by many parties. this paper presents query-based sampling, a new technicque for acquiring accurate resource descriptions. query-based sampling does not require the cooperation of resource providers, nor does it require that resource providers use a particular search engine or representation technique. an extensive set of experimental results demonstrates that accurate resource descriptions are crated, that computation and communication costs are reasonable, and that the resource descriptions do in fact enable accurate automatic dtabase selection. jamie callan margaret connell
a testbed for characterizing dynamic response of virtual environment spatial sensors  this paper describes a testbed and method for characterizing the dynamic response of the type of spatial displacement transducers commonly used in virtual environment (ve) applications. the testbed consists of a motorized rotary swing arm that imparts known displacement inputs to the ve sensor. the experimental method involves a series of tests in which the sensor is displaced back and forth at a number of controlled frequencies that span the bandwidth of volitional human movement. during the tests, actual swing arm angle and reported ve sensor displacements are collected and time stamped. because of the time stamping technique, the response time of the sensor can be measured directly, independent of latencies in data transmission from the sensor unit and any processing by the interface applications running on the host computer. analysis of these experimental results allows sensor time delay and gain characteristics to be determined as a function of input frequency. results from tests of several differnt ve spatial sensors (ascension, logitech, and polhemus) are presented here to demonstrate use of the testbed and method.  bernard d. adelstein eric r. johnston stephen r. ellis
starer: a conceptual model for data warehouse design  modeling data warehouses is a complex task focusing, very often, into internal structures and implementation issues. in this paper we argue that, in order to accurately reflect the users requirements into an error-free, understandable, and easily extendable data warehouse schema, special attention should be paid at the conceptual modeling phase. based on a real mortgage business warehouse environment, we present a set of user modeling requirements and we discuss the involved concepts. understanding the semantics of these concepts, allow us to build a conceptual model---namely, the starer model---for their efficient handling. more specifically, the starer model combines the star structure, which is dominant in data warehouses, with the semantically rich constructs of the er model; special types of relationships have been further added to support hierarchies. we present an evaluation of the starer model as well as a comparison of the proposed model with other existing models, pointing out differences and similarities. examples from a mortgage data warehouse environment, in which starer is tested, reveal the ease of understanding of the model, as well as the efficiency in representing complex information at the semantic level.  nectaria tryfona frank busborg jens g. borch christiansen
group formation mechanisms for transactions in isis  distributed toolkits like isis provide means of replicating data but not means for making it persistent. this makes the use of transactions desirable, even in non- database applications. using isis can alleviate the programming cost of distributed transaction processing the multi-phase commit protocols. using the isis transaction tool, however, imposes additional cost, and we examine the effect of group formation strategies on the overhead. the paper presents three different group formation mechanisms in isis and compares the costs associated with them.  neel k. jain
the technology of word processing  the word processing industry offers over 160 model lines which are provided and marketed by 60 vendors. that gives you a lot of things to choose. to make matters even worse, one of the leaders in this industry announces a new feature, either hardware or software, every 3 days! it is a jungle out there. so, how can you keep up?  the answer varies because it depends on the person and range of interests. if you are involved in this business as a full-time responsibility, then it is possible to keep up. but, it will probably take 6 to 9 months to reach the basic level of understanding. for the rest of us who can only afford a modest amount of time to learn the basics and then maybe a few hours a week to keep up, it is an impossible task and leads to much frustration.  this paper is intended to reduce the frustration level a bit and put you on the trail of learning more about word processing.  gene t. sherron
designing the human-computer interface  there is a growing awareness in the academic and industrial computing communities of the need to introduce human factors considerations into the design of computer systems. at the school of information and computer science of the georgia institute of technology, this need is being met through a well- funded graduate research program in the human factors of computer systems as well as the introduction of courses that emphasize usability in designing the human-computer interface. the course detailed in this paper has the title "human-computer interface."  albert n. badre
establishing a foundation for collaborative scenario elicitation eliciting and integrating requirements from large groups of diverse users remains a major challenge for the software engineering community. scenarios are becoming recognized as valuable means of identifying actions taken by users when executing a business process and interacting with an information system, and therefore have great potential for addressing requirements elicitation problems. a review of the scenario literature indicates that, although there is widespread agreement on the usefulness of scenarios, there are many unanswered questions about how to elicit scenario definitions from individual users and user groups efficiently.this research examines how increasing the structure of scenario definitions affects scenario quality and the efficiency of scenario definition by individual users. during a laboratory experiment, subjects defined scenarios using a general-purpose gss, groupsystems group outliner, with one of three textual scenario formats that ranged from unstructured to very structured. scenario quality and the efficiency of scenario definition by users were compared across the formats. results highlighted the efficiency of the unstructured format but revealed that all formats produced incomplete scenario definitions. recommendations are made for an iterative collaborative scenario process and a special-purpose gss scenario tool that may overcome some of these problems. ann m. hickey douglas l. dean jay f. nunamaker
term clustering of syntactic phrases  term clustering and syntactic phrase formation are methods for transforming natural language text. both have had only mixed success as strategies for improving the quality of text representations for document retrieval. since the strengths of these methods are complementary, we have explored combining them to produce superior representations. in this paper we discuss our implementation of a syntactic phrase generator, as well as our preliminary experiments with producing phrase clusters. these experiments show small improvements in retrieval effectiveness resulting from the use of phrase clusters, but it is clear that corpora much larger than standard information retrieval test collections will be required to thoroughly evaluate the use of this technique.  d. d. lewis w. b. croft