Sciweavers

1888 search results - page 1 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 9 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
SSD
1995
Springer
97views Database» more  SSD 1995»
13 years 9 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
ICPP
1994
IEEE
13 years 9 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
GIS
2009
ACM
13 years 10 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
GIS
1995
ACM
13 years 9 months ago
A Window Retrieval Algorithm for Spatial Databases Using Quadtrees
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
Walid G. Aref, Hanan Samet