Schema analysis for database restructuring
The problem of generalized restructuring of databases has been addressed with two limitations: first, it is assumed that the...
Simple conditions for guaranteeing higher normal forms in relational databases
A key is simple if it consists of a single attribute. It is shown that if a relation schema...
Physical design refinement: The ‘merge-reduce’ approach
Physical database design tools rely on a DBA-provided workload to pick an “optimal” set of indexes and materialized views....
Data abstractions for database systems
Data abstractions were originally conceived as a specification tool in programming. They also appear to be useful for exploring...
Extending the database relational model to capture more meaning
During the last three or four years several investigators have been exploring “semantic models” for formatted databases. The intent...
Reduced MVDs and minimal covers
Multivalued dependencies (MVDs) are data dependencies that appear frequently in the “real world” and play an important role in...
On the design of relational database schemata
The purpose of this paper is to present a new approach to the conceptual design of relational databases based...
Updating derived relations: detecting irrelevant and autonomously computable updates
Consider a database containing not only base relations but also stored derived relations (also called materialized or concrete views)....
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...
