A new normal form for nested relations
ACM Transactions on Database Systems (TODS)
Relative information capacity of simple relational database schemata
SIAM Journal on Computing
IEEE Transactions on Software Engineering
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Elements of information theory
Elements of information theory
A normal form for precisely characterizing redundancy in nested relations
ACM Transactions on Database Systems (TODS)
A corrected 5NF definition for relational database design
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Equivalence of keyed relational schemas by conjunctive queries
Journal of Computer and System Sciences
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
A normal form for XML documents
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
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
ACM SIGMOD Record
Justification for Inclusion Dependency Normal Form
IEEE Transactions on Knowledge and Data Engineering
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Achievements of Relational Database Schema Design Theory Revisited
Selected Papers from a Workshop on Semantics in Databases
Developing XML Documents with Guaranteed ``Good'' Properties
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Why is the snowflake schema a good data warehouse design?
Information Systems
A sophisticate's introduction to database normalization theory
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Information-theoretic tools for mining database structure from large data sets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Databases, but not as we know them
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
XQuery containment in presence of variable binding dependencies
WWW '05 Proceedings of the 14th international conference on World Wide Web
Browsing mixed structured and unstructured data
Information Processing and Management: an International Journal
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
Deciding implication for functional dependencies in complex-value databases
Theoretical Computer Science - Logic, language, information and computation
Domination normal form: decomposing relational database schemas
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
RRXS: redundancy reducing XML storage in relations
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Semantic clustering of XML documents
ACM Transactions on Information Systems (TOIS)
Information theory for data management
Proceedings of the VLDB Endowment
Browsing mixed structured and unstructured data
Information Processing and Management: an International Journal
Lossless decompositions in complex-valued databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Information theory for data management
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Fast detection of functional dependencies in XML data
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Checking multivalued dependencies in XML
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Checking functional dependency satisfaction in XML
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
The implication problem for 'closest node' functional dependencies in complete XML documents
Journal of Computer and System Sciences
Hi-index | 0.00 |
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones arises in other data models, in particular, XML. While in the relational world the criteria for being well-designed are usually very intuitive and clear to state, they become more obscure when one moves to more complex data models.Our goal is to provide a set of tools for testing when a condition on a database design, specified by a normal form, corresponds to a good design. We use techniques of information theory, and define a measure of information content of elements in a database with respect to a set of constraints. We first test this measure in the relational context, providing information-theoretic justification for familiar normal forms such as BCNF, 4NF, PJ/NF, 5NFR, DK/NF. We then show that the same measure applies in the XML context, which gives us a characterization of a recently introduced XML normal form called XNF. Finally, we look at information-theoretic criteria for justifying normalization algorithms.