Indexing moving objects using short-lived throwaway indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5644 LNCS, Issue , 2009, Pages 189-207

  Dittrich, Jens ^a   Blunschi, Lukas ^b   Vaz Salles, Marcos Antonio ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b ETH ZURICH   (Switzerland)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; EXPONENTIAL GROWTH; GERMANY; INDEX STRUCTURE; INDEXING MOVING OBJECTS; MAIN MEMORY; MASSIVE DATA SETS; MOVING OBJECT INDEXING; MOVING OBJECTS; ORDERS OF MAGNITUDE; PARAMETERIZED; PREDICTIVE QUERY; QUERY RESPONSE TIME; QUERY RESULTS; ROAD NETWORK; ROAD SEGMENTS; SHORT PERIODS;

INDEXING (OF INFORMATION); MOTION PICTURES; MOTOR TRANSPORTATION; ROADS AND STREETS;

TRACKING (POSITION);

EID: 70350389140     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02982-0_14     Document Type: Conference Paper

References (52)

1. Anderson, I., et al.: Shakra: Tracking and Sharing Daily Activity Levels with Unaugmented Mobile Phones. Mobile Networks and Applications 12(2-3) (2007)
2. Arge, L.: The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955. Springer, Heidelberg (1995)
3. *-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD (1990)
4. Biveinis, L., Šaltenis, S., Jensen, C.S.: Main-Memory Operation Buffering for Efficient R-Tree Update. In: VLDB (2007)
5. Brinkhoff, T.: A Framework for Generating Networkbased Moving Objects. GeoInformat-ica 6(2), 153-180 (2002)
6. Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal Prefetching B+trees: Optimizing Both Cache and Disk Performance. In: SIGMOD (2002)
7. Cui, B., Lin, D., Tan, K.-L.: Towards Optimal Utilization of Main Memory for Moving Object Indexing. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 600-611. Springer, Heidelberg (2005)
8. Dittrich, J.-P., Fischer, P.M., Kossmann, D.: AGILE: Adaptive Indexing for Context-Aware Information Flters. In: SIGMOD (2005)
9. Dittrich, J.-P., Seeger, B.: GESS: a Scalable Similarity-Join Algorithm for Mining Large Data Sets in High Dimensional Spaces. In: SIGKDD (2001)
10. Enhanced 911, http://www.fcc.gov/pshs/911
11. Google Web Search, http://www.google.com
12. Graefe, G.: B-tree indexes for high update rates. SIGMOD Rec. 35(1) (2006)
13. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)
14. Hilbert, D.: Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen 38, 459-460 (1891)
15. Hough, P.: Method and means for recognizing complex patterns. United States Patent No. 3069654 (1962)
16. Jagadish, H.V., et al.: Incremental Organization for Data Recording and Warehousing. In: VLDB (1997)
17. Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In: VLDB (2004)
18. Jensen, C.S., Pakalnis, S.: TRAX - Real-World Tracking of Moving Objects. In: VLDB (2007)
19. Kalashnikov, D.V., Prabhakar, S., Hambrusch, S.E.: Main Memory Evaluation of Monitoring Queries Over Moving Objects. Distributed and Parallel Databases 15(2), 117-135 (2004)
20. Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)
21. Kollios, G., Papadopoulos, D., Gunopulos, D., Tsotras, J.: Indexing mobile objects using dual transformations. VLDB Journal 14(2), 238-256 (2005)
22. Kraftfahrt-Bundesamt. Number of Vehicles in Germany over time, www.kba.de/Abt3-neu/FZ/Bestand/Themen-jaehrlich-pdf/bki1-2008.pdf
23. Lee, M.-L., Hsu, W., Jensen, C.S., et al.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: VLDB (2003)
24. Loopt, http://www.loopt.com
25. Apache Lucene, http://lucene.apache.org/java/docs
26. Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: SIGMOD (2005)
27. Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: VLDB (2006)
28. Muth, P., O'Neil, P.E., Pick, A., Weikum, G.: The LHAM Log-Structured History Data Access Method. VLDB J. 8(3-4), 199-221 (2000)
29. O'Neil, P.E., Cheng, E., Gawlick, D., O'Neil, E.J.: The Log-Structured Merge-Tree (LSM-Tree). Acta Inf. 33(4) (1996)
30. Ooi, B.C., Tan, K.L., Yu, C.: Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes? In: WISE Workshops 2002 (2002)
31. Orenstein, J.A.: An Algorithm for Computing the Overlay of k-Dimensional Spaces. In: Günther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol. 525. Springer, Heidelberg (1991)
32. Orenstein, J.A., Merrett, T.H.: A Class of Data Structures for Associative Searching. In: PODS (1984)
33. Patel, J.M., Chen, Y., Chakka, V.P.: STRIPES: An Efficient Index for Predicted Trajectories. In: SIGMOD (2004)
34. Pelanis, M., Šaltenis, S., Jensen, C.S.: Indexing the Past, Present, and Anticipated Future Positions of Moving Objects. ACM TODS 31(1), 255-298 (2006)
35. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: VLDB (2000)
36. Ramsak, F., Markl, V., et al.: Integrating the UB-Tree into a Database System Kernel. In: VLDB (2000)
37. Rao, J., Ross, K.A.: Making B+-Trees Cache Conscious in Main Memory. SIGMOD 29(2) (2000)
38. Severance, D.G., Lohman, G.M.: Differential Files: Their Application to the Maintenance of Large Databases. ACM TODS 1(3), 256-267 (1976)
39. Personal communication with Skyguide Flight Control
40. Stonebraker, M., Madden, S., et al.: The End of an Architectural Era (It's Time for a Complete Rewrite). In: VLDB (2007)
41. Tao, Y., Faloutsos, C., et al.: Prediction and Indexing of Moving Objects with Unknown Motion Patterns. In: SIGMOD (2004)
42. *-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: VLDB (2003)
43. Tao, Y., Xiao, X.: Primal or dual: which promises faster spatiotemporal search? VLDB J. 17(5) (2008)
44. Tele Atlas MultiNet Europe Q4/2006. Germany
45. Thirde, D., et al.: Evaluation of Object Tracking for Aircraft Activity Surveillance. In: 2nd Joint IEEE International Workshop on VS-PETS (2005)
46. Thomas Legler, A.R., Lehner, W.: Data Mining with the SAP Netweaver BI Accelerator. In: VLDB, pp. 1059-1068 (2006)
47. Tropf, H., Herzog, H.: Multimensional Range Search in Dynamically Balanced Trees. Ang. Informatik 23(2), 71-77 (1981)
48. Šaltenis, S., Jensen, C.S., et al.: Indexing the Positions of Continuously Moving Objects. In: SIGMOD (2000)
49. White, W.M., Demers, A.J., Koch, C., Gehrke, J., Rajagopalan, R.: Scaling Games to Epic Proportion. In: SIGMOD (2007)
50. Yiu, M.L., Tao, Y., Mamoulis, N.: The Bdual-Tree: indexing moving objects by space filling curves in the dual space. VLDB J. 17(3) (2008)
51. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-Nearest Neighbor Queries over Moving Objects. In: ICDE (2005)
52. Zhou, J., Ross, K.A.: Buffering Accesses to Memory-Resident Index Structures. In: VLDB (2003)