Skip to main content
SpringerLink
Log in

On domain independent disjunctive databases

  • Data Models And Query Languages
  • Conference paper
  • First Online:
ICDT '88 (ICDT 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 326))

Included in the following conference series:

  • 149 Accesses

Abstract

We extend the concept of domain independence from queries and databases to disjunctive databases. Informally, a domain independent disjunctive database is one for which the set of correct answers to any domain independent query is independent of the domains of variables in the database statements. We prove that every allowed stratified disjunctive database is domain independent and that every domain independent disjunctive database has an equivalent allowed disjunctive database. We also discuss a generalization and properties of two alternative definitions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K. R., H. A. Blair and A. Walker, “Towards a Theory of Declarative Knowledge”, in Foundations of Deductive Databases and Logic Programming, Minker, J. (ed.), Morgan Kaufmann, Los Altos, Ca., 1988, 89–148.

    Google Scholar 

  2. Bidoit, N. and R. Hull, “Positivism vs. Minimalism in Deductive Databases”, Proc. Fifth ACM Symp. on Principles of Database Systems, Cambridge, Mass., 1986, 123–132.

    Google Scholar 

  3. Di Paola, R. A., “The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas”, J. ACM 16, 2 (1969), 324–327.

    Google Scholar 

  4. Fagin, R., “Horn Clauses and Database Dependencies”, J. ACM 29, 4 (1982), 952–985.

    Google Scholar 

  5. Grant, J. and J. Minker, “Answering Queries in Indefinite Databases and the Null Value Problem”, in Advances in Computing Research, Vol. 3, JAI Press, 1986, 247–267.

    Google Scholar 

  6. Henschen, L. J. and H.-S. Park, “Compiling the GCWA in Indefinite Deductive Databases”, in Foundations of Deductive Databases and Logic Programming, Minker, J. (ed.), Morgan Kaufmann, Los Altos, Ca., 1988, 395–438.

    Google Scholar 

  7. Kifer, M., “On Safety, Domain Independence, and Capturability of Database Queries”, Proc. 3rd Int. Conf. on Data and Knowledge Bases, Jerusalem, 1988.

    Google Scholar 

  8. Kuhns, J. L., “Answering Questions by Computer: A Logical Study”, RM-5428-PR, Rand Corp., Santa Monica, Ca., 1967.

    Google Scholar 

  9. Minker, J., “On Indefinite Databases and the Closed World Assumption”, in 6th Conf. on Automated Deduction, Loveland, D. W. (ed.), Lecture Notes in Computer Science 138, Springer-Verlag, 1982, 292–308.

    Google Scholar 

  10. Nicolas, J.-M. and R. Demolombe, “On the Stability of Relational Queries”, Research Report, ONERA-CERT, Toulouse, 1983.

    Google Scholar 

  11. Przymusinski, T. C., “An Algorithm to Compute Circumscription”, manuscript, Department of Mathematical Sciences, University of Texas, El Paso, 1986. To appear in Artificial Intelligence.

    Google Scholar 

  12. Przymusinski, T. C., “On the Declarative Semantics of Deductive Databases and Logic Programs”, in Foundations of Deductive Databases and Logic Programming, Minker, J. (ed.), Morgan Kaufmann, Los Altos, Ca., 1988, 193–216.

    Google Scholar 

  13. Reiter, R., “On Closed World Data Bases”, in Logic and Data Bases, Gallaire, H. and J. Minker (eds), Plenum Press, New York, 1978, 55–76.

    Google Scholar 

  14. Ross, K. A. and R. W. Topor, “Inferring Negative Information from Disjunctive Databases”, Technical Report 87/1, Department of Computer Science, University of Melbourne, 1987. To appear in J. Automated Reasoning.

    Google Scholar 

  15. Topor, R. W., “Domain Independent Formulas and Databases”, Theoretical Computer Science 52, 3 (1987), 281–307.

    Google Scholar 

  16. Topor, R. W. and E. A. Sonenberg, “On Domain Independent Databases”, in Foundations of Deductive Databases and Logic Programming, Minker, J. (ed.), Morgan Kaufmann, Los Altos, Ca., 1988, 217–240.

    Google Scholar 

  17. Vardi, M. Y., “The Decision Problem for Database Dependencies”, Inf. Proc. Letters 12, 5 (1981), 251–254.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Melbourne, 3052, Parkville, Vic., Australia

    E. A. Sonenberg & R. W. Topor

Authors
  1. E. A. Sonenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. W. Topor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marc Gyssens Jan Paredaens Dirk Van Gucht

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sonenberg, E.A., Topor, R.W. (1988). On domain independent disjunctive databases. In: Gyssens, M., Paredaens, J., Van Gucht, D. (eds) ICDT '88. ICDT 1988. Lecture Notes in Computer Science, vol 326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50171-1_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-50171-1_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50171-8

  • Online ISBN: 978-3-540-45943-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation