2514 search results - page 87 / 503 » On the Computation of Approximations of Database Queries |
166
click to vote
MDM
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile s...
304
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
182
click to vote
TODS
2002
15 years 6 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
194
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
156
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...