Search
Now showing items 11-20 of 37
Optimizing Existential Datalog Queries
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
Parallelism in Logic Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1989)
There is a tension between the objectives of avoiding irrelevant computation and extracting parallelism, in that a computational step used to restrict another must precede the latter. Our thesis, following [BeR87], is ...
Caching with "Good Enough" Currency, Consistency, and Completeness
(University of Wisconsin-Madison Department of Computer Sciences, 2004)
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an
earlier paper. This paper develops a data quality-aware, finer grained
cache model ...
A Framework for Testing Safety and Effective Computability of Extended Datalog
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
Generalized Containment of Conjunctive Queries
(University of Wisconsin-Madison Department of Computer Sciences, 1992)
Efficient Transitive Closure Algorithms
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
A Unified Approach to Logic Program Evaluation
(University of Wisconsin-Madison Department of Computer Sciences, 1989)
The Prolog evaluation algorithm has become the standard for logic program evaluation, and bottom-up methods have long been considered impractical because they compute irrelevant facts. Recently, however, bottom-up evaluation ...
Histogram Guided Interactive Query Evaluation
(University of Wisconsin-Madison Department of Computer Sciences, 2000)
Filter Joins: Cost-Based Optimization for Magic Sets
(University of Wisconsin-Madison Department of Computer Sciences, 1995)
The QUIQ Engine: A Hybrid IRDB System
(University of Wisconsin-Madison Department of Computer Sciences, 2003)










