Computation-tuple sequences and object histories
ACM Transactions on Database Systems (TODS)
Tuple sequences and lexicographic indexes
Journal of the ACM (JACM)
Sort sets in the relational model
Journal of the ACM (JACM)
Relational database design using an object-oriented methodology
Communications of the ACM
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A guide to the SQL standard (2nd ed.)
A guide to the SQL standard (2nd ed.)
An algebra for structured office documents
ACM Transactions on Information Systems (TOIS)
Relational database writings (1985–1989)
Relational database writings (1985–1989)
An extension of SQL for querying graph relations
Computer Languages
Using powerdomains to generalize relational databases
Theoretical Computer Science
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Relational database theory
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
Towards multiresolution data retrieval via the sandbag
Towards multiresolution data retrieval via the sandbag
Aspects of partial information in databases
Aspects of partial information in databases
Null inclusion dependencies in relational databases
Information and Computation
Object-oriented modeling and design for database applications
Object-oriented modeling and design for database applications
Reasoning about qualitative trends in databases
Information Systems
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Ordered functional dependencies in relational databases
Information Systems
A relational model of data for large shared data banks
Communications of the ACM
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Dependency Satisfaction in Databases with Incomplete Information
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
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
An extension of SQL to support ordered domains in relational databases
IDEAS '97 Proceedings of the 1997 International Symposium on Database Engineering & Applications
Lexicographically Ordered Functional Dependencies and Their Application to Temporal Relations
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Partial-order databases
Dynamic optimization of query execution plans
Dynamic optimization of query execution plans
Maintaining Consistency of Integrated XML Trees
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Life science research and data management—what can they give each other?
ACM SIGMOD Record
Prioritized preferences and choice constraints
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Differential dependencies: Reasoning and discovery
ACM Transactions on Database Systems (TODS)
Preference functional dependencies for managing choices
ER'06 Proceedings of the 25th international conference on Conceptual Modeling
Fundamentals of order dependencies
Proceedings of the VLDB Endowment
Optimizing database-backed applications with query synthesis
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Expressiveness and complexity of order dependencies
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
We extend the relational data model to incorporate partial orderings into data domains, which we call the ordered relational model. Within the extended model, we define the partially ordered relational algebra (the PORA) by allowing the ordering predicate ⊑ to be used in formulae of the selection operator (σ). The PORA expresses exactly the set of all possible relations that are invariant under order-preserving automorphism of databases. This result characterizes the expressiveness of the PORA and justifies the development of Ordered SQL (OSQL) as a query language for ordered databases. OSQL provides users with the capability of capturing the semantics of ordered data in many advanced applications, such as those having temporal or incomplete information. Ordered functional dependencies (OFDs) on ordered databases are studied, based on two possible extensions of domain orderings: pointwise ordering and lexicographical ordering. We present a sound and complete axiom system for OFDs in the first case and establish a set of sound and complete chase rules for OFDs in the second. Our results suggest that the implication problems for both cases of OFDs are decidable and that the enforcement of OFDs in ordered relations are practically feasible. In a wider perspective, the proposed model explores an important area of object-relational databases, since ordered domains can be viewed as a general kind of data type.