Abstract
A method to perform nonmonotonic relational rule computations is presented, called the split technique, The goal is to avoid redundant computations with rules that can insert and delete sets of tuples specified by the rule body. The method is independent of the control strategy that governs rule firing. Updatable relations are partitioned, as the computation progresses, into blocks of tuples such that tuples within a block are indiscernible from each other based on the computation so far. Results of previous rule firings are remembered as “relational equations” so that a new rule firing does not recompute parts of the result that can be determined from the existing equations. Seminaive evaluation falls out as a special case when all rules specify inserts. The method is amenable to parallelization.
Partially funded by PRC-BD3 (French Ministry of Research) and National Science Foundation grant CCR-8958590.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abiteboul, K. Compton, and V. Vianu. Queries are easier than you thought (probably). In Proc. ACM Symp. on Principles of Database Systems, 1992.
S. Abiteboul and V. Vianu. Procedural languages for database queries and updates. Journal of Computer and System Sciences, 41:181–229, 1990.
S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62–124, 1991.
S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. ACM SIGACT Symp. on the Theory of Computing, pages 209–219, 1991.
O.P. Buneman and G.K. Clemons. Efficiently monitoring relational databases. ACM Trans. on Database Systems, 4(3):368–382, September 1979.
L. Brownston, R. Farrel, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison Wesley, 1985.
F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. ACM Symp. on Principles of Database Systems, pages 1–15, 1986.
F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 16–52, 1986.
C. de Maindreville and E. Simon. Modelling non-deterministic queries and updates in deductive databases. In Proc. of Internat. Conf. on Very Large Databases, Los Angeles, 1988.
K.P. Eswaran. Aspects of a trigger subsystem in an integrated data base system. In Proceedings of the 2nd International Conference in Software Engineering, San Francisco, California, pages 243–250, 1976.
E.H. Hanson. An initial report on the design of ariel: a dbms with an integrated production rule system. In Sigmod Record, 18(3), pages 12–19, 1989.
R. Hull and D. Jacob. Language constructs for programming deductive databases. In vldb, 1991.
T. Imielinski and S. Naqvi. Explicit control of logic programs through rule algebra. In Proc. ACM Symp. on Principles of Database Systems, pages 103–116, 1988.
S. Lindell. An analysis of fixed-point queries on binary trees. PhD thesis, UCLA, 1990.
D. McCarthy and U. Dayal. The architecture of an active database management system. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 215–224, 1989.
S. Manchanda and D.S. Warren. A logic-based language for database updates. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 363–394. Morgan-Kaufmann, 1988.
S. Naqvi and R. Krishnamurthy. Database updates in logic programming. In Proc. ACM Symp. on Principles of Database Systems, page ??, 1988.
C. H. Papadimitriou and M. Yannakakis. Tie-Breaking Semantics and Structural Totality. In Eleventh ACM Symposium on Principles of Database Systems, pages 16–22, 1992.
D. Saccà and C. Zaniolo. Partial models, stable models and non-determinism in logic programs with negation. Technical report, MCC, Austin, TX, January 1990. (Extended abstract appeared in Ninth ACM Symposium on Principles of Database Systems, 1990.).
M. Stonebraker, E. Hanson, and S. Potamianos. The POSTGRES rules system. IEEE Transactions on Software Engineering, 14(7):897–907, July 1988.
A. Van Gelder. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences, 1992. (to appear). Abstract in PODS, 1989.
L. Vieille. Recursive query processing: the power of logic. Theoretical Computer Science, 69(1):1–53, 1987.
J. Widom. Deduction in the Starburst production rule system. Technical report, IBM Almaden Research, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abiteboul, S., Van Gelder, A. (1992). Optimizing active databases using the split technique (Preliminary Report). In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_40
Download citation
DOI: https://doi.org/10.1007/3-540-56039-4_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56039-5
Online ISBN: 978-3-540-47360-2
eBook Packages: Springer Book Archive