MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Trie Hashing." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

21 documents found, showing 1 through 10. Next 10 →

ATOM

Red-Black Trie Hashing
by E.J. Otoo, S. Effah — 1995
…Red-Black Trie Hashing Otoo, E. J. and Effah, S. School of Computer Science Carleton University…
Cited by 2 (0 self) – Add To MetaCart

Red-Black Balanced Trie Hashing
by E. J. Otoo, S. Effah — 1995
…Red-Black Balanced Trie Hashing Otoo, E. J. and Effah, S. School of Computer Science Carleton…
Add To MetaCart

Range Queries over DHTs
by Sylvia Ratnasamy, Sylvia Ratnasamy, Joseph M. Hellerstein, Joseph M. Hellerstein, Scott Shenker, Scott Shenker — 2003
… is stored at the DHT node obtained by hashing its corresponding prefix. This hash-based assignment of trie…
Cited by 16 (1 self) – Add To MetaCart

Performance of Data Structures for Small Sets of Strings
by Steffen Heinz, Justin Zobel — 2002 — Proc. of the Australasian conference on Computer Science
… than a compact trie, but has memory requirements close to that of trees and hash tables. Hash tables…
Cited by 1 (0 self) – Add To MetaCart

Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs
by Shenfeng Chen, John H. Reif
… trie and hash table data structures. We can also apply this method for priority queue. Given a…
Cited by 15 (3 self) – Add To MetaCart

Efficient Profile Indexing Algorithms for Information Dissemination
by Yannis Drougas — 2003
… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 4 The HashTrie Method for Boolean Profiles 22 4.1 Method Description…
Add To MetaCart

Compact Balanced Tries
by Pierre Nicodème, De Jonge, Van De — 25
… the B \Gammatree properties: the bounding disorder method [8], Trie hashing [7], compact 0-complete tree…
Cited by 1 (0 self) – Add To MetaCart

Trie Methods for Structured Data on Secondary Storage
by Xiaoyan Zhao — 2000
… Tries and Trie Hashing . . . . . . . . . . . . . . . . . . 18 2.5.3 FuTrie, OrTrie and PaTrie…
Cited by 1 (0 self) – Add To MetaCart

Computer Go
by Martin Müller — 2000
… of the Go board Structure of the trie or hash table used for organizing the patterns Number of currently…
Cited by 26 (0 self) – Add To MetaCart

A robust scheme for multilevel extendible hashing
by Sven Helmer, Sven Helmer, Thomas Neumann, Thomas Neumann, Guido Moerkotte, Guido Moerkotte — 2003 — Proc. 18th ISCIS
… with the approaches by Otoo and Du/Tong in Section 6. A different approach, trie hashing, to index long alphanumeric…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB