308 search results - page 39 / 62 » Sharing aggregate computation for distributed queries |
99
Voted
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
AH
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
115
click to vote
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
110
click to vote
IPSN
2007
Springer
15 years 3 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...
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
Running multiple virtual networks, customized for different performance objectives, is a promising way to support diverse applications over a shared substrate. Despite being simpl...