Results 1 -
1 of
1
LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME
- SIAM J. COMPUT.
, 2001
"... A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size Θ(log |U|), a static dictionary for n-element sets with constant worst case query time can be obtained using B +O(log log |U|)+o(n) (|U|) bits ..."
Abstract
-
Cited by 40 (6 self)
- Add to MetaCart
A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size Θ(log |U|), a static dictionary for n-element sets with constant worst case query time can be obtained using B +O(log log |U|)+o(n) (|U|) bits of storage, where B = ⌈log2 ⌉ is the minimum number of bits needed to represent all n-n element subsets of U.
