| Class | Description |
|---|---|
| Aggregate |
Computes the minimum and maximum values for a set of input HDF files.
|
| Aggregate.Map | |
| Aggregate.MinMax |
A structure to hold the minimum and maximum values for aggregation.
|
| Aggregate.Reduce | |
| CatUnion |
Computes the union of a set of shapes given a category for each shape.
|
| ClosestPair | |
| ClosestPair.Map | |
| ClosestPair.Reduce | |
| ClosestPairHadoop | |
| ClosestPairHadoop.Map0 | |
| ClosestPairHadoop.Map1 | |
| ClosestPairHadoop.Reduce0 | |
| ClosestPairHadoop.Reduce1 | |
| ConvexHull |
Computes the convex hull for a set of shapes
|
| ConvexHull.ConvexHullFilter |
Filters partitions to remove ones that do not contribute to answer.
|
| ConvexHull.ConvexHullReducer | |
| ConvexHull.IdentityMapper |
An identity map function that returns values as-is with a null key.
|
| DistributedCopy |
Copy file using a distributed MapReduce job.
|
| DistributedCopy.BlockInputFormat |
An input format that returns blocks of binary data as values.
|
| DistributedCopy.BlockOutputCommitter |
Concatenates output files to generate an exact copy of the input dir.
|
| DistributedCopy.BlockOutputFormat | |
| DistributedCopy.BlockRecordReader |
Reads blocks of binary arrays from input file.
|
| DistributedCopy.FileBlockIndex |
Holds information about a block in a file with a specific index.
|
| DistributedCopy.FileBlockSplit |
An extended version of FileSplit that also stores the position of the
block in the file.
|
| DistributedJoin |
Performs a spatial join between two or more files using the redistribute-join
algorithm.
|
| DistributedJoin.DJInputFormatArray |
Input format that returns a record reader that reads a pair of arrays of
shapes
|
| DistributedJoin.DJInputFormatArray.DJRecordReader |
Reads a pair of arrays of shapes
|
| DistributedJoin.DJInputFormatRTree<S extends Shape> |
Input format that returns a record reader that reads a pair of arrays of
shapes
|
| DistributedJoin.DJInputFormatRTree.DJRecordReader<S extends Shape> |
Reads a pair of arrays of shapes
|
| DistributedJoin.RedistributeJoinMap | |
| DistributedJoin.RedistributeJoinMapNoDupAvoidance | |
| DistributedJoin.RepartitionJoinReduce<T extends Shape> | |
| DistributedJoin.SpatialJoinFilter | |
| FarthestPair |
Computes the farthest pair for a set of points
|
| FarthestPair.FarthestPairFilter | |
| FarthestPair.FarthestPairMap | |
| FarthestPair.FarthestPairReducer | |
| FarthestPair.FPInputFormatArray |
Input format that returns a record reader that reads a pair of arrays of
shapes
|
| FarthestPair.FPInputFormatArray.FPRecordReader |
Reads a pair of arrays of shapes
|
| FarthestPair.PairDistance | |
| FileMBR |
Finds the minimal bounding rectangle for a file.
|
| FileMBR.Combine | |
| FileMBR.FileMBRMapper | |
| FileMBR.MBROutputCommitter |
This output committer caches the MBR calculated for the input file such
that subsequent calls to FileMBR will return the answer right away.
|
| FileMBR.Reduce | |
| GeometricPlot | |
| GeometricPlot.GeometricRasterizer | |
| HeatMapPlot | |
| HeatMapPlot.HeatMapRasterizer | |
| KNN |
Performs k Nearest Neighbor (kNN) query over a spatial file.
|
| KNN.KNNMap<S extends Shape> |
Mapper for KNN MapReduce.
|
| KNN.KNNObjects |
Keeps KNN objects ordered by their distance descending
|
| KNN.KNNReduce<S extends Shape> |
Reduce (and combine) class for KNN MapReduce.
|
| KNN.Map1<S extends Shape> | |
| KNN.Map2<S extends Shape> | |
| KNN.TextWithDistance | |
| Main |
The main entry point to all queries.
|
| RangeQuery |
Performs a range query over a spatial file.
|
| RangeQuery.RangeFilter |
A filter function that selects partitions overlapping with a query range.
|
| RangeQuery.RangeQueryMap |
The map function used for range query
|
| RangeQuery.RangeQueryMapNoDupAvoidance |
The map function used for range query
|
| RecordCount |
Calculates number of records in a file depending on its type.
|
| RecordCount.Map | |
| RecordCount.Reduce | |
| Repartition |
Creates an index on an input file
|
| Repartition.RepartitionMap<T extends Shape> |
The map class maps each object to every cell it overlaps with.
|
| Repartition.RepartitionMapNoReplication<T extends Shape> |
The map class maps each object to the cell with maximum overlap.
|
| Repartition.RepartitionOutputCommitter | |
| Repartition.RepartitionReduce<T extends Shape> | |
| Sampler |
Reads a random sample of a file.
|
| Sampler.Map | |
| Sampler.Reduce |
The job of the reduce function is to change the key from NullWritableRnd
to NullWritable.
|
| Shuffle |
Shuffle the lines in an input text file.
|
| Shuffle.Map | |
| Shuffle.Reduce | |
| SJMR |
An implementation of Spatial Join MapReduce as described in
S.
|
| SJMR.IndexedText | |
| SJMR.SelfSJMRMap |
Map function for the self join version of SJMR.
|
| SJMR.SelfSJMRReduce<S extends Shape> | |
| SJMR.SJMRMap |
The map class maps each object to all cells it overlaps with.
|
| SJMR.SJMRReduce<S extends Shape> | |
| Skyline |
Computes the skyline of a set of points
|
| Skyline.IdentityMapper |
An identity map function that returns values as-is with a null key.
|
| Skyline.SkylineFilter | |
| Skyline.SkylineReducer | |
| Tail |
Reads the last n lines of a text file
|
| UltimateUnion |
Computes the union of a set of shapes using a distributed MapReduce program.
|
| Union |
Computes the union of all shapes in a given input file.
|