Sciweavers

25 search results - page 4 / 5
» Efficient k Nearest Neighbor Queries on Remote Spatial Datab...
Sort
View
DKE
2006
123views more  DKE 2006»
13 years 6 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...
ISCI
2007
141views more  ISCI 2007»
13 years 6 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 8 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras
ICIP
2004
IEEE
14 years 8 months ago
Feature statistical retrieval applied to content-based copy identification
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
Alexis Joly, Carl Frélicot, Olivier Buisson
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 11 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han