53 search results - page 3 / 11 » A Cost Model for Spatial Intersection Queries on RI-Trees |
DKE
2006
13 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
GIS
2005
ACM
14 years 8 months ago
2005
ACM
Topological predicates, as derived from the 9-intersection model, have been widely recognized in GIS, spatial database systems, and many other geo-related disciplines. They are ba...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
IS
2008
13 years 7 months ago
2008
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...