1888 search results - page 76 / 378 » Algorithms for Querying by Spatial Structure |
156
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
161
click to vote
VLDB
1997
ACM
15 years 8 months ago
1997
ACM
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural...
169
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
118
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
148
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...