2514 search results - page 189 / 503 » On the Computation of Approximations of Database Queries |
190
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
283
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- Recent work has demonstrated that readings provided by commodity sensor nodes are often of poor quality. In order to provide a valuable sensory infrastructure for monito...
254
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
167
click to vote
BIRTHDAY
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
168
click to vote
CCS
2005
ACM
16 years 4 days ago
2005
ACM
We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conve...