Sciweavers

7 search results - page 2 / 2
» tois 2002
Sort
View
TOIS
2002
97views more  TOIS 2002»
13 years 5 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
TOIS
2002
87views more  TOIS 2002»
13 years 5 months ago
Peer-to-peer data trading to preserve information
Data archiving systems rely on replication to preserve information. This paper discusses how a network of autonomousarchiving sites can trade data to achievethe most reliable repl...
Brian F. Cooper, Hector Garcia-Molina