3 search results - page 1 / 1 » Burst tries: a fast, efficient data structure for string key... |
TOIS
2002
13 years 4 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...