Description: Trie数据结构，一种字符串存储方式，可以提高字符串的查找效率-a data structure of Trie, which can be used for storing the strings and improve the searching efficiency for a given string Platform: |
Size: 324608 |
Author:黄异 |
Hits:
Description: 自己实现的trie树结构，能够较为高效实现数据的各种查询操作-Own implementation of trie tree structure, to a variety of more efficient data queries Platform: |
Size: 595968 |
Author:bertrand |
Hits:
Description: Distributed Hash Tables are scalable, robust, and
self-organizing peer-to-peer systems that support
exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree -
a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash
Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient
(updates are doubly logarithmic in the size of the
domain being indexed), and resilient (the failure
of any given node in the Prefix Hash Tree does
not affect the availability of data stored at other
nodes).
moshaverprozhe.ir
09308766416
ا ن ج ا م پ ر و ژ ه -Distributed Hash Tables are scalable, robust, and
self-organizing peer-to-peer systems that support
exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree -
a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash
Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient
(updates are doubly logarithmic in the size of the
domain being indexed), and resilient (the failure
of any given node in the Prefix Hash Tree does
not affect the availability of data stored at other
nodes).
moshaverprozhe.ir
09308766416
ا ن ج ا م پ ر و ژ ه Platform: |
Size: 686080 |
Author:moshaverprozhe.ir |
Hits:
Search - implementation of trie data structure