메뉴 건너뛰기




Volumn 1, Issue 1, 2008, Pages 598-609

A practical scalable distributed B-tree

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; LOCKS (FASTENERS);

EID: 74049121666     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453922     Document Type: Article
Times cited : (125)

References (22)
  • 1
    • 55849133671 scopus 로고    scopus 로고
    • Sinfonia: a new paradigm for building scalable distributed systems
    • Oct
    • M. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis. Sinfonia: a new paradigm for building scalable distributed systems. In Proc. SOSP'07, pages 159-174, Oct. 2007.
    • (2007) Proc. SOSP'07 , pp. 159-174
    • Aguilera, M.1    Merchant, A.2    Shah, M.3    Veitch, A.4    Karamanolis, C.5
  • 2
    • 84964194161 scopus 로고    scopus 로고
    • Scalable, efficient range queries for grid information services
    • Sept
    • A. Andrzejak and Z. Xu. Scalable, efficient range queries for grid information services. In Proc. P2P'02, pages 33-40, Sept. 2002.
    • (2002) Proc. P2P'02 , pp. 33-40
    • Andrzejak, A.1    Xu, Z.2
  • 5
    • 84947258073 scopus 로고    scopus 로고
    • Scalable, distributed data structures for Internet service construction
    • Oct
    • S. Gribble, E. Brewer, J. Hellerstein, and D. Culler. Scalable, distributed data structures for Internet service construction. In Proc. OSDI'00, pages 319-332, Oct. 2000.
    • (2000) Proc. OSDI'00 , pp. 319-332
    • Gribble, S.1    Brewer, E.2    Hellerstein, J.3    Culler, D.4
  • 6
    • 1142293109 scopus 로고    scopus 로고
    • Software transactional memory for ynamic-sized data structures
    • July
    • M. Herlihy, V. Luchangco, M. Moir, and I. William N. Scherer. Software transactional memory for ynamic-sized data structures. In Proc. PODC'03, pages 92-101, July 2003.
    • (2003) Proc. PODC'03 , pp. 92-101
    • Herlihy, M.1    Luchangco, V.2    Moir, M.3    William, I.4    Scherer, N.5
  • 7
    • 0027262011 scopus 로고
    • Transactional memory: architectural support for lock-free data structures
    • May
    • M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In Proc. ISCA'93, pages 289-300, May 1993.
    • (1993) Proc. ISCA'93 , pp. 289-300
    • Herlihy, M.1    Moss, J.E.B.2
  • 9
    • 0026977857 scopus 로고
    • A distributed data-balanced dictionary based on the B-link tree
    • Mar A longer version appears as MIT Tech Report MIT/LCS/TR-530, Feb. 1992
    • T. Johnson and A. Colbrook. A distributed data-balanced dictionary based on the B-link tree. In Proc. IPPS'92, pages 319-324, Mar. 1992. A longer version appears as MIT Tech Report MIT/LCS/TR-530, Feb. 1992.
    • (1992) Proc. IPPS'92 , pp. 319-324
    • Johnson, T.1    Colbrook, A.2
  • 10
    • 0019574432 scopus 로고
    • On optimistic methods for concurrency control
    • June
    • H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Trans. Database Syst., 6(2):213-226, June 1981.
    • (1981) ACM Trans. Database Syst. , vol.6 , Issue.2 , pp. 213-226
    • Kung, H.T.1    Robinson, J.T.2
  • 11
    • 0019666493 scopus 로고    scopus 로고
    • 1981 Efficient locking for concurrent operations on B-trees
    • Dec
    • P. L. Lehman and S. B. Yao. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems, 6(4):650-670, Dec. 1981.
    • ACM Transactions on Database Systems , vol.6 , Issue.4 , pp. 650-670
    • Lehman, P.L.1    Yao, S.B.2
  • 12
    • 12444261097 scopus 로고
    • RP*: A Family of Order Preserving Scalable Distributed Data Structures
    • Sept
    • W. Litwin, M.-A. Neimat, and D. Schneider. RP*: A Family of Order Preserving Scalable Distributed Data Structures. In Proc. VLDB'94, pages 342-353, Sept. 1994.
    • (1994) Proc. VLDB'94 , pp. 342-353
    • Litwin, W.1    Neimat, M.-A.2    Schneider, D.3
  • 14
    • 84889681906 scopus 로고    scopus 로고
    • Boxwood: Abstractions as the foundation for storage infrastructure
    • Dec
    • J. MacCormick, N. Murphy, M. Najork, C. Thekkath, and L. Zhou. Boxwood: Abstractions as the foundation for storage infrastructure. In Proc. OSDI'04, pages 105-120, Dec. 2004.
    • (2004) Proc. OSDI'04 , pp. 105-120
    • MacCormick, J.1    Murphy, N.2    Najork, M.3    Thekkath, C.4    Zhou, L.5
  • 15
    • 0005297489 scopus 로고
    • ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes
    • Aug
    • C. Mohan. ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. In Proc. VLDB'90, pages 392-405, Aug. 1990.
    • (1990) Proc. VLDB'90 , pp. 392-405
    • Mohan, C.1
  • 17
    • 0001824544 scopus 로고
    • Concurrent operations on B-trees with overtaking
    • Mar
    • Y. Sagiv. Concurrent operations on B-trees with overtaking. In Proc. PODS'85, pages 28-37, Mar. 1985.
    • (1985) Proc. PODS'85 , pp. 28-37
    • Sagiv, Y.1
  • 18
    • 0029203481 scopus 로고
    • Software transactional memory
    • Aug
    • N. Shavit and D. Touitou. Software transactional memory. In Proc. PODC'95, pages 204-213, Aug. 1995.
    • (1995) Proc. PODC'95 , pp. 204-213
    • Shavit, N.1    Touitou, D.2
  • 20
    • 0034782005 scopus 로고    scopus 로고
    • Chord A scalable peer-to-peer lookup service for Internet applications
    • Aug
    • I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. SIGCOMM'01, pages 149-160, Aug. 2001. [21] Sun Microsystems. Lustre, 2008. Online: http://lustre.org/.
    • (2001) Proc. SIGCOMM'01 , pp. 149-160
    • Stoica, I.1    Morris, R.2    Karger, D.3    Kaashoek, F.4    Balakrishnan, H.5
  • 21
    • 85038459702 scopus 로고    scopus 로고
    • Sun Microsystems. Lustre, Online
    • The Apache Software Foundation. Hadoop, 2008. Online: http://hadoop.apache.org/.
    • (2008)
  • 22
    • 85038450484 scopus 로고    scopus 로고
    • The Apache Software Foundation. Hadoop Online
    • (2008)


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