A logical design methodology for relational databases using the extended entity-relationship model
ACM Computing Surveys (CSUR)
A new normal form for nested relations
ACM Transactions on Database Systems (TODS)
A normal form for precisely characterizing redundancy in nested relations
ACM Transactions on Database Systems (TODS)
Consequences of assuming a universal relation
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
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
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Object Database Development: Concepts and Principles
Object Database Development: Concepts and Principles
A Comparative Study of Various Nested Normal Forms
IEEE Transactions on Knowledge and Data Engineering
Developing XML Documents with Guaranteed ``Good'' Properties
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
RRXS: redundancy reducing XML storage in relations
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Multivalued dependencies and a 4NF for XML
CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering
Object role modelling and XML-Schema
ER'00 Proceedings of the 19th international conference on Conceptual modeling
Style normalization for canonical X-to-O mappings
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Designing nesting structures of user-defined types in object-relational databases
Information and Software Technology
Improving query performance on XML documents: a workload-driven design approach
Proceedings of the eighth ACM symposium on Document engineering
Designing XML documents from conceptual schemas and workload information
Multimedia Tools and Applications
FOCIH: Form-Based Ontology Creation and Information Harvesting
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Design non-recursive and redundant-free XML conceptual schema with hypergraph
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
A workload-aware approach for optimizing the XML schema design trade-off
Proceedings of the 13th International Conference on Information Integration and Web-based Applications and Services
Hi-index | 0.00 |
As XML data becomes more and more prevalent and as larger quantities of data find their way into XML documents, the need for quality XML data organization will only increase. One standard way of structuring data well is to reduce and, if possible, eliminate redundancy, while at the same time making the storage structures as compact as possible. In this paper, we present a methodology to generate XML storage structures where conforming XML documents are redundancy-free, and for most practical cases, are also fully compact. Our methodology assumes the input is a conceptual-model hypergraph. For the special case that every edge in the hypergraph is binary, we present a simple algorithm, guaranteed to always generate redundancy-free storage structures. We show, however, that generating a minimum number of redundancy-free storage structures is NP-hard. We therefore provide heuristics to guide the process and observe that these heuristics result in satisfactory solutions, which are often optimal. We then present a general algorithm for n{\hbox{-}}\rm ary edges and show that it generates redundancy-free storage structures. The general algorithm must overcome several problems that do not arise in the special case.