A normal form for precisely characterizing redundancy in nested relations
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
ACM Transactions on Database Systems (TODS)
UML Documentation Support for XML Schema
ASWEC '04 Proceedings of the 2004 Australian Software Engineering Conference
XTABLES: Bridging relational technology and XML
IBM Systems Journal
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
On the consistency of XML DTDs
Data & Knowledge Engineering - Special issue: XML schema and data management
Redundancy, dependencies and normal forms for XML databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Removing XML data redundancies using functional and equality-generating dependencies
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Theory of Relational Databases
Theory of Relational Databases
Generating Compact Redundancy-Free XML Documents from Conceptual-Model Hypergraphs
IEEE Transactions on Knowledge and Data Engineering
RRXS: redundancy reducing XML storage in relations
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
XML schema refinement through redundancy detection and normalization
The VLDB Journal — The International Journal on Very Large Data Bases
The XML Tree Model - toward an XML conceptual schema reversed from XML Schema Definition
Data & Knowledge Engineering
FIXT: a flexible index for XML transformation
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
When conceptual model meets grammar: A dual approach to XML data modeling
Data & Knowledge Engineering
| Hi-index | 0.00 |
Data Type Definition(DTD) and XML Schema Definition(XSD) are the logical schema of an XML model, but there is no standard format for the conceptual schema of an XML model. Conceptual modeling is a very important first step for constructing a database application. A conceptual model describes a system that is being built. Abstract ideas are made concrete as the ideas are represented in a formal notation. A formal conceptual model has a number of advantages. First, it helps designers understand and document the application under construction. Second, it facilitates development of algorithms that derive the underlying database schemas. In this paper, a real world of interest is described in a conceptual-model Hypergraph, which is a generic conceptual model. It is a Hypergraph because its hyperedges, or simply edges, are not necessarily binary. Its vertices represent sets of objects and its edges represent relationships among the vertices. Edges in a Hypergraph can be directed or undirected, depending on whether the underlying relationships are functional or non-functional. As opposed to relational databases, in this paper we are interested in constructing XML database applications with "good" properties. Two properties are particularly outstanding. First, the database should not have redundant data because redundant data lead to multiple-update problem once a single copy is modified. Second, since joins are expensive, the number of generated scheme trees, which are a generic hierarchical storage structure, should be as few as possible in order to reduce the number of joins required to answer a query. Users can draw a Hypergraph as XML conceptual schema with data relationships among elements as a result of specified functional dependency and multivalued dependency.