A simulation of part of an airline query system The project contains implementation of three different algorithms including the Floyd-Warshall-like algorithm, the optimized sequential algorithm, and the MapReduce algorithm
The Floyd-Warshall-like algorithm is implemented in com.flight.query.sequential.FloydWarshellQuery and run by com.flight.query.sequential.FWMain
The optimized sequential algorithm is implemented in com.flight.query.sequential.SequentialQuery and run by com.flight.query.sequential.SequentialMain
The MapReduce algorithm is implemented in com.flight.query.mapreduce.MRQuery
- com.flight.query.Route is a required class representing a route
- com.flight.query.Airport is a required class representing an airport
- The input dataset is input/inputV1.txt. The dataset was downloaded from https://www.transtats.bts.gov/Fields.asp?Table_ID=236
- The implementation of MapReduce algorithm requires JDK 1.8 and Hadoop 2.7.7
- The T-represent-time-span is an implementation of algorithms that assume the specified time range T is a time span, which is easier to implement but now abandoned