1888 search results - page 23 / 378 » Algorithms for Querying by Spatial Structure |
167
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
- The embedding of positioning capabilities in mobile devices and the emergence of location-based applications have created novel opportunities for utilizing several types of multi...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
114
click to vote
SAC
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...
SSD
1993
Springer
15 years 2 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
JEA
2008
14 years 10 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...