Finding Frequent Route of Taxi Trip Events Based on MapReduce and MongoDB
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (16)
- "2014 Taxicab Fact Book" (2014)[URL]
- N. Ferreira, "Visual exploration of big spatio-temporal urban data : A study of new york city taxi trips", Visualization and Computer Graphics, IEEE Transactions on, 19(12), pp.2149~2158 (2013)
- Z. Gui, "Locating traffic hot routes from massive taxi tracks in clusters", ~ (2014)
- D. Zhang, "Dmodel:Online taxicab demand model from big sensor data in a roving sensor network", Big Data (BigData Congress), 2014IEEE International Congress on, pp.152~159 (2014), IEEE
- G. Pan, "Land-use classification using taxi gps traces", Intelligent Transportation Systems, IEEE (2013)
- J. Lee, "Analysis of the passenger pick-up pattern for taxi location recommendation", Networked Computing and Advanced Information Management, 2008. NCM’08. Fourth International Conference on, 1, pp.199~204 (2008), IEEE
- Y. Wang, "A solution of traffic problems based on mapreduce", Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012, pp.749~757 (2012), Springer
- "NoSQL" (2015)[URL]
- Z. Wei-ping, "Using MongoDB to implement textbook management system instead of MySQL", Communication Software and Networks (ICCSN), 2011. IEEE 3rd International Conference on, pp.303~305 (2011), IEEE
- "ORACLE, MySQL" (2015)[URL]
- "MongoDB" (2015)[URL]
- E. Dede, "Performance evaluation of a mongodb and hadoop platform for scientific data analysis", Proceedings of the 4th ACM workshop on Scientific cloud computing, pp.13~20 (2013), ACM
- J. Dean, "Mapreduce : simplified data processing on large clusters", Communications of ACM, 51(1), pp.107~113 (2008)
- "FOILing NYC’s Taxi Trip Data" (2014)[URL]
- "DEBS2015, grid cell in New York City" (2015)[URL]
- "Rush Hour" (2015)[URL]