MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Prefix B-Trees." – sorted by Relevance.

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

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

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

ATOM

Storage Overhead of O-trees, B-trees, and Prefix B-trees: A Comparative Analysis
by Ratko Orlandic, Hosam M. Mahmoud — 1996 — INT. J. FOUND. COMPUT. SCI.
… STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS RATKO ORLANDIC Department…
Cited by 1 (0 self) – Add To MetaCart

The String B-Tree: A New Data Structure for String Search in External Memory and its Applications.
by Paolo Ferragina, Roberto Grossi — 1998 — Journal of the ACM
…. Consequently, the String B-Tree overcomes the theoretical limitations of inverted files, B-trees, prefix B-trees…
Cited by 82 (10 self) – Add To MetaCart

Compact Balanced Tries
by Pierre Nicod Eme — 1992 — In Algorithms, Software, Architecture, Information Processing 92
… processing. The minimum storage utilization of a B-tree is 50%. Moreover it is always possible to shrink a B…
Cited by 1 (0 self) – Add To MetaCart

An experimental study of SB-trees
by Paolo Ferragina, Roberto Grossi — 1996 — In ACM-SIAM symposium on Discrete Algorithms
… the limitations of inverted files, suffix arrays, suffix trees, and prefix B-trees. In this paper, we study…
Cited by 2 (0 self) – Add To MetaCart

A B-Tree Dynamic Router-Table Design
by Haibin Lu, Sartaj Sahni — 2005 — IEEE Transactions on Computers
… for prefix filters and the B-tree router-table data structure of Suri et al. [20] is that in our data…
Cited by 3 (1 self) – Add To MetaCart

The SBC-Tree: An Index for Run-Length Compressed Sequences
by Mohamed Y. Eltabakh, Wing-kai Hon, Rahul Shah, Walid G. Aref, Jeffrey S. Vitter
…], tries [21, 35], B-trees [8, 16], and the prefix B-tree [9]. Several variants of these structures have…
Add To MetaCart

Amberfish at the trec 2004 terabyte track
by Nassib Nassar — 2004 — In The Thirteenth Text Retrieval Conference Proceedings (TREC 2004
… structures are a dictionary and linked postings lists [4], with a simple prefix B-tree used to store…
Cited by 2 (0 self) – Add To MetaCart

Lexicographical Indices for Text: Inverted files vs. PAT trees
by Gaston H. Gonnet, Ricardo A. Baeza-yates, Tim Snider — 1991
… point. There are several implementations for the index: a sorted array, prefix B-trees, tries, hashing…
Cited by 22 (0 self) – Add To MetaCart

Main-Memory Index Structures with Fixed-Size Partial Keys
by Philip Bohannon, Peter Mcilroy, Rajeev Rastogi — 2001
… compression schemes such as employed in prefix B-trees [4] have the disadvantage that the compressed keys…
Cited by 13 (0 self) – Add To MetaCart

Main-Memory Index Structures with Fixed-Size Partial Keys
by Philip Bohannon Peter, Peter Mcilroy, Rajeev Rastogi — 2001 — In Proceedings of SIGMOD Conference
… or dereferencing pointers. However, typical compression schemes such as employed in prefix B-trees [4] have…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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