Proceedings Article10.1109/ICDE.1992.213172
Chain-split evaluation in deductive databases
Jiawei Han
- 03 Feb 1992
- pp 376-384
6
TL;DR: Three chain-split evaluation techniques: magic sets, buffered evaluation, and partial evaluation, are developed and the first one is applicable to the evaluation of function-free recursions.
read more
Abstract: A chain-split evaluation technique for the efficient evaluation of recursions in deductive databases is described. Three chain-split evaluation techniques: magic sets, buffered evaluation, and partial evaluation, are developed. The first one is applicable to the evaluation of function-free recursions. The latter two are applicable to both function-free and functional recursions. Partial evaluation is a further refinement of the buffered evaluation by evaluating the buffered functional predicates as much as possible to reduce the cost of maintaining the sequences of buffered values and facilitates termination judgment and constraint pushing. Chain-split evaluation is an important recursive query processing technique which can be implemented efficiently in deductive databases by extension to the available recursive query evaluation techniques. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Constraint-based query evaluation in deductive databases
TL;DR: The constraint- based query-processing technique integrates query-independent compilation and chain-based query evaluation methods and demonstrates its great promise in deductive query evaluation.
12
Normalization and Compilation of Deductive and Object-Oriented Databases Programs for Efficient Query Evaluation
Zhaohui Xie,Jiawei Han +1 more
- 04 Dec 1995
TL;DR: A normalization process is proposed to serve not only as a preprocessing stage for compilation and evaluation but also as a tool for classifying recursions, and a class of DOOD queries can be evaluated efficiently in deductive and object-oriented databases.
3
•Dissertation
Query evaluation in deductive and object-oriented databases
Zhaohui Xie
- 01 Jan 1995
TL;DR: Effective optimization strategies are introduced to employ the constraint conditions expressed in the form of complex selection and join conditions for efficient set-oriented navigations and to exploit the common navigations among a query and encapsulated methods for efficient query evaluation.
2
•Posted Content
A Framework for Bottom-Up Simulation of SLD-Resolution.
TL;DR: This paper introduces a framework for the bottom-up simulation of SLD-resolution based on partial evaluation, inspired by the author's own SLDMagic method, and a variant of Earley deduction recently introduced by Heike Stephan and the author.
One-Sided Recursions.
Jeffrey F. Naughton
- 01 Jan 1986
TL;DR: The performance of systems with recursive query languages can be improved by recognizing simple, easily evaluable classes of recursions and using algorithms tailored to these classes whenever possible, and this paper identifies a useful subset of recursive definitions, the one-sided recursions.
1
References
•Book
Principles of database and knowledge-base systems
Jeffrey D. Ullman
- 01 Jan 1979
TL;DR: This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
2.9K
Access path selection in a relational database management system
P. Griffiths Selinger,Morton M. Astrahan,Donald D. Chamberlin,Raymond A. Lorie,T. G. Price +4 more
- 30 May 1979
TL;DR: System R as mentioned in this paper is an experimental database management system developed to carry out research on the relational model of data, which chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specification of desired data as a boolean expression of predicates.
An amateur's introduction to recursive query processing strategies
François Bancilhon,Raghu Ramakrishnan +1 more
- 15 Jun 1986
TL;DR: In this article, the authors present a survey and comparison of various strategies for processing logic queries in relational databases, focusing on Horn Clauses with evaluable predicates but without function symbols.
A study of transitive closure as a recursion mechanism
H. V. Jagadish,Rakesh Agrawal,Linda Ness +2 more
- 01 Dec 1987
TL;DR: It is shown that every linearly recursive query can be expressed as a transitive closure possibly preceded and followed by operations already available in relational algebra.
109
Safety of recursive Horn clauses with infinite relations
Raghu Ramakrishnan,François Bancilhon,Abraham Silberschatz +2 more
- 01 Jun 1987
TL;DR: This paper shows that the problem of determining whether a query is safe when terms involving function symbols are represented as distinct occurrences of uninterpreted infinite predicates over which certain finiteness dependencies hold.
83