Sciweavers

168 search results - page 20 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
GEOINFO
2003
13 years 9 months ago
Efficient Query Processing on the Relational Quadtree
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
GIS
2008
ACM
14 years 9 months ago
Monitoring continuous queries over streaming locations
We report on our experience from design and implementation of a powerful map application for managing, querying and visualizing evolving locations of moving objects. Instead of bu...
Kostas Patroumpas, Evi Kefallinou, Timos K. Sellis
INFORMS
2010
110views more  INFORMS 2010»
13 years 5 months ago
Incremental Satisfiability and Implication for UTVPI Constraints
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
Andreas Schutt, Peter J. Stuckey
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
SSD
2007
Springer
176views Database» more  SSD 2007»
14 years 2 months ago
Distributed, Concurrent Range Monitoring of Spatial-Network Constrained Mobile Objects
The ability to continuously monitor the positions of mobile objects is important in many applications. While most past work has been set in Euclidean spaces, the mobile objects rel...
Hua Lu, Zhiyong Huang, Christian S. Jensen, Linhao...