Efficient Concurrency Control in Multidimensional Access Methods

Summary: Dynamic granular locking for phantom protection in GiSTs enables transactional access for multidimensional access methods. Demonstrates high concurrency, low lock overhead, and scalable performance under various system loads versus predicate locking, offering a general, first granular-locking solution for MD AMs built on GiST. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3147
Venue: SIGMOD
Year: 1999
Pagerank: 5.5683442e-05
Overall Rank: 7,681 | 47.31%
DOI: 10.1145/304182.304185

Incoming Non-self Citations Over Time

Authors

1. Kaushik Chakrabarti (University of Illinois Urbana-Champaign)
2. Sharad Mehrotra (University of California Irvine)

BibTeX Citation

@inproceedings{chakrabarti_sigmod99,
        title = {{Efficient Concurrency Control in Multidimensional Access Methods}},
        author = {Chakrabarti, Kaushik and Mehrotra, Sharad},
        series = {{SIGMOD} '99},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/304182.304185},
        url = {https://dl.acm.org/doi/10.1145/304182.304185},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,974	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD	7.9083221e-05
6,488	Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads	2012	SIGMOD	5.865078e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
42	The R+-Tree: A Dynamic Multi-Dimensional Index for Objects	1987	VLDB	0.00046170812
202	Generalized Search Trees for Database Systems (Extended Abstract)	1995	VLDB	0.00025454884
214	ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes	1990	VLDB	0.00024680756
253	A Class of Data Structures for Associative Searching	1984	PODS	0.00023200431
260	Models for Studying Concurrency Control Performance: Alternatives and Implications	1985	SIGMOD	0.00023103999
650	The Sequoia 2000 Storage Benchmark	1993	SIGMOD	0.00015319951
1,137	A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space	1997	PODS	0.00012027131
1,501	Key Range Locking Strategies for Improved Concurrency	1993	VLDB	0.00010559899
2,227	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD	8.9111106e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,970	Locking Protocols for Materialized Aggregate Join Views	2003	VLDB
2	1,710	Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems	2001	VLDB
3	13,004	Index Concurrency Control in Firm Real-Time DBMS	1995	VLDB
4	202	Generalized Search Trees for Database Systems (Extended Abstract)	1995	VLDB
5	1,663	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD
6	12,767	Transaction support for indexed summary views	2004	SIGMOD
7	3,115	Extendible Hashing for Concurrent Operations and Distributed Data	1983	PODS
8	13,036	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB
9	5,903	Concurrency Control for Adaptive Indexing	2012	VLDB
10	2,227	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD