[erlang-questions] cost of operations in ordered_set tables

Sverker Eriksson <>
Mon Jun 16 13:59:07 CEST 2008


Ets ordered_set's are AVL-trees. The cost for insert() and delete() are 
thus O(log n).

/Sverker, Erlang/OTP Ericsson

Yariv Sadan wrote:
> Hi,
> What are the costs of insert() and delete() in ordered_set ets tables?
> Are they O(log n)? Also, what kind of tree is used to store the keys?
> Is it a balanced tree (e.g. red-black tree)?
> Thanks,
> Yariv
> _______________________________________________
> erlang-questions mailing list
> http://www.erlang.org/mailman/listinfo/erlang-questions

More information about the erlang-questions mailing list