Sciweavers

123 search results - page 4 / 25
» Query Processing Using Distance Oracles for Spatial Networks
Sort
View
FUZZIEEE
2007
IEEE
14 years 2 months ago
A System for Querying with Qualitative Distances in Networks
A central role of Geographic Information Systems (GIS) is to allow the identification and visualisation of relevant spatial features from typically large volumes of data. This requ...
Carl P. L. Schultz, Hans W. Guesgen, Robert Amor
MOBIDE
2010
ACM
13 years 11 months ago
Direction-based spatial skylines
Traditional location-based services recommend nearest objects to the user by considering their spatial proximity. However, an object not only has its distance but also has its dir...
Xi Guo, Yoshiharu Ishikawa, Yunjun Gao
EDBT
1998
ACM
131views Database» more  EDBT 1998»
14 years 3 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
15 years 6 days ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
DKE
2006
123views more  DKE 2006»
13 years 11 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...