The implication problem for functional and inclusion dependencies
Information and Control
Using powerdomains to generalize relational databases
Theoretical Computer Science
The design of relational databases
The design of relational databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
DBMS support for time and totally ordered compound data types
Information Systems
Temporal FDs on complex objects
ACM Transactions on Database Systems (TODS)
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
The Design and Implementation of a Sequence Database System
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The Development of Ordered SQL Packages for Modelling Advanced Applications
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
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.