Sciweavers

856 search results - page 19 / 172
» Location-based Spatial Queries
Sort
View
PVLDB
2010
225views more  PVLDB 2010»
13 years 5 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
GIS
1997
ACM
14 years 2 months ago
Speeding up Bulk-Loading of Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...
Gísli R. Hjaltason, Hanan Samet, Yoram J. S...
ICPP
1994
IEEE
14 years 3 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
14 years 3 months ago
Integration of Spatial Join Algorithms for Processing Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
Nikos Mamoulis, Dimitris Papadias
GIS
2007
ACM
14 years 2 months ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref