Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Fundamental techniques for order optimization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Ordered functional dependencies in relational databases
Information Systems
An extension of the relational data model to incorporate ordered domains
ACM Transactions on Database Systems (TODS)
The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling
The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Applying approximate order dependency to reduce indexing space
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Lexicographically Ordered Functional Dependencies and Their Application to Temporal Relations
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Predicate Derivation and Monotonicity Detection in DB2 UDB
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimizing nested queries with parameter sort orders
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Queries on dates: fast yet not blind
Proceedings of the 14th International Conference on Extending Database Technology
Expressiveness and complexity of order dependencies
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies between lexicographically ordered sets of tuples. We introduce formally the concept of order dependency and present a set of axioms (inference rules) for them. We show how query rewrites based on these axioms can be used for query optimization. We present several interesting theorems that can be derived using the inference rules. We prove that functional dependencies are subsumed by order dependencies and that our set of axioms for order dependencies is sound and complete.