A new normal form for nested relations
ACM Transactions on Database Systems (TODS)
Semantic database modeling: survey, applications, and research issues
ACM Computing Surveys (CSUR)
A logical language for data and knowledge bases
A logical language for data and knowledge bases
The structure of the relational database model
The structure of the relational database model
Managing complex objects in an extensible relational DBMS
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A formal approach to object-oriented databases
Data & Knowledge Engineering
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
Selected papers of the Second Workshop on Concurrency and compositionality
Programming by multiset transformation
Communications of the ACM
Semantics for null extended nested relations
ACM Transactions on Database Systems (TODS)
Insertion anomalies and the justification for 4NF in relational databases
Information Sciences—Informatics and Computer Science: An International Journal
A normal form for precisely characterizing redundancy in nested relations
ACM Transactions on Database Systems (TODS)
Object normal forms and dependency constraints for object-oriented schemata
ACM Transactions on Database Systems (TODS)
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms
Fundamenta Informaticae
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Constraints for semistructured data and XML
ACM SIGMOD Record
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Decomposing relationship types by pivoting and schema equivalence
Data & Knowledge Engineering - ER2000
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
ACM SIGMOD Record
A Computational Biology Database Digest: Data, Data Analysis, and Data Management
Distributed and Parallel Databases
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
Designing Functional Dependencies for XML
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
ICDT '90 Proceedings of the Third International Conference on Database Theory
Bioinformatics Adventures in Database Research
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Supporting Lists in a Data Model (A Timely Approach)
VLDB '92 Proceedings of the 18th 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
Achievements of Relational Database Schema Design Theory Revisited
Selected Papers from a Workshop on Semantics in Databases
On Multisets in Database Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
An information-theoretic approach to normal forms for relational and XML data
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Computer and System Sciences - Special issue on PODS 2000
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Normalisation in the presence of lists
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Multi-valued dependencies in the presence of lists
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Theoretical Computer Science - Logic, language, information and computation
The Implication Problem of Functional Dependencies in Complex-value Databases
Electronic Notes in Theoretical Computer Science (ENTCS)
Multivalued dependencies in XML
BNCOD'03 Proceedings of the 20th British national conference on Databases
Functional dependencies for XML
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
The nested list normal form for functional and multivalued dependencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Φ-Rough Sets Theory and Its Usage on Mining Approximate Dependencies
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Lossless decompositions in complex-valued databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Hi-index | 0.00 |
Modern applications increasingly require the storage of data beyond relational structure. The challenge of providing well-founded data models that can handle complex objects such as lists, sets, multisets, unions and references has not been met yet in a completely satisfactory way. The success of such data models will greatly depend on the existence of automated database design techniques that generalise achievements from relational databases. In this paper, we study the implication problem of functional dependencies (FDs) in the presence of records, sets, multisets and lists. Database schemata are defined as nested attributes, database instances as nested relations and FDs are defined in terms of subattributes of the database schema. The expressiveness of FDs deviates fundamentally from previous approaches in different data models including the nested relational data model and XML.The implication problem is to decide whether for an arbitrary database schema, and an arbitrary set Σ ∪ {σ} of FDs defined on that schema, every database instance that satisfies all FDs in Σ also satisfies σ. The difficulty in generalising the solution from the relational data model to the presence of sets and multisets is caused by the fact that the value on the join of subattributes is no longer determined by the values on the subattributes. Based on the notion of a unit, we propose to decompose the database schema in such a way that the closure of a set of nested attributes can be computed on the components of the schema. The implementation of the algorithm is based on a representation theorem for Brouwerian algebras. The main contribution is the proof that the algorithm works correctly and in polynomial-time in the size of the input. Defining the size of the input is not trivial since the measure should both generalise the one that is used for relational databases and do justice to the presence of sets and multisets. Our solution to the implication problem allows to solve other important problems that occur in database design. We present polynomial-time algorithms to determine non-redundant covers of sets of FDs, and to decide whether a given set of subattributes forms a superkey.