메뉴 건너뛰기




Volumn 8, Issue 6, 1996, Pages 975-984

Concurrency control in B-trees with batch updates

Author keywords

B+ tree; Batch update; Concurrency control; Indexing; Information retrieval; Text search

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; EFFICIENCY; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; ONLINE SEARCHING; OPTIMIZATION; PROBLEM SOLVING;

EID: 0030413022     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.553166     Document Type: Review
Times cited : (25)

References (26)
  • 1
    • 0015489880 scopus 로고
    • Organization and Maintenance of Large Ordered Indexes
    • R. Bayer and E. McCreight, "Organization and Maintenance of Large Ordered Indexes," Acta Informatica, vol. 1, pp. 173-189, 1972.
    • (1972) Acta Informatica , vol.1 , pp. 173-189
    • Bayer, R.1    McCreight, E.2
  • 2
    • 0016503879 scopus 로고
    • Analysis and Performance of Inverted Data Base Structures
    • May
    • A.F. Cardenas, "Analysis and Performance of Inverted Data Base Structures," Comm. ACM, vol. 18, no. 5, pp. 253-263, May 1975.
    • (1975) Comm. ACM , vol.18 , Issue.5 , pp. 253-263
    • Cardenas, A.F.1
  • 3
    • 0021526447 scopus 로고
    • An Efficient Implementation of Search Trees on ⌈lg N + 1⌉ Processors
    • Nov.
    • M. Carey and C. Thompson, "An Efficient Implementation of Search Trees on ⌈lg N + 1⌉ Processors," IEEE Trans. Computers, vol. 33, no. 11, pp. 1,038-1,041, Nov. 1984.
    • (1984) IEEE Trans. Computers , vol.33 , Issue.11
    • Carey, M.1    Thompson, C.2
  • 4
    • 0018480749 scopus 로고
    • The Ubiquitous B-Tree
    • June
    • D. Comer, "The Ubiquitous B-Tree," ACM Computing Surveys, vol. 11, no. 4, pp. 121-138, June 1979.
    • (1979) ACM Computing Surveys , vol.11 , Issue.4 , pp. 121-138
    • Comer, D.1
  • 6
    • 0019056762 scopus 로고
    • Concurrent Search and Insertion in AVL Trees
    • Sept.
    • C.S. Ellis, "Concurrent Search and Insertion in AVL Trees," IEEE Trans. Computers, vol. 29, no. 9, pp. 811-817, Sept. 1980.
    • (1980) IEEE Trans. Computers , vol.29 , Issue.9 , pp. 811-817
    • Ellis, C.S.1
  • 7
    • 0019027623 scopus 로고
    • Concurrent Search and Insertion in 2-3 Trees
    • C.S, Ellis, "Concurrent Search and Insertion in 2-3 Trees," Acta Informatica, vol. 14, pp. 63-86, 1980.
    • (1980) Acta Informatica , vol.14 , pp. 63-86
    • Ellis, C.S.1
  • 8
    • 0006995371 scopus 로고
    • Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies
    • C. Faloutsos and S. Christodoulakis, "Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies," Proc. 11th Int'l Conf. Very Large Data Bases, pp. 165-170, 1985.
    • (1985) Proc. 11th Int'l Conf. Very Large Data Bases , pp. 165-170
    • Faloutsos, C.1    Christodoulakis, S.2
  • 9
    • 84976690119 scopus 로고
    • Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation
    • Oct.
    • C. Faloutsos and S. Christodoulakis, "Signature Files: An Access Method for Documents and Its Analytical Performance Evaluation," ACM Trans. Office Information Systems, vol. 2, pp. 267-288, Oct. 1984.
    • (1984) ACM Trans. Office Information Systems , vol.2 , pp. 267-288
    • Faloutsos, C.1    Christodoulakis, S.2
  • 10
    • 85010314659 scopus 로고
    • Hybrid Index Organizations for Text Databases
    • Advances in Database Technology - EDBT '92, Third Int'l Conf. Extending Database Technology, Springer-Verlag
    • C. Faloutsos and H.V. Jagadish, "Hybrid Index Organizations for Text Databases," Advances in Database Technology - EDBT '92, Third Int'l Conf. Extending Database Technology, pp. 310-327, Lecture Notes in Computer Science 580, Springer-Verlag, 1992.
    • (1992) Lecture Notes in Computer Science 580 , pp. 310-327
    • Faloutsos, C.1    Jagadish, H.V.2
  • 13
    • 0022584175 scopus 로고
    • Batch Insertion for Tree Structured File Organizations - Improving Differential Database Representation
    • S.D. Lang, J.R. Driscoll, and J.H. Jou, "Batch Insertion for Tree Structured File Organizations - Improving Differential Database Representation," Information Systems, vol. 11, no. 2, pp. 167-175, 1986.
    • (1986) Information Systems , vol.11 , Issue.2 , pp. 167-175
    • Lang, S.D.1    Driscoll, J.R.2    Jou, J.H.3
  • 15
    • 0019666493 scopus 로고
    • Efficient Locking for Concurrent Operations on B-Trees
    • Dec.
    • P. Lehman and S. Yao, "Efficient Locking for Concurrent Operations on B-Trees," ACM Trans. Database Systems, vol. 6, pp. 650-670, Dec. 1981.
    • (1981) ACM Trans. Database Systems , vol.6 , pp. 650-670
    • Lehman, P.1    Yao, S.2
  • 16
    • 0005297489 scopus 로고
    • ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operation on B-Tree Indexes
    • C. Mohan, "ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operation on B-Tree Indexes," Proc. 16th Int'l Conf. Very Large Data Bases, pp. 392-405, 1990.
    • (1990) Proc. 16th Int'l Conf. Very Large Data Bases , pp. 392-405
    • Mohan, C.1
  • 17
    • 84976813824 scopus 로고
    • ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging
    • C. Mohan and F. Levine, "ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging," Proc. ACM SIGMOD '92, Int'l Conf. Management of Data, pp. 371-380, 1992.
    • (1992) Proc. ACM SIGMOD '92, Int'l Conf. Management of Data , pp. 371-380
    • Mohan, C.1    Levine, F.2
  • 18
    • 84976736088 scopus 로고
    • Algorithms for Creating Indexes for Very Large Tables without Quiescing Updates
    • C. Mohan and I. Narang, "Algorithms for Creating Indexes for Very Large Tables without Quiescing Updates," Proc. ACM SIGMOD '92, Int'l Conf. Management of Data, pp. 361-370, 1992.
    • (1992) Proc. ACM SIGMOD '92, Int'l Conf. Management of Data , pp. 361-370
    • Mohan, C.1    Narang, I.2
  • 21
    • 0022132354 scopus 로고
    • Concurrent Operations on B*-Trees with Overtaking
    • Y. Sagiv, "Concurrent Operations on B*-Trees with Overtaking," J. Computer and System Sciences, vol. 33, no. 2, pp. 275-296, 1986.
    • (1986) J. Computer and System Sciences , vol.33 , Issue.2 , pp. 275-296
    • Sagiv, Y.1
  • 22
    • 0023984157 scopus 로고
    • Concurrent Search Structure Algorithms
    • Mar.
    • D. Shasha and N. Goodman, "Concurrent Search Structure Algorithms," ACM Trans. Database Systems, vol. 13, pp. 53-90, Mar. 1988.
    • (1988) ACM Trans. Database Systems , vol.13 , pp. 53-90
    • Shasha, D.1    Goodman, N.2
  • 24
    • 80052083292 scopus 로고
    • Performance of On-Line Index Construction Algorithms
    • Advances in Database Technology - EDBT '92, Third Int'l Conf. Extending Database Technology, Springer-Verlag
    • V. Srinivasan and M.J. Carey, "Performance of On-Line Index Construction Algorithms," Advances in Database Technology - EDBT '92, Third Int'l Conf. Extending Database Technology, pp. 293-309, Lecture Notes in Computer Science 580, Springer-Verlag, 1992.
    • (1992) Lecture Notes in Computer Science 580 , pp. 293-309
    • Srinivasan, V.1    Carey, M.J.2
  • 26
    • 33747511606 scopus 로고
    • An Algorithm for Full-Text Indexing
    • Helsinki Univ. of Technology, Laboratory of Information Processing Science
    • T. Ylönen, "An Algorithm for Full-Text Indexing," Helsinki Univ. of Technology, Laboratory of Information Processing Science, Technical Report no. TKO-B75, 1992.
    • (1992) Technical Report No. TKO-B75
    • Ylönen, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.