文件名称：A Study of Erlang ETS Table
文件大小：166KB
文件格式：PDF
更新时间：2012-12-11 16:05:11
Erlang
The viability of implementing an in-memory database, Er- lang 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.