In the not-so-distant future, flying cars are commonplace---everyone on the planet got one. Yes, there are ~10 billion flying cars all over the globe. Each one logs its coordinates every 10 milliseconds, even when parked. Assume x, y,z coordinates, with z being altitude, and x, y, some cartesian equivalent of GPS. To avoid accidents, regulation states that no car can be next to any other car by more than 10 feet while in the air (z > 0) for longer than 1 second. Cars can go really fast, ~500 mph. YOUR TASK: write an algorithm and program to find all violators. Required:
Write a Hive query (or a series of queries), or a MapReduce program to find all violators (cars that are next to other cars while in flight).