Finding Frequent Route of Taxi Trip Events Based on MapReduce and MongoDB


KIPS Transactions on Software and Data Engineering, Vol. 4, No. 9, pp. 347-356, Sep. 2015
10.3745/KTSDE.2015.4.9.347,   PDF Download:

Abstract

Due to the rapid development of IoT(Internet of Things) technology, traditional taxis are connected through dispatchers and location systems. Typically, modern taxis have embedded with GPS(Global Positioning System), which aims for obtaining the route information. By analyzing the frequency of taxi trip events, we can find the frequent route for a given query time. However, a scalability problem would occur when we convert the raw location data of taxi trip events into the analyzed frequency information due to the volume of location data. For this problem, we propose a NoSQL based top-K query system for taxi trip events. First, we analyze raw taxi trip events and extract frequencies of all routes. Then, we store the frequency information into hash-based index structure of MongoDB which is a document-oriented NoSQL database. Efficient top-K query processing for frequent route is done with the top of the MongoDB. We validate the efficiency of our algorithms by using real taxi trip events of New York City.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
F. K. Putri, S. A. An, M. T. Purnaningtyas, "Finding Frequent Route of Taxi Trip Events Based on MapReduce and MongoDB," KIPS Transactions on Software and Data Engineering, vol. 4, no. 9, pp. 347-356, 2015. DOI: 10.3745/KTSDE.2015.4.9.347.

[ACM Style]
Fadhilah Kurnia Putri, Seong A An, and Magdalena Trie Purnaningtyas. 2015. Finding Frequent Route of Taxi Trip Events Based on MapReduce and MongoDB. KIPS Transactions on Software and Data Engineering, 4, 9, (2015), 347-356. DOI: 10.3745/KTSDE.2015.4.9.347.