709 search results - page 1 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
MDM
2010
Springer
13 years 6 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
ICDE
2009
IEEE
13 years 2 months ago
2009
IEEE
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first main