Vincent, M.W. and Levene, Mark (2000) Restructuring partitioned normal form relations without information loss. SIAM Journal on Computing 29 (5), pp. 1550-1567. ISSN 0097-5397.
Abstract
Nested relations in partitioned normal form (PNF) are an important subclass of nested relations that are useful in many applications. In this paper we address the question of determining when every PNF relation stored under one nested relation scheme can be transformed into another PNF relation stored under a different nested relation scheme without loss of information, referred to as the two schemes being data equivalent. This issue is important in many database application areas such as view processing, schema integration, and schema evolution. The main result of the paper provides two characterizations of data equivalence for nested schemes. The first is that two schemes are data equivalent if and only if the two sets of multivalued dependencies induced by the two corresponding scheme trees are equivalent. The second is that the schemes are equivalent if and only if the corresponding scheme trees can be transformed into the other by a sequence of applications of a local restructuring operator and its inverse.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 07 Jun 2021 16:55 |
| Last Modified: | 09 Aug 2023 12:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/44631 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
