109 search results - page 3 / 22 » Optimality in External Memory Hashing |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
HPCA
2003
IEEE
14 years 7 months ago
2003
IEEE
We study the hardware cost of implementing hash-tree based verification of untrusted external memory by a high performance processor. This verification could enable applications s...
AAAI
2006
13 years 8 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...