An Implementation for Nested Relational Databases
Anand B. Deshpande, Dirk Van Gucht · 1988
We propose an architecture for implementing nested re- In this paper we propose an implementation, ANDA’ lational databases. In particular, we discuss the storage for the Nested Relational Data Model(NRJ3M). In parstructures, their organization and an access language titular, we diicuaa the storage structures, their orgafor specifying access plans. nization, and an access language for specifying access The featurw of our implementation are: plans. The motivation for our design comes from these observations: A notation for hierarchical tuple identification. One value-driven indexing structure (VALTREE) for the entire database. A main-memory based component (CACHE) for ma-nipulating hierarchical tuple-identifiers. A hashing scheme (RECLISTS) for fast access to data specified by tuple-identifiers. An access language based on the VALTREE, the RECLIST and the CACHE to define access plans for execution of queries. Pemusaon to copy without fee all ar put of this granted pvided that the oopies are not made or disrritutcd for direct commercial advantage, the VLDB cop&ht notice md the title of the public&m and its date s~~eer, and notice L given