介绍了Judy，它是一个C语言库，实现了稀疏动态数组这一先进核心技术。Judy树通常比二叉树、b树等当代树形式更快且更省内存，在特定配置下比哈希方法也更快。还给出了相关链接，因原理难懂先留存待日后使用。
Judy is a C library that provides a state-of-the-art core technology
that implements a sparse dynamic array.
是否真的如作者说的那么快？
A Judy tree is generally faster than and uses less memory than
A Judy tree is generally faster than and uses less memory than
contemporary forms of trees such as binary (AVL) trees, b-trees,
and skip-lists. When used in the "Judy Scalable Hashing" configuration,
Judy is generally faster then a hashing method at all populations.
反正10分钟我是看不懂作者说的原理的：
先留着，以后有用。
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
