Sciweavers

90 search results - page 13 / 18
» Continuous obstructed nearest neighbor queries in spatial da...
Sort
View
PODS
1989
ACM
155views Database» more  PODS 1989»
13 years 11 months ago
Fractals for Secondary Key Retrieval
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secon...
Christos Faloutsos, Shari Roseman
GEOINFORMATICA
2006
94views more  GEOINFORMATICA 2006»
13 years 7 months ago
Spatial Query Estimation without the Local Uniformity Assumption
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
Yufei Tao, Christos Faloutsos, Dimitris Papadias
GIS
2005
ACM
14 years 8 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
MOBIDE
2010
ACM
13 years 8 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
ISCI
2007
141views more  ISCI 2007»
13 years 7 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&...