메뉴 건너뛰기




Volumn 21, Issue 4, 1996, Pages 480-525

LH*-A Scalable, Distributed Data Structure

Author keywords

Algorithms; Data structures; Design; Distributed access methods; E.1 Data : Data Structures; E.2 Data : Data Storage Representations hash table representations; Extensible hashing; H.2.1 Database Management : Logical Design; Linear hashing; Performance

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; RANDOM ACCESS STORAGE;

EID: 0030400983     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/236711.236713     Document Type: Article
Times cited : (152)

References (30)
  • 1
    • 84976786194 scopus 로고
    • High-speed local area networks and their performance: A survey
    • ABEYSUNDARA, B. W. AND KAMAL, A. E. 1991. High-speed local area networks and their performance: A survey. ACM Comput. Surv. 23, 2 (June).
    • (1991) ACM Comput. Surv. , vol.23 , Issue.2 JUNE
    • Abeysundara, B.W.1    Kamal, A.E.2
  • 4
    • 0026870271 scopus 로고
    • Parallel database systems: The future of high performance database systems
    • DEWITT, D. AND GRAY, J. 1992. Parallel database systems: The future of high performance database systems. Commun. ACM 35, 6, (June).
    • (1992) Commun. ACM , vol.35 , Issue.6 JUNE
    • Dewitt, D.1    Gray, J.2
  • 6
    • 0024030226 scopus 로고
    • Dynamic hashing systems
    • ENBODY, R. AND DU, H. 1988. Dynamic hashing systems. ACM Comput. Surv. 20, 2 (June).
    • (1988) ACM Comput. Surv. , vol.20 , Issue.2 JUNE
    • Enbody, R.1    Du, H.2
  • 8
    • 1542646584 scopus 로고
    • FDDI routers and bridges create niche for memories
    • GALLANT, J. 1992. FDDI routers and bridges create niche for memories. In EDN (April).
    • (1992) EDN , Issue.APRIL
    • Gallant, J.1
  • 11
    • 0028448418 scopus 로고
    • Distributing a search tree among a growing number of processors
    • KROLL, B. AND WIDMAYER, P. 1994. Distributing a search tree among a growing number of processors. In Proceedings of ACM-SIGMOD, (May).
    • (1994) Proceedings of ACM-SIGMOD , Issue.MAY
    • Kroll, B.1    Widmayer, P.2
  • 12
    • 0017913828 scopus 로고
    • Dynamic hashing
    • LARSON, P. A. 1978. Dynamic hashing. BIT, 184-201.
    • (1978) BIT , pp. 184-201
    • Larson, P.A.1
  • 13
    • 0019339563 scopus 로고
    • Linear hashing with partial expansions
    • LARSON, P. A. 1980. Linear hashing with partial expansions. In Proceedings of VLDB.
    • (1980) Proceedings of VLDB
    • Larson, P.A.1
  • 14
    • 0023998205 scopus 로고
    • Dynamic hash tables
    • LARSON, P. A. 1988. Dynamic hash tables. Commun. ACM 31, 4 (April) 446-57.
    • (1988) Commun. ACM , vol.31 , Issue.4 APRIL , pp. 446-457
    • Larson, P.A.1
  • 15
    • 0019340140 scopus 로고
    • Linear hashing: A new tool for file and table addressing
    • Montreal, Canada
    • LITWIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of VLDB, (Montreal, Canada). Reprinted in Reading in Database Systems, M. Stonebraker Ed., Morgan Kaufmann, 2nd ed., 1995.
    • (1980) Proceedings of VLDB
    • Litwin, W.1
  • 16
    • 0003980387 scopus 로고
    • Morgan Kaufmann, 2nd ed.
    • LITWIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of VLDB, (Montreal, Canada). Reprinted in Reading in Database Systems, M. Stonebraker Ed., Morgan Kaufmann, 2nd ed., 1995.
    • (1995) Reading in Database Systems
    • Stonebraker, M.1
  • 18
    • 12444261097 scopus 로고
    • RP*: A family of order-preserving scalable distributed data structures
    • LITWIN, W., NEIMAT, M.-A., AND SCHNEIDER, D. 1994. RP*: A family of order-preserving scalable distributed data structures. In Proceedings of VLDB, (Sept.).
    • (1994) Proceedings of VLDB , Issue.SEPT.
    • Litwin, W.1    Neimat, M.-A.2    Schneider, D.3
  • 19
    • 0025530056 scopus 로고
    • Distributed file systems: Concepts and examples
    • LEVY, E. AND SILBERSCHATZ, A. 1990. Distributed file systems: Concepts and examples. ACM Comput. Surv. 22, 4 (Dec.).
    • (1990) ACM Comput. Surv. , vol.22 , Issue.4 DEC.
    • Levy, E.1    Silberschatz, A.2
  • 20
    • 1542751929 scopus 로고
    • The fastest LAN alive
    • NANCE, B. 1992. The fastest LAN alive. Byte, (June) 70-74.
    • (1992) Byte , Issue.JUNE , pp. 70-74
    • Nance, B.1
  • 22
    • 0004280679 scopus 로고
    • Prentice Hall, Englewood Cliffs, NJ
    • SALZBERG, B. 1988. File Structures. Prentice Hall, Englewood Cliffs, NJ.
    • (1988) File Structures
    • Salzberg, B.1
  • 25
    • 4043062920 scopus 로고
    • Distributed linear hashing and parallel projection in main memory databases
    • SEVERANCE, C., PRAMANIK, S., AND WOLBERG, P. 1990. Distributed linear hashing and parallel projection in main memory databases. In Proceedings of VLDB,
    • (1990) Proceedings of VLDB
    • Severance, C.1    Pramanik, S.2    Wolberg, P.3
  • 26
    • 0002291775 scopus 로고
    • The case for shared nothing
    • STONEBRAKER, M. 1986. The case for shared nothing. Database Eng. 9, 1.
    • (1986) Database Eng. , vol.9 , Issue.1
    • Stonebraker, M.1
  • 29
    • 0028449143 scopus 로고
    • Database in crisis and transition: A technical agenda for the year 2001
    • VASKEVITCH, D. 1994. Database in crisis and transition: A technical agenda for the year 2001. In Proceedings of ACM-SIGMOD (May).
    • (1994) Proceedings of ACM-SIGMOD , Issue.MAY
    • Vaskevitch, D.1


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