An integrated data structure with multiple access paths for database and its performance

An integrated data structure is presented in this paper which offers multiple access paths for processing different types of queries efficiently. Our approach is to fuse those data structures which offer efficient access path of a particular type. To show the feasibility of our scheme we fused the B/sup +/-tree, the grid file and extendible hashing, using a proper interface. We implemented and measured its performance through simulation modeling. Our results show that the integrated data structure does improve concurrency and offers a higher throughput for a variety of transaction processing workloads. We argue that our scheme is different than creating secondary indexes for improving concurrency.<
>