Sciweavers

55 search results - page 1 / 11
» Compact dictionaries for variable-length keys and data with ...
Sort
View
MSV
2004
14 years 12 days ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
TALG
2008
75views more  TALG 2008»
13 years 11 months ago
Compact dictionaries for variable-length keys and data with applications
Daniel K. Blandford, Guy E. Blelloch
ACSC
2009
IEEE
14 years 5 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
IPL
2010
94views more  IPL 2010»
13 years 9 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 11 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono