An integrated data structure with multiple access paths for database systems
Judy Mullins, Vijay Kumar
Abstract
Open-access reader
Judy Mullins, Vijay Kumar
Abstract
Open-access reader
This article presents an integrated data structure which offers multiple access paths for processing different types of queries efficiently. The data structure is developed by fusing the B+ - tree, the grid file and extendible hashing structures using a proper interface. We show that this type of data structure is an efficient way for providing multiple access paths to data.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article presents an integrated data structure which offers multiple access paths for processing different types of queries efficiently. The data structure is developed by fusing the B+ - tree, the grid file and extendible hashing structures using a proper interface. We show that this type of data structure is an efficient way for providing multiple access paths to data.
Key concepts: Computer science, Data structure, Access method, Data access, Database, Tree structure, Grid, Hash table