Computation-tuple sequences and object histories
ACM Transactions on Database Systems (TODS)
Tuple sequences and lexicographic indexes
Journal of the ACM (JACM)
Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems
ACM Transactions on Database Systems (TODS)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
An algebra for structured office documents
ACM Transactions on Information Systems (TOIS)
An equivalence classes model of fuzzy relational databases
Fuzzy Sets and Systems - On fuzzy information and database systems
Database systems: achievements and opportunities
ACM SIGMOD Record - Directions for future database research & development
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
Complexity tailored design: a new design methodology for databases with incomplete information
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
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
Building the data warehouse (2nd ed.)
Building the data warehouse (2nd ed.)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
On the Equivalence of Database Models
Journal of the ACM (JACM)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Ordered functional dependencies in relational databases
Information Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Using Constraints for Efficient Query Processing in Nondeterministic Databases
IEEE Transactions on Knowledge and Data Engineering
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
Parallelizing User-Defined Functions in Distributed Object-Relational DBMS
IDEAS '99 Proceedings of the 1999 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
Maintaining Consistency of Integrated XML Trees
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
We introduce the concept of an indefinite sequence relation r over a relation schema R in order to capture the semantics of sequence data having indefinite values. Indefinite information may arise in a relation containing data from a mobile environment or from a multidatabase system. An indefinite tuple allows an attribute value to contain a set of values, which can be employed to represent disjunction of information. A definite sequence relation extracted from r, while maintaining its ordering, has all indefinite cells replaced with just one of the indefinite values. We establish a formal hierarchical structure over the class of indefinite sequence relations having a fixed schema and cardinality, which can be employed to classify the relations into different levels of precision. A functional dependency (FD) f satisfies in r if there is a definite sequence relation over R, extracted from r, that satisfies f as the same way a conventional relation does. Our main result shows that FDs in this context have the following two important features. First, Lien and Atzeni's axiom system [23,3] for FDs in incomplete relations, rather than the well-known Armstrong's axiom system, is sound and complete for FDs in indefinite sequence relations. It implies that the established results for FDs in incomplete relations, such as the closure and implication algorithms, can be extended to FDs in indefinite sequence relations. Second, the satisfaction for FDs is non-additive, meaning that in a given relation the satisfaction of each f in F may not lead to the the satisfaction of F.