Sciweavers

1923 search results - page 222 / 385
» Ranking in Spatial Databases
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 1 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...
SSD
2001
Springer
145views Database» more  SSD 2001»
14 years 23 days ago
Continuous Queries within an Architecture for Querying XML-Represented Moving Objects
The development of spatiotemporal database systems is primarily motivated by applications tracking and presenting mobile objects. Another important trend is the visualization and p...
Thomas Brinkhoff, Jürgen Weitkämper
GIS
2006
ACM
13 years 8 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 9 months ago
MAPLE: A Mobile Scalable P2P Nearest Neighbor Query System for Location-based Services
In this demonstration we present MAPLE, a scalable peer-to-peer Nearest Neighbor (NN) query system for mobile environments. MAPLE is designed for the efficient sharing of query re...
Wei-Shinn Ku, Roger Zimmermann, Chi-Ngai Wan, Haoj...
MOBIDE
2005
ACM
14 years 1 months ago
Context-aware optimization of continuous range queries maintenance for trajectories
This work addresses the problem of efficient maintenance of the (correct) answers to the continuous spatio-temporal range queries in Moving Objects Databases (MOD), which represen...
Goce Trajcevski, Hui Ding, Peter Scheuermann