A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Computing covers for embedded functional dependencies
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Determining View dependencies using tableaux
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Calculating constraints on relational expression
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Properties of functional-dependency families
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On verifying consistency of XML specifications
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
CPI: constraints-preserving inlining algorithm for mapping XML DTD to relational schema
Data & Knowledge Engineering - ER2000
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Relational Storage and Retrieval of XML Documents
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
What's Hard about XML Schema Constraints?
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Physical Data Independence, Constraints, and Optimization with Universal Plans
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
Journal of Computer and System Sciences - Special issue on PODS 2000
Capturing both types and constraints in data integration
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
From XML Schema to Relations: A Cost-Based Approach to XML Storage
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Information Systems
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Incremental evaluation of schema-directed XML publishing
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
K2/Kleisli and GUS: experiments in integrated access to genomic data sources
IBM Systems Journal - Deep computing for the life sciences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
RRXS: redundancy reducing XML storage in relations
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
MARS: a system for publishing XML from mixed and redundant storage
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient XML-to-SQL query translation: where to add the intelligence?
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Designing information-preserving mapping schemes for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A model for XML instance level integration
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Expressive, yet tractable XML keys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
Functional dependencies on extended relations defined by regular languages
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
XML normalization based on entity segments
Information Sciences: an International Journal
Hi-index | 0.00 |
We present a technique for refining the design of relational storage for XML data. The technique is based on XML key propagation: given a set of keys on XML data and a mapping (transformation) from the XML data to relations, what functional dependencies must hold on the relations produced by the mapping? With the functional dependencies one can then convert the relational design into, e.g. 3NF, BCNF, and thus develop efficient relational storage for XML data. We provide several algorithms for computing XML key propagation. One algorithm is to check whether a functional dependency is propagated from a set of XML keys via a predefined mapping; this allows one to determine whether or not the relational design is in a normal form. The others are to compute a minimum cover for all functional dependencies that are propagated from a set of XML keys and hold on a universal relation; these provide guidance for how to design a relational schema for storing XML data. These algorithms show that XML key propagation and its associated minimum cover can be computed in polynomial time. Our experimental results verify that these algorithms are efficient in practice. We also investigate the complexity of propagating other XML constraints to relations. The ability to compute XML key propagation is a first step toward establishing a connection between XML data and its relational representation at the semantic level.