PARINET: A tunable access method for in-network trajectories

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 177-188

  Popa, Iulian Sandu ^a   Zeitouni, Karine ^a   Oria, Vincent ^b   Barth, Dominique ^a   Vial, Sandrine ^a  

^a UNIVERSITY OF VERSAILLES   (France)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS METHODS; COMMERCIAL APPLICATIONS; DATA DISTRIBUTION; EXPERIMENTAL EVALUATION; GRAPH PARTITIONING; HISTORICAL DATA; IN-NETWORK; INDEXING TECHNIQUES; OPTIMAL CONFIGURATIONS; TIME COMPONENTS; TRAJECTORY DATA; TRAJECTORY DATABASE; TREE-BASED;

DECISION TREES; GRAPH THEORY;

TRAJECTORIES;

EID: 77952781222     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447885     Document Type: Conference Paper

References (18)

1. V. T. de Almeida and R. Guting, "Indexing the Trajectories of Moving Objects in Networks," GeoInformatica, 9(1): 30-60, 2005.
2. V. Botea, D. Mallett, M. A. Nascimento and J. Sander, "PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data," GeoInformatica, 12(2): 143-168 (2008)
3. T. Brinkhoff, "A framework for generating network-based moving objects," GeoInformatica, 6(2): 153-180, 2002.
4. S. Chen, B. C. Ooi, K. L. Tan and M. A. Nascimento, "The ST2B-tree: A Self-Tunable Spatio-Temporal B+-tree Index for Moving Objects," Proc. ACM SIGMOD, pp. 29-42, 2008.
5. E. Frentzos, "Indexing objects moving on fixed networks," in Proc. SSTD, 289-305, 2003.
6. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1979.
7. R.H. Güting, V.T. de Almeida and Z. Ding, "Modeling and Querying Moving Objects in Networks," VLDB Journal 15:2 (2006), 165-190. (Pubitemid 43938937)
8. M. Hadjieleftheriou, G. Kollios, J. Tsotras, and D. Gunopulos, "Indexing spatiotemporal archives," VLDB Journal 15(2): 143-164 (2006)
9. C. S. Jensen, H. Lahrmann, S. Pakalnis and J. Runge, "The INFATI Data," Aalborg University, TimeCenter TR-79. www.cs.aau.dk/TimeCenter (2008)
10. G. Karypis and V. Kumar, "A Fast and Highly Quality Multilevel Scheme for Partitioning Irregular Graphs," SIAM Journal on Scientific Computing, Vol. 20, No. 1, pp. 359-392, 1999.
11. H.-P. Kriegel, M. Pötke and T. Seidl, "Managing Intervals Efficiently in Object-Relational Databases," in Proc. 26th Int.Conf. on Very Large Databases (VLDB), 2000.
12. METIS - Family of Multilevel Partitioning Algorithms. [Online]. Available: http://glaros.dtc.umn.edu/gkhome/views/metis
13. J.M. Patel, A. Arbor, Y. Chen and V. P. Chakka, "STRIPES: an efficient index for predicted trajectories," in Proceedings of the 23rd ACM SIGMOD International Conference on Management of Data. (2004) 635-646
14. M. Pelanis, S. Saltenis and C. S. Jensen, "Indexing the past, present, and anticipated future positions of moving objects," ACM Trans. Database Syst. 31(1): 255-298 (2006)
15. D. Pfoser and C. S. Jensen, "Indexing of Network-Constrained Moving Objects," in Proc. ACM-GIS, 25-32, 2003.
16. L. Speicys, and C. S. Jensen, "Enabling Location-based Services - Multi-Graph Representation of Transportation Networks," GeoInformatica 12(2): 219-253, 2008.
17. Y. Tao and D. Papadias, "MV3R-Tree: A spatio-temporal access method for timestamp and interval queries," in Proceedings of the International Conference on Very Large Data Bases, pp. 431-440 (2001)
18. Y. Tao, D. Papadias and J. Sun, "The TPR*-tree: an optimized spatio-temporal access method for predictive queries," in Proceedings of the 30th International Conference on Very Large Data Bases. (2003) 790-880