Skip to main content

Query processing in incomplete logical databases

Contributed Papers

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

Abstract

An incomplete database T combines two types of information about the real world modeled by the database : (a) the relational database with null values ("value not known") represented by axioms of a First Order Theory T0 and (b) the data dependencies that are known to be satisfied in the real world. For a given set of dependencies (functional and inclusion dependencies), a chase process transforms in two steps ("forward" and "backward" chase) type (b) information into an equivalent type (a) form. This yields a new first order theory T1 ; for a class Γ of queries (subclass of monotone queries) the evaluation on T and on T1 are equivalent. A technique involving both algebraic and theorem-proving methods provides for a sound and complete evaluation of the query.

Keywords

  • Relational Database
  • Query Processing
  • Data Dependency
  • Order Theory
  • Query Evaluation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-17187-8_41
  • Chapter length: 18 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47346-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. H. Graham, A new proof that the chase is a Church-Rosser replacement system, June 1980.

    Google Scholar 

  2. G. Grahne, Dependency satisfaction in databases with incomplete information. Proc. 10th Symp. on Very Large Data Bases, Singapore, Aug. 1984, 37–47.

    Google Scholar 

  3. P. Honeyman, Testing Satisfaction of Functional Dependencies. J. Assoc. Comput. Mach. 29, 3(July 1982), 668–677.

    Google Scholar 

  4. T. Imielinski, W. Lipski, Incomplete information in Relational Databases. J. Assoc. Comput. Mach. 31, 4(Oct. 1984), 761–791.

    Google Scholar 

  5. T. Imielinski, W. Lipski, Dependencies in relational databases with incomplete information. To appear.

    Google Scholar 

  6. T. Imielinski, On algebraic query processing in logical databases. In Advances in Data Base Theory, vol 2 (H. Gallaire, J. Minker, J.-M. Nicolas, eds), Plenum Press, New York, 1984, 285–318.

    Google Scholar 

  7. T. Imielinski, Abstraction in Query Processing. 1985.

    Google Scholar 

  8. J. Janas, On the feasibility of informative answers. In Advances in Database Theory, vol. 1 (H. Gallaire, J. Minker and J. M. Nicolas, eds), Plenum Press, New York, 1981, pp. 397–414.

    Google Scholar 

  9. D. S. Johnson and A. Klug, Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. J. Computer Syst. Sci. 28, 167–189 (1984).

    Google Scholar 

  10. N. Lerat, W. Lipski, Non-applicable nulls. To appear in Theoretical Computer Science.

    Google Scholar 

  11. J.-M. Nicolas, First order logic formalization for functional, multivalued, and mutual dependencies. Proc. ACM SIGMOD Symp. on Management of Data, 1978, 40–46.

    Google Scholar 

  12. R. Reiter, Towards a logical reconstruction of relational database theory. In Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages (M. L. Brodie, J. Mylopoulos and J. Schmidt, eds), Springer-Verlag, to appear.

    Google Scholar 

  13. R. Reiter, A sound and sometimes complete query evaluation algorithm for relational databases with null values. Techn. Rep., Dept. of Computer Science, Univ. of British Columbia, Vancouver, BC, June 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lerat, N. (1986). Query processing in incomplete logical databases. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-17187-8_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17187-4

  • Online ISBN: 978-3-540-47346-6

  • eBook Packages: Springer Book Archive