Skip to main content

Query Optimization of Disjunctive Databases with Constraints through Binding Propagation

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2514))

  • 314 Accesses

Abstract

In this paper we present a technique for the optimization of bound queries over disjunctive deductive databases with constraints, i.e. rules defining properties which have to be satisfied by all instances over database schema.

The technique we propose, allows the binding propagation into disjunctive queries with a set of constraints; thus, reducing the size of the data relevant to answer the query it, consequently, minimizes both the complexity of computing a single model and the whole number of models to be considered. The main contribution of this work consists in the extension of previous techniques by considering Datalog programs with both disjunctive heads and constraints. In particular, by considering weak constraints the technique is also suitable for dealing with optimization problems. Several experiments have confirmed the value of the technique.

Work partially supported by a MURST grant under the project “D2I”. The second author is also supported by ISI-CNR.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abiteboul, S., Hull, R., Vianu, V., Foundations of Databases. Addison-Wesley. 1995.

    Google Scholar 

  2. F. Bancilhon, D. Mayer, Y. Sagiv, and J.F. Ullman. Magic sets and other strange ways to implement logic programs. Proc. PODS Conf., 1986.

    Google Scholar 

  3. Beeri, C. and R. Ramakrisnhan. On the power of magic. Journal of Logic Programming, 1991 (prel. version in PODS 1987).

    Google Scholar 

  4. Buccafurri F., Leone N., and Rullo P., Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering, 12(5), 2000.

    Google Scholar 

  5. Eiter T., Gottlob G. and Mannila H., Disjunctive Datalog, in ACM Trans. on Database Systems, Sept. 1997, Vol 22, N. 3 (Prel. vers. in PODS-94).

    Google Scholar 

  6. Eiter T., Leone N., Mateis C., Pfeifer G. and Scarcello F.. A Deductive System for Non-monotonic Reasoning. Proc. LPNMR Conf., 363–374, 1997.

    Google Scholar 

  7. Fernández, J.A. and Minker, J., Semantics of Disjunctive Deductive Databases, Proc. 4th ICDT Conference, 21–50, 1992.

    Google Scholar 

  8. Gelfond, M., Lifschitz, V., The Stable Model Semantics for Logic Programming, in Proc. Fifth Conf. on Logic Progr., 1070–1080, 1998.

    Google Scholar 

  9. Gelfond, M. and Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365–385, 1991.

    Google Scholar 

  10. Greco S., Optimization of Disjunctive Queries. Int. Conf. on Logic Programming, 441–455, 1999.

    Google Scholar 

  11. S. Greco and C. Zaniolo, The PushDown Method to Optimize Chain Logic Programs. In Proc. ICALP Conference, 1995.

    Google Scholar 

  12. Greco S., “Minimal Founded Semantics for Disjunctive Logic Programming In Proc. of the Joint Conf. on Declarative Programming, 329–340, 1996.

    Google Scholar 

  13. IFIP-GI Workshop (1994), “Disjunctive Logic Programming and Disjunctive Databases,” 13-th IFIP World Computer Congress.

    Google Scholar 

  14. Leone, N., Rullo, P., Scarcello, F. (1997) Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information and Computation, 135(2), 69–112, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. Lobo, J., Minker, J. and Rajasekar, A. (1992) Foundations of Disjunctive Logic Programming MIT Press, Cambridge, MA.

    Google Scholar 

  16. Minker, J., On Indefinite Data Bases and the Closed World Assumption, inProc. 6 th CADE Conference, 292–308, 1982.

    Google Scholar 

  17. Przymusinski, T., On the Declarative Semantics of Deductive Databases and Logic Programming, in “Foundations of deductive databases and logic programming,“ Minker, J. ed., ch. 5, 193–216, Morgan Kaufman, Washington, D.C., 1988

    Google Scholar 

  18. Przymusinski, T., Stable Semantics for Disjunctive Programs, New Generation Computing, 9, 401–424, 1991.

    Article  Google Scholar 

  19. R. Ramakrisnhan, Y. Sagiv, J.F. Ullman, and M.Y. Vardi. Logical Query Optimization by Proof-Tree Transformation. JCSS, 47, 1993, pp. 222–248.

    Google Scholar 

  20. Ross. K.A., The Well Founded Semantics for Disjunctive Logic Programs, in “Deductive and Object-Oriented Databases,” W. Kim, J.-M. Nicolas and S. Nishio, ed., 385–402, Elsevier Science Publishers B. V., 1990.

    Google Scholar 

  21. Ullman J. D., Principles of Database and Know ledge-Base Systems, Computer Science Press, Rockville, Maryland (USA), 1989.

    Google Scholar 

  22. Van Gelder, A., Ross, K. A. and Schlipf, J. S., The Well-Founded Semantics for General Logic Programs, J. of ACM, 38(3), 620–650, 1991.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, G., Greco, S., Trubtsyna, I., Zumpano, E. (2002). Query Optimization of Disjunctive Databases with Constraints through Binding Propagation. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-36078-6_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00010-5

  • Online ISBN: 978-3-540-36078-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics