126 search results - page 8 / 26 » Storing a Compressed Function with Constant Time Access |
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
CIKM
2009
Springer
14 years 10 days ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
MSS
2000
IEEE
14 years 2 days ago
2000
IEEE
Over the last decade, processors have made enormous gains in speed. But increase in the speed of the secondary and tertiary storage devices could not cope with these gains. The re...
JAIR
2007
13 years 7 months ago
2007
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...