A study of Erlang ETS table implementations and performance

@inproceedings{Fritchie2003ASO,
  title={A study of Erlang ETS table implementations and performance},
  author={Scott Lystig Fritchie},
  booktitle={Erlang Workshop},
  year={2003}
}
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.Benchmark results show that ETS table insertion, lookup, and update operations… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

Towards an efficient verification approach on network configuration

2012 8th international conference on network and service management (cnsm) and 2012 workshop on systems virtualiztion management (svm) • 2012
View 1 Excerpt

Radix Plus Length Based Insert Sort

Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) • 2008

Optimising TCP/IP connectivity

Erlang Workshop • 2007
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Judy functions — C libraries for creating and accessing dynamic arrays

D. Baskins
Available at http://judy.sourceforge.net/ as of July • 2003
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…