An integrated data structure with multiple access paths for database systems

Authors:
Judy Mullins;Vijay Kumar
Affiliations:
Computer Science Telecommunications, 5100 Rockhill, University of Missour-Kansas City, Kansas City, MO;Computer Science Telecommunications, 5100 Rockhill, University of Missour-Kansas City, Kansas City, MO
Venue:
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Year:
1992

Citing 6
Cited 1

Database system concepts

Database system concepts
Grid file concurrency

Information Systems
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
File Structures Using Pascal

File Structures Using Pascal
An Integrated Data Structure with Multiple Access Paths

Proceedings of the IFIP TC2/WG 2.6 Second Working Conference on Visual Database Systems II

Efficient XPath query processing

CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.