301 search results - page 40 / 61 » Efficient Sketches for the Set Query Problem |
WWW
2005
ACM
15 years 11 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
182
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
Peer-to-peer (p2p) systems are attracting increasing attention as an efficient means of sharing data among large, diverse and dynamic sets of users. The widespread use of XML as a...
184
click to vote
ICDE
2005
IEEE
16 years 11 days ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
RTCSA
2009
IEEE
15 years 5 months ago
2009
IEEE
—Mobile sensors are widely deployed in Wireless Sensor Networks (WSNs) to satisfy emerging application requirements. Specifically, processing location dependent queries in mobile...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...