53 search results - page 7 / 11 » A Cost Model for Spatial Intersection Queries on RI-Trees |
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
SSD
2001
Springer
14 years 1 months ago
2001
Springer
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
GIS
1995
ACM
14 years 4 days ago
1995
ACM
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
The popularity of mobile social networking services (mSNSs) is propelling more and more businesses, especially those in retailing and marketing, into mobile and location-based for...
GEOINFO
2003
13 years 10 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...