Query processing of massive trajectory data based on MapReduce

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 9-16

  Ma, Qiang ^a   Yang, Bin ^a   Qian, Weining ^b   Zhou, Aoying ^b  

^a FUDAN UNIVERSITY   (China)

^b EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

Indexing; Location based services; MapReduce; Moving objects; Spatio temporal queries

Indexed keywords

FUTURE RESEARCH DIRECTIONS; LARGE-SCALE CLUSTERS; LOCATION-AWARE SENSORS; LOCATION-BASED SERVICES; MOVING OBJECTS; NEW APPROACHES; PARALLEL PROCESSING; POSITIONING TECHNOLOGIES; SCALABLE QUERY PROCESSING; SPATIOTEMPORAL QUERIES; STORAGE MODEL; TRAJECTORY DATA;

INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); INDUSTRIAL RESEARCH; KNOWLEDGE MANAGEMENT; QUERY PROCESSING; TRAJECTORIES;

DATA PROCESSING;

EID: 74049156374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1651263.1651266     Document Type: Conference Paper

References (18)

1. Apache. Hadoop. http://hadoop.apache.org/core/.
2. T. Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6(2):153-180, 2002.
3. V. P. Chakka, A. Everspaugh, and J. M. Patel. Indexing large trajectory data sets with seti. In CIDR, 2003.
4. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. Gruber. Bigtable: A distributed storage system for structured data (awarded best paper!). In OSDI, pages 205-218, 2006.
5. H. chih Yang, A. Dasdan, R.-L. Hsiao, and D. S. P. Jr. Map-reduce-merge: simplified relational data processing on large clusters. In SIGMOD Conference, pages 1029-1040, 2007.
6. F. Dabek, M. F. Kaashoek, D. R. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with cfs. In SOSP, pages 202-215, 2001.
7. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
8. S. Ghemawat, H. Gobioff and S.-T. Leung. The google file system. In SOSP, pages 29-43, 2003.
9. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD Conference, pages 47-57, 1984.
10. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In EuroSys, pages 59-72, 2007.
11. D. V. Kalashnikov, S. Prabhakar, and S. E. Hambrusch. Main memory evaluation of monitoring queries over moving objects. Distributed and Parallel Databases, 15(2):117-135, 2004.
12. M. A. Nascimento and J. R. O. Silva. Towards historical r-trees. In SAC, pages 235-240, 1998.
13. C. Olston, B. Reed, U. Srivastava, R. Kumar, and A. Tomkins. Pig latin: a not-so-foreign language for data processing. In SIGMOD Conference, pages 1099-1110, 2008.
14. B. C. Ooi, B. Yu, and G. Li. One table stores all: Enabling painless free-and-easy data publishing and sharing. In CIDR, pages 142-153, 2007.
15. D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In VLDB, pages 395-406, 2000.
16. Y. Tao and D. Papadias. Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, pages 431-440, 2001.
17. Y. Theodoridis, M. Vazirgiannis, and T. K. Sellis. Spatio-temporal indexing for large multimedia applications. In ICMCS, pages 441-448, 1996.
18. B. Yang, Q. Ma, W. Qian, and A. Zhou. Truster: Trajectory data processing on clusters. In DASFAA, pages 768-771, 2009.