Concurrency Control in B-Trees with Batch Updates.

@article{DBLP:journals/tkde/Pollari-MalmiSY96,
  author    = {Kerttu Pollari-Malmi and
               Eljas Soisalon-Soininen and
               Tatu Yl{\"o}nen},
  title     = {Concurrency Control in B-Trees with Batch Updates},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {8},
  number    = {6},
  year      = {1996},
  pages     = {975-984},
  ee        = {db/journals/tkde/Pollari-MalmiSY96.html, db/journals/tkde/Pollari-MalmiSY96.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

CDROM Edition

References

[1]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX

[2]

Alfonso F. Cardenas: Analysis and Performance of Inverted Data Base Structures. Commun. ACM 18(5): 253-263(1975) BibTeX

[3]

Michael J. Carey, Clark D. Thompson: An Efficient Implementation of Search Trees on (lg N + 1) Processors. IEEE Trans. Computers 33(11): 1038-1041(1984) BibTeX

[4]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX

[5]

Douglas R. Cutting, Jan O. Pedersen: Optimizations for Dynamic Inverted Index Maintenance. SIGIR 1990: 405-411 BibTeX

[6]

Carla Schlatter Ellis: Concurrent Search and Insertion in AVL Trees. IEEE Trans. Computers 29(9): 811-817(1980) BibTeX

[7]

Carla Schlatter Ellis: Concurrent Search and Insertion in 2-3 Trees. Acta Inf. 14: 63-86,(1980) BibTeX

[8]

Christos Faloutsos, Stavros Christodoulakis: Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies. VLDB 1985: 165-170 BibTeX

[9]

Christos Faloutsos, Stavros Christodoulakis: Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation. ACM Trans. Inf. Syst. 2(4): 267-288(1984) BibTeX

[10]

Christos Faloutsos, H. V. Jagadish: Hybrid Index Organizations for Text Databases. EDBT 1992: 310-327 BibTeX

[11]

Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents BibTeX

[12]

Leonidas J. Guibas, Robert Sedgewick: A Dichromatic Framework for Balanced Trees. FOCS 1978: 8-21 BibTeX

[13]

Sheau-Dong Lang, James R. Driscoll, Jiann H. Jou: Batch Insertion for Tree Structured File Organizations - Improving Differential Database Reprensentation. Inf. Syst. 11(2): 167-175(1986) BibTeX

[14]

Vladimir Lanin, Dennis Shasha: A Symmetric Concurrent B-Tree Algorithm. FJCC 1986: 380-389 BibTeX

[15]

Philip L. Lehman, S. Bing Yao: Efficient Locking for Concurrent Operations on B-Trees. ACM Trans. Database Syst. 6(4): 650-670(1981) BibTeX

[16]

C. Mohan: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB 1990: 392-405 BibTeX

[17]

C. Mohan, Frank E. Levine: ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD Conference 1992: 371-380 BibTeX

[18]

C. Mohan, Inderpal Narang: Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates. SIGMOD Conference 1992: 361-370 BibTeX

[19]

Yehudit Mond, Yoav Raz: Concurrency Control in B+-Trees Databases Using Preparatory Operations. VLDB 1985: 331-334 BibTeX

[20]

Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood: Concurrency Control in Database Structures with Relaxed Balance. PODS 1987: 170-176 BibTeX

[21]

Yehoshua Sagiv: Concurrent Operations on B*-Trees with Overtaking. J. Comput. Syst. Sci. 33(2): 275-296(1986) BibTeX

[22]

Dennis Shasha, Nathan Goodman: Concurrent Search Structure Algorithms. ACM Trans. Database Syst. 13(1): 53-90(1988) BibTeX

[23]

V. Srinivasan, Michael J. Carey: On-Line Index Construction Algorithms. HPTS 1991: 0- BibTeX

[24]

V. Srinivasan, Michael J. Carey: Performance of On-Line Index Construction Algorithms. EDBT 1992: 293-309 BibTeX

[25]

Jaideep Srivastava, C. V. Ramamoorthy: Efficient Algorithms for Maintenance of Large Database. ICDE 1988: 402-408 BibTeX

[26]

...

Referenced by

1. Chris Jermaine, Anindya Datta, Edward Omiecinski: A Novel Index Supporting High Volume Data Warehouse Insertion. VLDB 1999: 235-246
2. Lauri Malmi, Eljas Soisalon-Soininen: Group Updates for Relaxed Height-Balanced Trees. PODS 1999: 358-367
3. Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam: Real-Time Data Access Control on B-Tree Index Structures. ICDE 1999: 458-467