627 search results - page 89 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
161
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
259
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
140
click to vote
IPMI
2007
Springer
16 years 7 months ago
2007
Springer
Tracking of tubular elongated structures is an important goal in a wide range of biomedical imaging applications. A Bayesian tube tracking algorithm is presented that allows to eas...
172
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
280
click to vote
ICDE
1998
IEEE
16 years 7 months ago
1998
IEEE
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...