MOVIES: Indexing moving objects by shooting index images

GeoInformatica

Volumn 15, Issue 4, 2011, Pages 727-767

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

^a SAARLAND UNIVERSITY   (Germany)

^b ETH ZURICH   (Switzerland)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Differential indexing; High dimensional indexing; Indexing; Large update rates; Moving objects; Spatial indexing

Indexed keywords

EXPERIMENTAL EVALUATION; EXPONENTIAL GROWTH; GERMANY; HIGH-DIMENSIONAL INDEXING; INDEX IMAGE; INDEX STRUCTURE; INDEXING MOVING OBJECTS; LARGE UPDATE RATES; MAIN MEMORY; MASSIVE DATA SETS; MOVING OBJECT INDEXING; MOVING OBJECTS; ORDERS OF MAGNITUDE; PREDICTIVE QUERY; QUERY RESPONSE TIME; QUERY RESULTS; ROAD NETWORK; ROAD SEGMENTS; SHORT PERIODS; SPATIAL INDEXING;

MOTION PICTURES; MOTOR TRANSPORTATION; ROADS AND STREETS;

INDEXING (OF INFORMATION);

DATA PROCESSING; DATA SET; IMAGE PROCESSING; SPATIAL ANALYSIS;

GERMANY;

EID: 80052964745     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10707-011-0122-y     Document Type: Article

References (60)

