Sciweavers

709 search results - page 55 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 9 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
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...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 10 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
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...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
GIS
2005
ACM
16 years 6 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
ICDE
2010
IEEE
562views Database» more  ICDE 2010»
16 years 5 months ago
Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...
ICDE
2002
IEEE
136views Database» more  ICDE 2002»
16 years 7 months ago
Mixing Querying and Navigation in MIX
Web-based information systems provide to their users the ability to interleave querying and browsing during their information discovery efforts. The MIX system provides an API cal...
Pratik Mukhopadhyay, Yannis Papakonstantinou