메뉴 건너뛰기




Volumn 165, Issue 1-2, 2004, Pages 103-127

Global parallel index for multi-processors database systems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MAINTENANCE; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; TREES (MATHEMATICS);

EID: 4243105998     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2003.09.019     Document Type: Article
Times cited : (42)

References (13)
  • 1
    • 0015489880 scopus 로고
    • Organization and maintenance of large ordered indices
    • Bayer R., McCreight E.M. Organization and maintenance of large ordered indices. Acta Informatica. 1(3):1972;173-189.
    • (1972) Acta Informatica , vol.1 , Issue.3 , pp. 173-189
    • Bayer, R.1    McCreight, E.M.2
  • 2
    • 0017690595 scopus 로고
    • Concurrency of operations on B-trees
    • Bayer R., Schkolnick M. Concurrency of operations on B-trees. Acta Informatica. 9:1977;1-21.
    • (1977) Acta Informatica , vol.9 , pp. 1-21
    • Bayer, R.1    Schkolnick, M.2
  • 3
    • 0000115533 scopus 로고
    • Overview of parallel architecture for databases
    • Bergsten B., Couprie M., Valduriez P. Overview of parallel architecture for databases. The Computer Journal. 36(8):1993;734-740.
    • (1993) The Computer Journal , vol.36 , Issue.8 , pp. 734-740
    • Bergsten, B.1    Couprie, M.2    Valduriez, P.3
  • 4
    • 0018480749 scopus 로고
    • The ubiquitous B-trees
    • Comer D. The ubiquitous B-trees. ACM Computing Surveys. 11(2):1979;121-137.
    • (1979) ACM Computing Surveys , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 5
    • 0026870271 scopus 로고
    • Parallel database systems: The future of high performance database systems
    • DeWitt D.J., Gray J. Parallel database systems: the future of high performance database systems. Communication of the ACM. 35(6):1992;85-98.
    • (1992) Communication of the ACM , vol.35 , Issue.6 , pp. 85-98
    • DeWitt, D.J.1    Gray, J.2
  • 6
    • 0019027623 scopus 로고
    • Concurrent search and inserts in 2-3 trees
    • Ellis C. Concurrent search and inserts in 2-3 trees. Acta Informatica. 14:1980;63-86.
    • (1980) Acta Informatica , vol.14 , pp. 63-86
    • Ellis, C.1
  • 8
    • 0009613418 scopus 로고
    • A distributed, replicated, data-balanced search structure
    • University of Florida
    • T. Johnson, A. Colbrook, A distributed, replicated, data-balanced search structure, Technical Report, University of Florida, 1993.
    • (1993) Technical Report
    • Johnson, T.1    Colbrook, A.2
  • 10
    • 0019666493 scopus 로고
    • Efficient locking for concurrent operations on B-trees
    • Lehman P., Yao S. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems. 6:1981;650-670.
    • (1981) ACM Transactions on Database Systems , vol.6 , pp. 650-670
    • Lehman, P.1    Yao, S.2
  • 12
    • 0022132354 scopus 로고
    • Concurrent operations on B-trees with overtaking
    • Sagiv Y. Concurrent operations on B-trees with overtaking. Journal of Computer and System Sciences. 33:1986;275-296.
    • (1986) Journal of Computer and System Sciences , vol.33 , pp. 275-296
    • Sagiv, Y.1


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