Effectively indexing uncertain moving objects for predictive queries

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 1198-1209

  Zhang, Meihui ^a   Chen, Su ^a   Jensen, Christian S ^b   Ooi, Beng Chin ^a   Zhang, Zhenjie ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); INTELLIGENT SYSTEMS; LOCATION; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TELECOMMUNICATION SERVICES; TRAFFIC CONTROL;

INFERENCE METHODS; INTELLIGENT TRANSPORT SYSTEMS; MOVING OBJECT INDEXING; NEAREST NEIGHBOR QUERIES; OBJECT MOVEMENTS; PREDICTIVE QUERY; REAL-WORLD OBJECTS; UNCERTAIN ENVIRONMENTS;

LOCATION BASED SERVICES;

EID: 84865101075     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687762     Document Type: Article

References (21)

1. G. Beskales, M. A. Soliman, and I. F. Ilyas. Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases. PVLDB, 1(1):326-339, 2008.
2. S. Chen, C. S. Jensen, and D. Lin. A Benchmark for Evaluating Moving Objects Indexes In VLDB. pp. 1574-1585, 2008.
3. +-Tree Index for Moving Objects. In SIGMOD Conference, pp. 29-42, 2008.
4. R. Cheng, J. Chen, M. F. Mokbel, and C.-Y. Chow. Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data. In ICDE, pp. 973-982, 2008.
5. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating Probabilistic Queries over Imprecise Data. In SIGMOD Conference, pp. 551-562, 2003.
6. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Querying Imprecise Data in Moving Object Environments. IEEE TKDE, 16(9):1112-1127, 2004.
7. S. Guo, Z. Huang, H. V. Jagadish, B. C. Ooi, and Z. Zhang. Relaxed Space Bounding for Moving Objects: A Case for the Buddy Tree. SIGMOD Record, 35(4):24-29, 2006.
8. +-Tree Based Indexing of Moving Objects. In VLDB, pp. 768-779, 2004.
9. +-Tree-Based Indexing of Moving Objects. In MDM, 9 pages, 2006.
10. C. S. Jensen, D. Tiešytė, N. Tradišauskas. The COST Benchmark-Comparison and Evaluation of Spatio-Temporal Indexes. In DASFAA, pp. 125-140, 2006.
11. H. Jeung, Q. Liu, H. T. Shen, and X. Zhou. A Hybrid Prediction Model for Moving Objects. In ICDE, pp. 70-79, 2008.
12. M. Kornacker and D. Banks. High-Concurrency Locking in R-Trees. In VLDB, pp. 134-145, 1995.
13. M. Kornacker, C. Mohan, and J. M. Hellerstein. Concurrency and Recovery in Generalized Search Trees. In SIGMOD Conference, pp. 62-72, 1997.
14. H.-P. Kriegel, P. Kunath, and M. Renz. Probabilistic Nearest-Neighbor Query on Uncertain Objects. In DASFAA, pp. 337-348, 2007.
15. D. Lin, C. S. Jensen, B. C. Ooi, and S. Šaltenis. Efficient Indexing of the Historical, Present, and Future Positions of Moving Objects. In MDM, pp. 59-66, 2005.
16. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
17. S. Šaltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In SIGMOD Conference, pp. 331-342, 2000.
18. V. Srinivasan and M. J. Carey. Performance of B-Tree Concurrency Control Algorithms. In SIGMOD Conference, pp. 416-425, New York, NY, USA, 1991. ACM Press.
19. Y. Tao, C. Faloutsos, D. Papadias, and B. Liu. Prediction and Indexing of Moving Objects with Unknown Motion Patterns. In SIGMOD Conference, pp. 611-622, 2004.
20. *-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In VLDB, pp. 790-801, 2003.
21. G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain. Managing Uncertainty in Moving Objects Databases. ACM Trans. Database Syst., 29(3):463-507, 2004.