Adequacy of Decompositions of Relational Databases
Copyright policy )Adequacy of Decompositions of Relational Databases
AbstractWe consider conditions that have appeared in the literature with the purpose of defining a “good” decomposition of a relation scheme. We show that these notions are equivalent in the case that all constraints in the database are functional dependencies. This result solves an open problem of Rissanen. However, for arbitrary constraints the notions are shown to differ.
- State University of New York at Potsdam United States
- Stony Brook University United States
- IBM (United States) United States
- College of New Jersey United States
- Stanford University United States
Data structures, decomposition of relational schemes, Computer Networks and Communications, Applied Mathematics, dependencies, Theory of operating systems, Theoretical Computer Science, Information storage and retrieval of data, Computational Theory and Mathematics, database scheme, constraint preservation, lossless join
Data structures, decomposition of relational schemes, Computer Networks and Communications, Applied Mathematics, dependencies, Theory of operating systems, Theoretical Computer Science, Information storage and retrieval of data, Computational Theory and Mathematics, database scheme, constraint preservation, lossless join
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).34 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!