1. Anderson I et al (2007) Shakra: tracking and sharing daily activity levels with unaugmented mobile phones. Mobile Netw Appl 12(2-3): 185-199.
2. Arge L (1995) The Buffer Tree: a new technique for optimal I/O-algorithms (extended abstract). In: WADS '95.
3. Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-Tree: an efficient and robust access method for points and rectangles. In: SIGMOD.
4. Biveinis L, Šaltenis S, Jensen CS (2007) Main-memory operation buffering for efficient R-Tree update. In: VLDB.
5. Brinkhoff T (2002) A framework for generating networkbased moving objects. GeoInformatica 6(2): 153-180.
6. Chen S, Gibbons PB, Mowry TC, Valentin G (2002) Fractal prefetching B+trees: optimizing both cache and disk performance. In: SIGMOD.
7. Chen S, Jensen C, Lin D (2008) A benchmark for evaluating moving object indexes. In: PVLDB.
8. Chen S, Ooi BC, Tan K-L, Nascimento M (2008) ST2B-tree: a self-tunable spatio-temporal B+-Tree index for moving objects. In: SIGMOD.
9. Chen Z, Shen HT, Zhou X, Yu JX (2009) Monitoring path nearest neighbor in road networks. In: SIGMOD.
10. Cui B, Lin D, Tan K-L (2005) Towards optimal utilization of main memory for moving object indexing. In: DASFAA.
11. Dittrich J, Blunschi L, Salles MAV (2009) Indexing moving objects using short-lived throwaway indexes. In: SSTD.
12. Dittrich J-P, Fischer PM, Kossmann D (2005) AGILE: adaptive indexing for context-aware information filters. In: SIGMOD.
13. Dittrich J-P, Seeger B (2001) GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces. In: SIGKDD.
14. Graefe G (2006) B-Tree indexes for high update rates. SIGMOD Rec 35(1): 39-44.
15. Guttman A (1984) R-Trees: a dynamic index structure for spatial searching. In: SIGMOD.
16. Hilbert D (1891) Über die stetige Abbildung einer Linie auf ein Flächenstück. Math Ann 38: 459-460.
17. Hildenbrand S (2008) Performance tradeoffs in write-optimized databases. Master's thesis, ETH Zurich.
18. Hough P (1962) Method and means for recognizing complex patterns. United States Patent No. 3069654.
19. Jagadish HV et al (1997) Incremental organization for data recording and warehousing. In: VLDB.
20. Jensen CS, Lin D, Ooi BC (2004) Query and update efficient B+-Tree based indexing of moving objects. In: VLDB.
21. Jensen CS, Pakalnis S (2007) TRAX-real-world tracking of moving objects. In: VLDB.
22. Jeung H, Liu Q, Shen HT, Zhou X (2008) A hybrid prediction model for moving objects. In: ICDE.
23. Kalashnikov DV, Prabhakar S, Hambrusch SE (2004) Main memory evaluation of monitoring queries over moving objects. Distributed and Parallel Databases 15(2): 117-135.
24. Knuth DE (1973) The art of computer programming, vol III: sorting and searching. Addison-Wesley, Reading.
25. Kollios G, Papadopoulos D, Gunopulos D, Tsotras J (2005) Indexing mobile objects using dual transformations. VLDB J 14(2): 238-256.
26. Kraftfahrt-Bundesamt (2009) Number of vehicles in Germany over time. www. kba. de/Abt3_neu/FZ/Bestand/Themen_jaehrlich_pdf/bki1_2008. pdf.
27. Lau E, Madden S (2006) An integrated approach to recovery and high availability in an updatable, distributed data warehouse. In: VLDB.
28. Lee M-L, Hsu W, Jensen CS et al (2003) Supporting frequent updates in R-Trees: a bottom-up approach. In: VLDB.
29. Lo M-L, Ravishankar CV (1998) The design and implementation of seeded trees: an efficient method for spatial joins. IEEE Trans Knowl Data Eng 10(1): 136-152.
30. Mouratidis K, Papadias D, Hadjieleftheriou M (2005) Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: SIGMOD.
31. Mouratidis K, Yiu ML, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: VLDB.
32. Muth P, O'Neil PE, Pick A, Weikum G (2000) The LHAM log-structured history data access method. VLDB J 8(3-4): 199-221.
33. O'Neil PE, Cheng E, Gawlick D, O'Neil EJ (1996) The log-structured merge-tree (LSM-Tree). Acta Inf 33(4): 351-385.
34. Ooi BC, Tan KL, Yu C (2002) Frequent update and efficient retrieval: an oxymoron on moving object indexes? In: WISE workshops '02.
35. Orenstein JA (1991) An algorithm for computing the overlay of k-dimensional spaces. In: SSD '91, vol 525.
36. Orenstein JA, Merrett TH (1984) A class of data structures for associative searching. In: PODS.
37. Patel JM, Chen Y, Chakka VP (2004) STRIPES: an efficient index for predicted trajectories. In: SIGMOD.
38. Pelanis M, Šaltenis S, Jensen CS (2006) Indexing the past, present, and anticipated future positions of moving objects. ACM Trans Database Syst 31(1): 255-298.
39. Pfoser D, Jensen CS, Theodoridis Y (2000) Novel approaches to the indexing of moving object trajectories. In: VLDB.
40. Ramsak F, Markl V et al (2000) Integrating the UB-Tree into a database system kernel. In: VLDB.
41. Rao J, Ross KA (1999) Cache conscious indexing for decision-support in main memory. In: VLDB.
42. Rao J, Ross KA (2000) Making B+-Trees cache conscious in main memory. In: SIGMOD.
43. Šaltenis S, Jensen CS et al (2000) Indexing the positions of continuously moving objects. In: SIGMOD.
44. Severance DG, Lohman GM (1976) Differential files: their application to the maintenance of large databases. ACM Trans Database Syst 1(3): 256-267.
45. Shi H, Schaeffer J (1992) Parallel sorting by regular sampling. J Parallel Distrib Comput 14(4): 361-372.
46. Stonebraker M, Madden S et al (2007) The end of an architectural era (it's time for a complete rewrite). In: VLDB.
47. Tao Y, Faloutsos C et al (2004) Prediction and indexing of moving objects with unknown motion patterns. In: SIGMOD.
48. Tao Y, Papadias D, Sun J (2003) The TPR*-Tree: an optimized spatio-temporal access method for predictive queries. In: VLDB.
49. Tao Y, Sun J, Papadias D (2003) Analysis of predictive spatio-temporal queries. ACM Trans Database Syst 28(4): 295-336.
50. Tao Y, Xiao X (2008) Primal or dual: which promises faster spatiotemporal search? VLDB J. 17(5): 1253-1270.
51. Tele Atlas MultiNet Europe Q4/2006. Germany.
52. Thirde D et al (2005) Evaluation of object tracking for aircraft activity surveillance. In: 2nd joint IEEE international workshop on VS-PETS.
53. Thomas Legler AR, Lehner W (2006) Data mining with the SAP Netweaver BI accelerator. In: VLDB, pp 1059-1068.
54. Tropf H, Herzog H (1981) Multimensional range search in dynamically balanced trees. Angew Inform 23(2): 71-77.
55. Tzoumas K, Yiu ML, Jensen C (2009) Workload-aware indexing of continuously moving objects. In: PVLDB.
56. White WM, Demers AJ, Koch C, Gehrke J, Rajagopalan R (2007) Scaling games to epic proportion. In: SIGMOD.
57. Yiu ML, Tao Y, Mamoulis N (2008) The Bdual-Tree: indexing moving objects by space filling curves in the dual space. VLDB J 17(3): 379-400.
58. Yu X, Pu KQ, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: ICDE.
59. Zhang M, Chen S, Jensen C, Ooi BC, Zhang Z (2009) Effectively indexing uncertain moving objects for predictive queries. In: PVLDB.
60. Zhou J, Ross KA (2003) Buffering accesses to memory-resident index structures. In: VLDB.