Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
The relational model with relation-valued attributes
Information Systems
A new normal form for nested relations
ACM Transactions on Database Systems (TODS)
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
A recursive algebra and query optimization for nested relations
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Database Design
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Remarks on the algebra of non first normal form relations
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Foundations for multifile design by application partitioning
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Query Processing Strategy for the Decomposed Storage Model
Proceedings of the Third International Conference on Data Engineering
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Implementation Techniques of Complex Objects
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The Partial Normalized Storage Model of Nested Relations
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Benchmarking Database Systems A Systematic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Operations and Implementation of Complex Objects
Proceedings of the Third International Conference on Data Engineering
Storage models for nested relations
Storage models for nested relations
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The problem of choosing a storage model for a nested relation (i.e., a relation containing relations) is considered. A technique is introduced that uses the workload information of the database system under consideration to obtain a better storage model (i.e., one with a lower query cost) for a given nested relation. The nested relation scheme is first represented as a tree called the scheme tree. By using the workload information and by performing a series of merges in the nodes of the scheme tree, a near-optimum scheme tree is produced, and file organization types are assigned to each node (file) in the scheme tree. The authors' methodology is applied by using a specific nested relational algebra and three file organization types, namely, sequential, heap, and dense index files. The proposed methodology locates the optimum storage model and the optimum file organization techniques for the external and internal relations of the nested relations tested.