Abstract
Within the research area of deductive databases three different database tasks have been deeply investigated: query evaluation, update propagation and view updating. Over the last thirty years various inference mechanisms have been proposed for realizing these main functionalities of a rule-based system. However, these inference mechanisms have been rarely used in commercial DB systems until now. One important reason for this is the lack of a uniform approach well-suited for implementation in an SQL-based system. In this paper, we present such a uniform approach in form of a new version of the soft consequence operator. Additionally, we present improved transformation-based approaches to query optimization and update propagation and view updating which are all using this operator as underlying evaluation mechanism.
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
Similar content being viewed by others
References
Bancilhon, F., Ramakrishnan, R.: An Amateur’s introduction to recursive query processing strategies. In: SIGMOD Conference 1986, pp. 16–52 (1986)
Behrend, A.: Soft stratification for magic set based query evaluation in deductive databases. In: PODS 2003, New York, pp. 102–110, 9–12 June 2003
Behrend, A.: Optimizing exitstential queries in stratifiable deductive databases. In: SAC 2005, pp. 623–628 (2005)
Behrend, A.: A fixpoint approach to state generation for stratifiable disjunctive deductive databases. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol. 4690, pp. 283–297. Springer, Heidelberg (2007)
Behrend, A., Dorau, C., Manthey, R., Schüller, G.: Incremental view-based analysis of stock market data streams. In: IDEAS 2008, pp. 269–275. ACM, New York (2008)
Behrend, A., Manthey, R.: Update propagation in deductive databases using soft stratification. In: Benczúr, A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255, pp. 22–36. Springer, Heidelberg (2004)
Behrend, A., Manthey, R.: A transformation-based approach to view updating in stratifiable deductive databases. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 253–271. Springer, Heidelberg (2008)
Behrend, A., Schüller, G., Manthey, R.: AIMS: an sql-based system for airspace monitoring. In: IWGS 2010, pp. 31–38. ACM, New York (2010)
Beeri, C., Ramakrishnan, R.: On the power of magic. J. Logic Program. 10(1/2/3 &4), 255–299 (1991)
Bry, F.: Logic programming as constructivism: a formalization and its application to databases. In: PODS 1989, pp. 34–50 (1989)
Fernandez, J.A., Minker, J.: Semantics of disjunctive deductive databases. In: Hull, R., Biskup, J. (eds.) ICDT 1992. LNCS, vol. 646, pp. 21–50. Springer, Heidelberg (1992)
Kemp, D., Srivastava, D., Stuckey, P.: Bottom-up evaluation and query optimization of well-founded models. Theoret. Comput. Sci. 146(1 &2), 145–184 (1995)
Kuchenhoff, V.: On the efficient computation of the difference between consecutive database states. In: Delobel, C., Masunaga, Y., Kifer, M. (eds.) DOOD 1991. LNCS, vol. 566, pp. 478–502. Springer, Heidelberg (1991)
Manthey, R.: Reflections on some fundamental issues of rule-based incremental update propagation. In: DAISD 1994, pp. 255–276, Universitat Politècnica de Catalunya, 19–21 September 1994
Minker, J.: On indefinite databases and the closed world assumption. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol. 138, pp. 292–308. Springer, Heidelberg (1982)
Olivé, A.: Integrity constraints checking in deductive databases. In: VLDB 1991, pp. 513–523 (1991)
Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann, Los Altos (1988)
Ramakrishnan, R.: Magic templates: a spellbinding approach to logic programs. J. Logic Program. 11(3 &4), 189–216 (1991)
Rohmer, J., Lescoeur, R., Kerisit, J.-M.: The Alexander method - a technique for the processing of recursive axioms in deductive databases. New Gener. Comput. 4(3), 273–285 (1986)
Van Gelder, A.: The alternating fixpoint of logic programs with negation. J. Comput. Syst. Sci. 47(1), 185–221 (1993)
Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behrend, A. (2013). A Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases. In: Tompits, H., et al. Applications of Declarative Programming and Knowledge Management. INAP WLP 2011 2011. Lecture Notes in Computer Science(), vol 7773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41524-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-41524-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41523-4
Online ISBN: 978-3-642-41524-1
eBook Packages: Computer ScienceComputer Science (R0)