Query processing of massive trajectory data based on MapReduce

68Citations
Citations of this article
70Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the development of positioning technologies and the boosting deployment of inexpensive location-aware sensors, large volumes of trajectory data have emerged. However, efficient and scalable query processing over trajectory data remains a big challenge. We explore a new approach to this target in this paper, presenting a new framework for query processing over trajectory data based on MapReduce. Traditional trajectory data partitioning, indexing, and query processing technologies are extended so that they may fully utilize the highly parallel processing power of large-scale clusters. We also show that the append-only scheme of MapReduce storage model can be a nice base for handling updates of moving objects. Preliminary experiments show that this framework scales well in terms of the size of trajectory data set. It is also discussed the limitation of traditional trajectory data processing techniques and our future research directions. Copyright 2009 ACM.

Cite

CITATION STYLE

APA

Ma, Q., Yang, B., Qian, W., & Zhou, A. (2009). Query processing of massive trajectory data based on MapReduce. In International Conference on Information and Knowledge Management, Proceedings (pp. 9–16). https://doi.org/10.1145/1651263.1651266

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free