Skip to main content

Order Dependency

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

OD

Definition

Order dependencies (ODs) describe the relationship among lexicographical orderings of sets of tuples. An order specification is a list of attributes marked as asc (ascending) or desc (descending). This is the notion of order used in SQL and within query optimization, as by the order-by operator (nested sort). Let X = [A |T] be a list of marked attributes, the marked attribute A is the head of the list, and the marked list T is the tail. For two tuples s and t, s ≼Xt iff X = [ ]; or X = [A asc|T] and sA < tA; or X = [A desc|T] and sA > tA; or X = [A asc|T] or X = [A desc|T], sA = tA, and s ≼Tt. Let r be a table over a relation R that contains the attributes that appear in X and Y. Given two order specifications X and Y a table r satisfies an OD X ↦ Y, read as X orders Y, iff for all s, t ∈r, s ≼Xt implies s ≼Yt [8]. An OD is unidirectional when attributes within it are all marked as asc or desc [4, 6, 9, 7]. Unidirectional ODs are subsumed by ODs by definition.

His...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Readings

  1. Dong J, Hull R. Applying approximate order dependency to reduce indexing space. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1982. p. 119–27.

    Google Scholar 

  2. Ginsburg S, Hull R. Order dependency in the relational model. Theor Comput Sci. 1983;26(1):149–95.

    Article  MathSciNet  MATH  Google Scholar 

  3. Golab L, Karloff H, Korn F, Saha A, Srivastava D. Sequential dependencies. Proc VLDB Endow. 2009;2(1):547–85.

    Article  Google Scholar 

  4. Langer P, Naumann F. Efficient order dependency detection. VLDB J. 2016;25(2):223–41.

    Article  Google Scholar 

  5. Malkemus T, Padmanabhan S, Bhattacharjee B, Cranston L. Predicate derivation and monotonicity detection in DB2 UDB. In: Proceedings of the 21st International Conference on Data Engineering; 2005. p. 939–47.

    Google Scholar 

  6. Ng W. An extension of the relational data model to incorporate ordered domains. ACM Trans Database Syst. 2001;26(3):344–83.

    Article  MATH  Google Scholar 

  7. Szlichta J, Godfrey P, Gryz J. Fundamentals of order dependencies. Proc VLDB Endow. 2012;5(11): 1220–31.

    Article  Google Scholar 

  8. Szlichta J, Godfrey P, Gryz J, Zuzarte C. Expressiveness and complexity of order dependencies. Proc VLDB Endow. 2013;5(11):1858–69.

    Article  Google Scholar 

  9. Szlichta J, Godfrey P, Golab L, Kargar M, Srivastava D. Effective and complete discovery of order dependencies via set-based axiomatization. Proc VLDB Endow. 2017;10(7):12.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jaroslaw Szlichta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Szlichta, J. (2018). Order Dependency. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80772

Download citation

Publish with us

Policies and ethics