A Study of Erlang ETS Table Implementations and Performance (2003) [2 citations — 0 self]
by
Scott Lystig Fritchie
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Fritchie03astudy,
author = {Scott Lystig Fritchie},
title = {A Study of Erlang ETS Table Implementations and Performance},
year = {2003}
}
author = {Scott Lystig Fritchie},
title = {A Study of Erlang ETS Table Implementations and Performance},
year = {2003}
}
Bookmarks
OpenURL
Abstract:
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables based on four data structures: AVL balanced binary trees, B-trees, resizable linear hash tables, and Judy arrays. The benchmarks used workloads of sequentially- and randomly-ordered keys at table populations from 700 keys to 54 million keys.
Citations
| 74 | Concurrent programming in Erlang – Armstrong, Virding, et al. - 1996 |
| 4 | AXD 301: A new generation ATM switching system. Computer Networks – Blau, Rooth, et al. - 1999 |
| 1 | A 10-Minute Description of How Judy Arrays Work and Why They Are So Fast. Available at http://judy.sourceforge.net/downloads/- 10minutes.htm as of – Baskins - 2003 |
| 1 | Judy functions — C libraries for creating and accessing dynamic arrays. Available at http://judy.sourceforge.net/ as of – Baskins - 2003 |
