Sciweavers

51 search results - page 2 / 11
» A fast unified optimal route query evaluation algorithm
Sort
View
ICPADS
2008
IEEE
14 years 1 days ago
Response Time Constrained Top-k Query Evaluation in Sensor Networks
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
EDBTW
2004
Springer
13 years 11 months ago
SPROUT: P2P Routing with Social Networks
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model t...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
SEMWEB
2004
Springer
13 years 11 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 5 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava