Domain-independent data cleaning via analysis of entity-relationship graph
In this article, we address the problem of reference disambiguation. Specifically, we consider a situation where entities in the...
Resolving the query inference problem using Steiner trees
The query inference problem is to translate a sentence of a query language into an unambiguous representation of a...
A new normal form for nested relations
We consider nested relations whose schemes are structured as trees, called scheme trees, and introduce a normal form for...
Representing composites in conceptual modeling Share on
Using an object or entity class to represent a composite provides straightforward answers, making this approach superior to the...
Choosing classes in conceptual modeling
Lacking accepted rules for creating or evaluating classes that represent human knowledge of a particular domain, modelers can turn...
Comparing data modeling formalisms
Accurate specification and validation of information requirements is critical to the development of organizational information systems. Semantic data models...
An information-theoretic analysis of worst-case redundancy in database design
Normal forms that guide the process of database schema design have several key goals such as elimination of redundancies...
A normal form for relational databases that is based on domains and keys
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also, formal definitions of insertion...
A graph-theoretic approach to map conceptual designs to XML schemas
We propose a mapping from a database conceptual design to a schema for XML that produces highly connected and...
Multivalued dependencies and a new normal form for relational databases
A new type of dependency, which includes the well-known functional dependencies as a special case, is defined for relational...
