ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 15 Issue 3, Sept. 1990

A decision theoretic approach to information retrieval
James C. Moore, William B. Richmond, Andrew B. Whinston
Pages: 311-340
DOI: 10.1145/88636.88597
We present the file search problem in a decision-theoretic framework, and discuss a variation of it that we call the common index problem. The goal of the common index problem is to return the best available record in the file, where...

Scaling up output capacity and performance results from information systems prototypes
J. C. Westland
Pages: 341-358
DOI: 10.1145/88636.87943
The advantage of information system prototyping arises from its predict problems and end-user satisfaction with a system early in the development process, before significant commitments of time and effort have been made. Predictions of problems...

Data caching issues in an information retrieval system
Rafael Alonso, Daniel Barbara, Hector Garcia-Molina
Pages: 359-384
DOI: 10.1145/88636.87848
Currently, a variety of information retrieval systems are available to potential users.… While in many cases these systems are accessed from personal computers, typically no advantage is taken of the computing resources of those...

On compile-time query optimization in deductive databases by means of static filtering
Michael Kifer, Eliezer L. Lozinskii
Pages: 385-426
DOI: 10.1145/88636.87121
We extend the query optimization techniques known as algebric manipulations with relational expressions [48] to work with deductive databases. In particular, we propose a method for moving data-independent selections and projections into...

Direct transitive closure algorithms: design and performance evaluation
Rakesh Agrawal, Shaul Dar, H. V. Jagadish
Pages: 427-458
DOI: 10.1145/88636.88888
We present new algorithms for computing transitive closure of large database relations. Unlike iterative algorithms, such as the seminaive and logarithmic algorithms, the termination of our algorithms does not depend on the length of paths in...

Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
Weining Zhang, Clement T. Yu, Daniel Troy
Pages: 459-482
DOI: 10.1145/88636.89237
Linearization of nonlinear recursive programs is an important issue in logic databases for both practical and theoretical reasons. If a nonlinear recursive program can be transformed into an equivalent linear recursive program, then it may be...