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: It s an interface for using Trie Trees (data structure application) (used for implementing optimal sets...with applications on text data as input...foe example dictionaries) and a test program with CLI in a form of a menu to test those features. Platform: |
Size: 30720 |
Author:Cosmin |
Hits:
Description: The problem of efficient data structures for IP
lookups has been well studied in literature. Techniques such as
LC tries and Extensible Hashing are commonly used. In this
paper, we address the problem of generalizing LC tries and
Extensible Hashing, based on traces of past lookups, to provide
performance guarantees for memory sub-optimal structures. As
a specific example, if a memory-optimal (LC) trie takes 6MB and
the total memory at the router is 8MB, how should the trie be
modified to make best use of the 2 MB of excess memory? We
present a greedy algorithm for this problem and prove that, if
for the optimal data structure there are b fewer memory accesses Platform: |
Size: 147456 |
Author:asad2001 |
Hits:
Description: Trie树,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串。它的优点是：利用字符串的公共前缀来节约存储空间，是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use of a string of public prefix to save storage space, is a relatively simple data structures. Is relatively simple to understand them, but the Trie tree also has its shortcomings, Trie tree is very big memory consumption. Platform: |
Size: 2048 |
Author:youyu |
Hits:
Description: Trie树,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串。它的优点是：利用字符串的公共前缀来节约存储空间，是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use of a string of public prefix to save storage space, is a relatively simple data structures. Is relatively simple to understand them, but the Trie tree also has its shortcomings, Trie tree is very big memory consumption. Platform: |
Size: 55296 |
Author:youyu |
Hits:
Description: trie树的一个实现 trie树是在字符串匹配中常用的一种高效数据结构-trie tree trie tree is a realization of the string matching used in an efficient data structure Platform: |
Size: 515072 |
Author:袁梦 |
Hits:
Description: poj上1816题，用静态trie树这个数据结构实现-poj on the 1816 title, with the static trie tree data structure to achieve this Platform: |
Size: 1024 |
Author:fjy |
Hits:
Description: 自己实现的trie树结构，能够较为高效实现数据的各种查询操作-Own implementation of trie tree structure, to a variety of more efficient data queries Platform: |
Size: 595968 |
Author:bertrand |
Hits:
Description: Trie是一种树型数据结构，用于存储字符串，可以实现字符串的快速查找。Trie的核心思想是空间换时间，利用字符串的公共前缀来降低查询时间的开销以达到提高效率的目的。
适用范围：统计和排序大量的字符串-Trie is a tree data structure used to store the string, the string can quickly find. Trie' s core idea is space for time, use the string prefix to reduce the public cost of the query time to achieve the purpose of increasing efficiency. Scope: Statistics and sorting a large number of strings Platform: |
Size: 1024 |
Author:咋都有 |
Hits:
Description: 讲述了数据结构中的并查集, DFA, Trie树，Trie图等算法，并且含有例题。-Describes the data structure and set of check, DFA, Trie tree, Trie FIG algorithms and contains examples. Platform: |
Size: 2472960 |
Author:司思思 |
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:
Description: It implements a Trie data structure to store key/value pairs, also it has a trie for all valid commands.
TrieRun class takes a file name (with complete path) as an input user and then it reads the file line by line and the commands. TestFile.txt present in the /src has the commands which can be used to test the working of the project.
com.junit package includes a JunitTest class and other test cases as Junit Test Suite-It implements a Trie data structure to store key/value pairs, also it has a trie for all valid commands.
TrieRun class takes a file name (with complete path) as an input user and then it reads the file line by line and the commands. TestFile.txt present in the /src has the commands which can be used to test the working of the project.
com.junit package includes a JunitTest class and other test cases as Junit Test Suite Platform: |
Size: 231424 |
Author:java dev |
Hits:
Search - trie data structure