Abstract | ||
---|---|---|
Schema decomposition is a well known method for logical database design. Decomposition mainly aims at redundancy reduction and elimination of anomalies. A good decomposition should preserve dependencies and maintain recoverability of information. We propose a semi-automatic method for decomposing a relational schema in an interactive way. A database designer can build the subschemes step-by-step, guided by quantitative measures of decomposition "goodness". At each step, a ranked set of recommendations are provided to the designer to guide him to the next possible actions that lead to a better design. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1007/978-3-030-19093-4_8 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Relational databases,Functional dependencies,Schema decomposition,Normal forms,Recommendation | Information retrieval,Ranking,Relational database,Computer science,Database design,Functional dependency,Redundancy (engineering),Schema (psychology) | Conference |
Volume | ISSN | Citations |
1018 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Raji Ghawi | 1 | 19 | 3.64 |