Extending a persistent object framework to enhance enterprise application server performance
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Aspects and components in real-time system development: Towards reconfigurable and reusable software
Journal of Embedded Computing - Real-Time and Embedded Computing Systems
An index rewriting scheme using compression for flash memory database systems
Journal of Information Science
An index management using CHC-cluster for flash memory databases
Journal of Systems and Software
Research and application of SQLite embedded database technology
WSEAS Transactions on Computers
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Parallel index and query for large scale data analysis
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
A snappy b+-trees index reconstruction for main-memory storage systems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
A signature-based Grid index design for main-memory RFID database applications
Journal of Systems and Software
An efficient B+-tree design for main-memory database systems with strong access locality
Information Sciences: an International Journal
Concurrent operations of O2-tree on shared memory multicore architectures
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
| Hi-index | 0.00 |
While the B-tree (or the B+-tree) is the most popular index structure in disk-based relational database systems, the T-tree has been widely accepted as a promising index structure for main memory databases where the entire database (or most of them) resides in the main memory. However, most work on the T-tree reported in the literature did not take concurrency control into consideration. In this paper, we report our study on the performance of the main memory database index structure that allows concurrent accesses of multiple users. Two concurrency control approaches over the T-tree are presented. The results of a simulation study indicate that the B-link tree, a variant of the widely used B-tree index will outperform the T-tree if concurrency control is enforced. This is due to the fact that concurrency control over a T-tree requires more lock operations than that of a B-link tree, and the overhead of locking and unlocking is high.