Sciweavers

26 search results - page 2 / 6
» Maintenance of Spatial Semijoin Queries on Moving Points
Sort
View
GIS
2002
ACM
13 years 8 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...
MDM
2007
Springer
126views Communications» more  MDM 2007»
14 years 2 months ago
Semantics of Spatially-Aware Windows Over Streaming Moving Objects
Several window constructs are usually specified in continuous queries over data streams as a means of limiting the amount of data processed each time and thus providing real-time...
Kostas Patroumpas, Timos K. Sellis
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
13 years 8 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 8 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia