Sciweavers

46 search results - page 3 / 10
» Maintaining External Memory Efficient Hash Tables
Sort
View
BROADCOM
2008
IEEE
14 years 1 months ago
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R....
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
HPCA
2003
IEEE
14 years 7 months ago
Caches and Hash Trees for Efficient Memory Integrity
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...
Blaise Gassend, G. Edward Suh, Dwaine E. Clarke, M...
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
CIC
2003
140views Communications» more  CIC 2003»
13 years 8 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...