ACM Home Page
Please provide us with feedback. Feedback
Prediction and indexing of moving objects with unknown motion patterns
Full text PdfPdf (335 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Research sessions: moving objects table of contents
Pages: 611 - 622  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Yufei Tao  City University of Hong Kong, Hong Kong
Christos Faloutsos  Carnegie Mellon University, Pittsburgh
Dimitris Papadias  HKUST, Clear Water bay, Hong Kong
Bin Liu  HKUST, Clear Water bay, Hong Kong
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 116,   Citation Count: 13
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1007568.1007637
What is a DOI?

ABSTRACT

Existing methods for peediction spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice movement is more complex, and individual objects may follow drastically diffferent motion patterns. In order to overcome these problems, we first introduce a general framework for monitoring and indexing moving objects, where (i) each boject computes individually the function that accurately captures its movement and (ii) a server indexes the object locations at a coarse level and processes queries using a filter-refinement mechanism. Our second contribution is a novel recursive motion function that supports a broad class of non-linear motion patterns. The function does not presume any a-priori movement but can postulate the particular motion of each object by examining its locations at recent timestamps. Finally. we propse an efficient indexing scheme that faciliates the processing of predicitive queries without false misses.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
 
5
{HKT03} Hadjieleftheriou, M., Kollios, G., Tsotras, V. Performance Evaluation of Spatio-temporal Selectivity Estimation Techniques, SSDBM, 2003.
 
6
{HKTG02} Hadjieleftheriou, M., Kollios, G., Tsotras, V., Gunopulos, D. Efficient Indexing of Spatiotemporal Objects. EDBT, 2002.
 
7
{ISS03} Iwerks, G., Samet, H., Smith, K. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. VLDB, 2003.
8
 
9
{PFTV02} Press, W., Flannery, B., Teukolsky, S., Vetterling, W. Numerical Recipes in C++ (second edition). Combridge University Press, ISBN 0-521-75034-2, 2002.
10
 
11
{SJ02} Saltenis, S., Jensen, C. Indexing of Moving Objects for Location-Based Services. ICDE, 2002.
12
 
13
{Tiger} http://www.census.gov/geo/www/tiger/
14
 
15
{TPS03} Tao, Y., Papadia, D., Sun, J. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. VLDB, 2003.
 
16
{TSP03} Tao, Y., Sun, J., Papadias, D. Selectivity Estimation for Predictive Spatio-Temporal Queries. ICDE, 2003.
 
17
{TUW98} Tayeb, J., Ulusoy, O., Wolfson, O. A. Quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal, 41(3):185--200, 1998.

CITED BY  13
Collaborative Colleagues:
Yufei Tao: colleagues
Christos Faloutsos: colleagues
Dimitris Papadias: colleagues
Bin Liu: colleagues