856 search results - page 108 / 172 » Location-based Spatial Queries |
95
Voted
EDBT
2006
ACM
16 years 28 days 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...
114
Voted
MDM
2007
Springer
15 years 7 months ago
2007
Springer
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of...
155
Voted
SSDBM
2002
IEEE
15 years 5 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
101
Voted
GIS
2008
ACM
15 years 1 months ago
2008
ACM
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
122
Voted
GEOINFO
2003
15 years 2 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...