Skip to main content

Inferring functional dependencies in linearly ordered databases

  • Conference paper
  • First Online:
  • 111 Accesses

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

Abstract

We extend the relational data model to incorporate linear orderings into data domains, which we call the ordered relational model. We formally define Ordered Functional Dependencies (OFDs) for the extended model by means of two possible extensions of domains, pointwise-orderings and lexicographical orderings. We first present a sound and complete axiom system for OFDs in the case of pointwise-orderings and then establish a set of sound and complete chase rules for OFDs in the case of lexicographical orderings. Our main result shows that the implication problems for both cases of OFDs are decidable, and that it is linear time for the case of pointwise orderings.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and S. Ginsburg. Tuple Sequences and Lexicographical Indexes. Journal of the. Association for Computing Machinery 33(3), pp. 409–422 (1986).

    MathSciNet  Google Scholar 

  2. W.W. Armstrong. Dependency Structures of Data Base Relationships. In Proceedings of the IFIP Congress, Stockholm, pp. 580–583, (1974).

    Google Scholar 

  3. P. Atzeni and V. De Antonellis. Relational Database Theory. Benjamin/Cummings Publishing Company, Inc., (1993).

    Google Scholar 

  4. P. Buneman, A. Jung and A. Ohori. Using Powerdomains to Generalise Relational Databases. Theoretical Computer Science 91, pp. 23–55, (1991).

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Ginsburg and R. Hull. Order Dependency in the Relational Model. Theoretical Computer Science 26, pp. 129–195, (1983).

    Google Scholar 

  6. G. Gratzer. General Lattice Theory. NewYork: Academic Press, (1978).

    Google Scholar 

  7. L. Libkin. Aspects of Partial Information in Databases. Ph.D. Thesis, University of Pennsylvania, United States, (1996).

    Google Scholar 

  8. N.A. Lorentzos. DBMS Support for Time and Totally Ordered Compound Data Types. Information Systems 17(5), pp. 347–358, (1992).

    Article  MATH  Google Scholar 

  9. D. Maier, A.O. Mendelzon and Y. Sagiv. Testing Implication of Data Dependencies. ACM Transactions on Database Systems 4, pp. 455–469, (1979).

    Article  Google Scholar 

  10. D. Maier and B. Vance. A Call to Order, In ACM symp. on Principles of Databases Systems, pp. 1–16, (1993).

    Google Scholar 

  11. W. Ng and M. Levene. An Extension of OSQL to Support Ordered Domains in Relational Databases. In IEEE Proceedings of the International Database Engineering and Applications Symposium, Montreal, Canada, pp.358–367, (1997).

    Google Scholar 

  12. W. Ng and M. Levene. The Development of Ordered SQL Packages for Modelling Advanced Applications. In LNCS 1308: DEXA '97 Conference, Proceedings, Springer-Verlag, pp. 529–538, (1997).

    Google Scholar 

  13. P. Seshadri et al. The Design and Implementation of a Sequence Database System. VLDB '96 Conference, Proceedings, pp. 99–110, (1996).

    Google Scholar 

  14. J.D. Ullman. Principles of Database and Knowledge-Base Systems, Vol. I, Rockville, MD., Computer Science Press, (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ng, W. (1998). Inferring functional dependencies in linearly ordered databases. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054480

Download citation

  • DOI: https://doi.org/10.1007/BFb0054480

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64950-2

  • Online ISBN: 978-3-540-68060-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics