Sciweavers

Share
SBBD
2004
89views Database» more  SBBD 2004»
9 years 22 days ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
CVDB
2004
ACM
9 years 4 months ago
Nearest Neighbor Search on Multimedia Indexing Structures
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
Thomas Seidl
SAC
2009
ACM
9 years 6 months ago
GPU-based computation of distance functions on road networks with applications
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
Marta Fort, Joan Antoni Sellarès
GIS
2003
ACM
10 years 11 days ago
Nearest neighbor queries in road networks
With wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile ...
Christian S. Jensen, Jan Kolárvr, Torben Ba...
GIS
2007
ACM
10 years 12 days ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
GIS
2007
ACM
10 years 12 days ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
10 years 21 days ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
books