Abstract
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive data sets. To meet the high update rate as well as low query response time requirements of moving object applications, this paper takes a novel approach in moving object indexing. In our approach we do not require a sophisticated index structure that needs to be adjusted for each incoming update. Rather we construct conceptually simple short-lived throwaway indexes which we only keep for a very short period of time (sub-seconds) in main memory. As a consequence, the resulting technique MOVIES supports at the same time high query rates and high update rates and trades this for query result staleness. Moreover, MOVIES is the first main memory method supporting time-parameterized predictive queries. To support this feature we present two algorithms: non-predictive MOVIES and predictive MOVIES. We obtain the surprising result that a predictive indexing approach — considered state-of-the-art in an external-memory scenario — does not scale well in a main memory environment. In fact our results show that MOVIES outperforms state-of-the-art moving object indexes like a main-memory adapted Bx-tree by orders of magnitude w.r.t. update rates and query rates. Finally, our experimental evaluation uses a workload unmatched by any previous work. We index the complete road network of Germany consisting of 40,000,000 road segments and 38,000,000 nodes. We scale our workload up to 100,000,000 moving objects, 58,000,000 updates per second and 10,000 queries per second which is unmatched by any previous work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, I., et al.: Shakra: Tracking and Sharing Daily Activity Levels with Unaugmented Mobile Phones. Mobile Networks and Applications 12(2-3) (2007)
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)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD (1990)
Biveinis, L., Šaltenis, S., Jensen, C.S.: Main-Memory Operation Buffering for Efficient R-Tree Update. In: VLDB (2007)
Brinkhoff, T.: A Framework for Generating Networkbased Moving Objects. GeoInformatica 6(2), 153–180 (2002)
Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal Prefetching B+trees: Optimizing Both Cache and Disk Performance. In: SIGMOD (2002)
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)
Dittrich, J.-P., Fischer, P.M., Kossmann, D.: AGILE: Adaptive Indexing for Context-Aware Information Flters. In: SIGMOD (2005)
Dittrich, J.-P., Seeger, B.: GESS: a Scalable Similarity-Join Algorithm for Mining Large Data Sets in High Dimensional Spaces. In: SIGKDD (2001)
Enhanced 911, http://www.fcc.gov/pshs/911
Google Web Search, http://www.google.com
Graefe, G.: B-tree indexes for high update rates. SIGMOD Rec. 35(1) (2006)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)
Hilbert, D.: Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen 38, 459–460 (1891)
Hough, P.: Method and means for recognizing complex patterns. United States Patent No. 3069654 (1962)
Jagadish, H.V., et al.: Incremental Organization for Data Recording and Warehousing. In: VLDB (1997)
Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In: VLDB (2004)
Jensen, C.S., Pakalnis, S.: TRAX - Real-World Tracking of Moving Objects. In: VLDB (2007)
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)
Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)
Kollios, G., Papadopoulos, D., Gunopulos, D., Tsotras, J.: Indexing mobile objects using dual transformations. VLDB Journal 14(2), 238–256 (2005)
Kraftfahrt-Bundesamt. Number of Vehicles in Germany over time, www.kba.de/Abt3_neu/FZ/Bestand/Themen_jaehrlich_pdf/bki1_2008.pdf
Lee, M.-L., Hsu, W., Jensen, C.S., et al.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: VLDB (2003)
Loopt, http://www.loopt.com
Apache Lucene, http://lucene.apache.org/java/docs
Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: SIGMOD (2005)
Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: VLDB (2006)
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)
O’Neil, P.E., Cheng, E., Gawlick, D., O’Neil, E.J.: The Log-Structured Merge-Tree (LSM-Tree). Acta Inf. 33(4) (1996)
Ooi, B.C., Tan, K.L., Yu, C.: Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes? In: WISE Workshops 2002 (2002)
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)
Orenstein, J.A., Merrett, T.H.: A Class of Data Structures for Associative Searching. In: PODS (1984)
Patel, J.M., Chen, Y., Chakka, V.P.: STRIPES: An Efficient Index for Predicted Trajectories. In: SIGMOD (2004)
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)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: VLDB (2000)
Ramsak, F., Markl, V., et al.: Integrating the UB-Tree into a Database System Kernel. In: VLDB (2000)
Rao, J., Ross, K.A.: Making B+-Trees Cache Conscious in Main Memory. SIGMOD 29(2) (2000)
Severance, D.G., Lohman, G.M.: Differential Files: Their Application to the Maintenance of Large Databases. ACM TODS 1(3), 256–267 (1976)
Personal communication with Skyguide Flight Control
Stonebraker, M., Madden, S., et al.: The End of an Architectural Era (It’s Time for a Complete Rewrite). In: VLDB (2007)
Tao, Y., Faloutsos, C., et al.: Prediction and Indexing of Moving Objects with Unknown Motion Patterns. In: SIGMOD (2004)
Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: VLDB (2003)
Tao, Y., Xiao, X.: Primal or dual: which promises faster spatiotemporal search? VLDB J. 17(5) (2008)
Tele Atlas MultiNet Europe Q4/2006. Germany
Thirde, D., et al.: Evaluation of Object Tracking for Aircraft Activity Surveillance. In: 2nd Joint IEEE International Workshop on VS-PETS (2005)
Thomas Legler, A.R., Lehner, W.: Data Mining with the SAP Netweaver BI Accelerator. In: VLDB, pp. 1059–1068 (2006)
Tropf, H., Herzog, H.: Multimensional Range Search in Dynamically Balanced Trees. Ang. Informatik 23(2), 71–77 (1981)
Šaltenis, S., Jensen, C.S., et al.: Indexing the Positions of Continuously Moving Objects. In: SIGMOD (2000)
White, W.M., Demers, A.J., Koch, C., Gehrke, J., Rajagopalan, R.: Scaling Games to Epic Proportion. In: SIGMOD (2007)
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)
Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-Nearest Neighbor Queries over Moving Objects. In: ICDE (2005)
Zhou, J., Ross, K.A.: Buffering Accesses to Memory-Resident Index Structures. In: VLDB (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dittrich, J., Blunschi, L., Vaz Salles, M.A. (2009). Indexing Moving Objects Using Short-Lived Throwaway Indexes. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)