Abstract
It is known that bottom-up query evaluation can be extended to work with disjunctive facts, but there seems to be the common assumption that it is much too inefficient for practical applications. In this paper, we improve the extended bottom-up evaluation by making the resolvable literal in a disjunctive fact unique. In many cases, this reduces an exponential behaviour to a polynomial one. We apply this idea in a Horn-clause bottom-up metainterpreter for positive disjunctive rules and also sketch further possible improvements. This should make bottom-up query evaluation for disjunctive databases practically possible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Bidoit, R. Hull: Positivism vs. minimalism in deductive databases. In Proc. of the 5th ACM Symp. on Principles of Database Systems (PODS’86), 123–132, 1986.
S. Brass, U. W. Lipeck: Generalized bottom-up query evaluation. In A. Pirotte, C. Delobel, G. Gottlob (eds.), Advances in Database Technology — EDBT’92, 3rd Int. Conf., 88–103, LNCS 580, Springer-Verlag, 1992.
S. Brass, U. W. Lipeck: Bottom-up query evaluation with partially ordered defaults. In Proc. of the 3rd Int. Conf. on Deductive and Object-Oriented Databases (DOOD’93), 253–266, LNCS 760, Springer, 1993.
F. Bry: Query evaluation in recursive databases: bottom-up and top-down reconciled. Data Knowledge Engineering 5 (1990),289–312.
C.-L. Chang, R. C.-T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
R. Demolombe: An efficient strategy for non-horn deductive databases. Theoretical Computer Science 78 (1991),245–259.
J. Lobo, J. Minker, A. Rajasekar: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, Massachusetts, 1992.
J. Minker, A. Rajasekar: A fixpoint semantics for disjunctive logic programs. The Journal of Logic Programming 9 (1990),45–74.
K. A. Ross, R. W. Topor: Inferring negative information from disjunctive databases. Journal of Automated Reasoning 4 (1988),397–424.
D. Seipel, H. Argenton: A data structure for efficient deduction in disjunctive logic programs. In C. Beierle (ed.), 9. Workshop Logische Programmierung, 90–94, Informatik Berichte 146–10/1993, FernUniversiät Hagen, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brass, S. (1994). Improved Bottom-Up Query Evaluation in Positive Disjunctive Databases. In: Wolfinger, B. (eds) Innovationen bei Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51136-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-51136-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58313-4
Online ISBN: 978-3-642-51136-3
eBook Packages: Springer Book Archive