25 search results - page 1 / 5 » Distributed Arrays: A P2P Data Structure for Efficient Logic... |
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
LCN
2008
IEEE
13 years 11 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
ICDE
2008
IEEE
14 years 5 months ago
2008
IEEE
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
FAST
2004
13 years 6 months ago
2004
The Atropos logical volume manager allows applications to exploit characteristics of its underlying collection of disks. It stripes data in track-sized units and explicitly expose...
PPOPP
1995
ACM
13 years 8 months ago
1995
ACM
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...