1 |
V. Srinivasan and M. Carey. Performance of b-tree concurrency control algorithms, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.416-425, April, 1995
DOI
|
2 |
R. Bayer and E. McCeight, Organization and Maintenance of Large Ordered Indexes, Acta informatica, Vol.1, No.3, pp.173-189, 1972
DOI
|
3 |
A. Guttman, R-trees : A dynamic index structure for spatial searching, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.47-57, 1984
|
4 |
S. Berchtold, D. A. Keim and H. P. Kereigel, The X-tree : An index structure for high dimensional data, Proceedings of the Int. Conf. on Very Large Data Bases, 1996
|
5 |
P. Lehman and S. Yao, Efficient Locking for Concurrent Operations on B-Trees, Vol.6, No.4, December, 1981
DOI
ScienceOn
|
6 |
H. V. Lin, K. Jagadish and C. Faloutsos, The TV-tree : an index structure for high dimensional data, In VLDB Journal, 1994
DOI
|
7 |
N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, The R*tree : An Efficient and robust access method for points and rectangles, Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp.322-331, 1990
DOI
|
8 |
M. Kornacker and D. Banks, High-Concurrency Locking in R-Trees, Proceedings of the Int. Conf. on Very Large Data Bases, pp.134-145, September, 1995
|
9 |
K. Eswaren, J. Gray, R. Lorie and I. Traiger, On the Notions of Consistency and Predicate Locks in a Database System, Comm. ACM, Vol.19, No.11, pp.624-633, November, 1976
DOI
ScienceOn
|
10 |
H. V. Jagadish, Dan Lieuwen, Rajeev Rastogi, Avi Silberschatz and S. Sudarshan, Dali : A high performance main-memory storage manager, In Proc. of the Int. Conf. on Very Large DataBases, 1994
|
11 |
M. Kornacker, C. Mohan, and J. Hellerstein, Concurrency control and recovery in GiST, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997
|
12 |
D. White and R. Jain, Similarity indexing with the SS-tree, Proc. Int. Conf. on Data Engineering, pp.516-523, 1996
DOI
|
13 |
T. J. Lehman and M. J. Carey, A study of index structures for main memory database management systems, In Proc. of the Conf. on Very Large Data Bases, 1997
|
14 |
D. Lomet and B. Salzberg, The hB-Tree : A Multiattribute Indexing Method with Good Guaranteed Performance, ACM TODS, Vol.15, No.4, pp.625-685, December, 1990
DOI
|
15 |
J. Nievergelt, H. Hinterberger and K. C. Sevcik, The Grid File : An Adaptable, Symmetric Multikey File Structure, ACM TODS, Vol.9, No.1, March, 1984
DOI
ScienceOn
|
16 |
R. Rastogi, S. Seshadri, P. Bohannon, D. Leinbaugh, A. Silberschatz and S. Sudarshan, Logical and Physical Versioning in Main Memory Databases, In Proc of the Int. Conf. on Very Large Data Bases, August, 1997
|
17 |
J. T. Robinson, The K-D-B-Tree : A Search Structure for Large Multidimensional Dynamic Indexes, Proc. ACM SIGMOD Conf., pp.10-18, 1981
|
18 |
T. Sellis, N. Roussopoulos, C. Faloutsos, The R+-Tree : A Dynamic Index for Multi-Dimensional Objects, In VLDB Journal, 1987
|
19 |
K. V. Ravi Kanth, Divyakant Agrawal;Ambuj K Singh, Improved concurrency control techniques for multi-dimensional index structures, Technical Report, Univ. of California at santa Barbara, 1998
|