The TPR*-tree: An optimized spatio-temporal access method for predictive queries

Y Tao, D Papadias, J Sun - Proceedings 2003 VLDB conference, 2003 - Elsevier
Publisher Summary This chapter performs an analysis to determine the factors that affect the
performance of predictive queries and shows that several of these factors are not considered …

[图书][B] R-Trees: Theory and Applications: Theory and Applications

Y Manolopoulos, A Nanopoulos, AN Papadopoulos… - 2006 - books.google.com
Space support in databases poses new challenges in every part of a database management
system & the capability of spatial support in the physical layer is considered very important …

On trip planning queries in spatial databases

F Li, D Cheng, M Hadjieleftheriou, G Kollios… - … symposium on spatial …, 2005 - Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning
Query (TPQ). Given a set of points of interest P in space, where each point belongs to a …

Continuous nearest neighbor search

Y Tao, D Papadias, Q Shen - VLDB'02: Proceedings of the 28th …, 2002 - Elsevier
Publisher Summary A continuous nearest neighbor query retrieves the nearest neighbor
(NN) of every point on a line segment. The result contains a set of tuples, such that point is …

Group nearest neighbor queries

D Papadias, Q Shen, Y Tao… - … conference on data …, 2004 - ieeexplore.ieee.org
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point
(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three …

Continuous spatial query processing: A survey of safe region based techniques

J Qi, R Zhang, CS Jensen… - ACM Computing …, 2018 - dl.acm.org
In the past decade, positioning system-enabled devices such as smartphones have become
most prevalent. This functionality brings the increasing popularity of location-based services …

Monitoring k-nearest neighbor queries over moving objects

X Yu, KQ Pu, N Koudas - 21st International Conference on …, 2005 - ieeexplore.ieee.org
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN)
queries over moving objects within a geographic area. Existing approaches to this problem …

Prediction and indexing of moving objects with unknown motion patterns

Y Tao, C Faloutsos, D Papadias, B Liu - Proceedings of the 2004 ACM …, 2004 - dl.acm.org
Existing methods for peediction spatio-temporal databases assume that objects move
according to linear functions. This severely limits their applicability, since in practice …

Location-based spatial queries

J Zhang, M Zhu, D Papadias, Y Tao… - Proceedings of the 2003 …, 2003 - dl.acm.org
In this paper we propose an approach that enables mobile clients to determine the validity of
previous queries based on their current locations. In order to make this possible, the server …

Clustering moving objects

Y Li, J Han, J Yang - Proceedings of the tenth ACM SIGKDD …, 2004 - dl.acm.org
Due to the advances in positioning technologies, the real time information of moving objects
becomes increasingly available, which has posed new challenges to the database research …