23 search results - page 1 / 5 » A Cost Model for Interval Intersection Queries on RI-Trees |
SSDBM
2002
IEEE
13 years 9 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...
DASFAA
2004
IEEE
13 years 8 months ago
2004
IEEE
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
GEOINFORMATICA
1998
13 years 4 months ago
1998
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...