메뉴 건너뛰기




Volumn , Issue , 2003, Pages 43-55

A study of Erlang ETS table implementations and performance

Author keywords

AVL tree; B tree; Erlang; Hash table; In memory database; Judy array

Indexed keywords

ADDITIONAL COSTS; AVL TREE; B TREES; BALANCED BINARY TREE; CONSISTENT PERFORMANCE; DATA CACHES; HASH TABLE; LOOKUPS; MEMORY DATABASE; MEMORY USAGE; OTHER APPLICATIONS;

EID: 38849205906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/940880.940887     Document Type: Conference Paper
Times cited : (10)

References (13)
  • 5
    • 0003692681 scopus 로고    scopus 로고
    • C. DiBona, S. Ockman, and M. Stone, editors. O'Reilly & Associates, Sebastopol, California, Appendix B
    • C. DiBona, S. Ockman, and M. Stone, editors. Open Sources: Voices of the Open Source Revolution. O'Reilly & Associates, Sebastopol, California, 1999. Appendix B.
    • (1999) Open Sources: Voices of the Open Source Revolution
  • 11
    • 84867454144 scopus 로고    scopus 로고
    • Mnesia - A Distributed Robust DBMS for Telecommunications Applications
    • In Practical Aspects of Declarative Languages (PADL '99), Springer
    • H. Mattsson, H. Nilsson, and C. Wikström. Mnesia - A Distributed Robust DBMS for Telecommunications Applications. In Practical Aspects of Declarative Languages (PADL '99), volume 1551 of Lecture Notes in Computer Science. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1551
    • Mattsson, H.1    Nilsson, H.2    Wikström, C.3
  • 13


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