Skip to main content
Springer Nature Link
Log in

Using an Ordered Key Attribute in Database Design

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2000)

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

Included in the following conference series:

  • 1794 Accesses

Abstract

Recently, we have extended the relational data model to incorporate linear orderings into data domains [8], which we call the ordered relational model. We herein formally define Ordered Functional Dependencies (OFDs) and Ordered INclusion Dependencies (OINDs) for the extended model. We show that the conventional sound and complete axiom systems for FDs and INDs can be generalised to the cases of OFDs and OINDs. We investigate a subclass of ordered databases, called ordered object databases, which consists of a set of ordered relations having a distinguished key attribute and enables us to view tuples as linearly ordered objects. An ordered object database possesses two desirable properties concerning OFDs and OINDs, which are useful in ordered database design. First, there is no interaction between OFDs and OINDs. Second, the implication problem for a given set of OINDs, I, whose complexity is polynomial-time in the size of I.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. P. Buneman et al. Using Powerdomains to Generalise Relational Databases. Theoretical Computer Science91, pp. 23–55, (1991).

    Article  MathSciNet  Google Scholar 

  2. M.A. Casanova et al. Inclusion Dependencies and their Interaction with Functional Dependencies. Journal of Computer and System Science28, pp. 29–59, (1984).

    Article  MathSciNet  Google Scholar 

  3. M. Levene and G. Loizou. A Guided Tour on Relational Databases and Beyond. Springer-Verlag, London, (1999).

    Book  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  6. H. Mannila and K-J Raiha. The Design of Relational Databases. Addison-Wesley, (1992).

    Google Scholar 

  7. J.C. Mitchell. The Implication Problem for Functional and Inclusion Dependencies. Information and Control56, pp. 154–173, (1983).

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. J. Wijsen. Temporal FDs on Complex Objects. ACM Transactions on Database Systems24, pp. 227–176, (1999).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, China

    Wilfred Ng

Authors
  1. Wilfred Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Mathematical Sciences, Maritime Greenwich University Campus, 30 Park Row, London, SE10 9LS, UK

    Mohamed Ibrahim

  2. University of Linz, FAW, Altenbergerstr. 69, 4040, Linz, Austria

    Josef Küng

  3. Middlesex University, Bounds Green, London, UK

    Norman Revell

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ng, W. (2000). Using an Ordered Key Attribute in Database Design. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-44469-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67978-3

  • Online ISBN: 978-3-540-44469-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics