320 search results - page 48 / 64 » Algebraic Signatures for Scalable Distributed Data Structure... |
DEBS
2010
ACM
15 years 3 months ago
2010
ACM
Today’s organisations require techniques for automated transformation of the large data volumes they collect during their operations into operational knowledge. This requirement...
118
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
111
click to vote
CCS
2008
ACM
15 years 1 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
87
Voted
EUROPAR
2001
Springer
15 years 4 months ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
HT
1999
ACM
15 years 4 months ago
1999
ACM
When the utility of a hypertext system depends on the number of users and amount of data in the system, the system exhibits network effects. This paper examines how the core diffe...