Package com.google.uzaygezen.core

Compact Hilbert index mappings and backtracking query building support for persistence systems.

See: Description

Interface Summary

Interface	Description
AdditiveValue<V>	Value that can be added to similar values.
BitVector	Represents a fixed-size bit set.
Content<V>
FilterCombiner<F,V,R>	Combiner of two space filling curve index ranges with attached filters.
IndexCalculator	Abstraction for space filling curve index calculators.
QueryBuilder<F,R>	Space visitor that makes the query constructed so far available at each step.
QueryFactory<F,R>	Supplier of queries.
RegionInspector<F,V>	Assessor of spatial relationships.
SpaceFillingCurve	Abstraction for the most common operations involving a space filling curve in a multi-dimensional space.
SpaceVisitor	Provides the ability to visit a multidimensional space by visiting one contiguous chunk of a space filling curve, and having the visitor itself specify if the framework should zoom into the region.
StreamingRollup<K,V extends AdditiveValue<V>>	Streaming aggregator that rolls up all the values into a tree.
TestUtils.IntArrayCallback	Callback for TestUtils.generateSpec(int, int, IntArrayCallback) and TestUtils.generateSpecWithExactSum(int, int, IntArrayCallback).
ZoomingNavigator	Provides the ability to visit a multidimensional space by starting at the root level, where no bits are set or meaningful in any of the dimensions.

Class Summary

Class	Description
Assessment<T,V>	The result of the user assessment of the spatial relationship between one spatial object and the query region.
BacktrackingQueryBuilder<F,T,V extends Content<V>,R extends Range<T,V>>	Query builder that can be configured with a maximum number of filtered index ranges.
BigIntegerContent
BigIntegerMath	Math utilities.
BitSetBackedBitVector	Adapts BitSet to the BitVector abstraction.
BitSetMath	BitSet utilities.
BitVectorMath
BoundedRollup<K,V extends AdditiveValue<V>>	Streaming rollup implementation that supports an upper bound on the number of nodes, upper bound which is achieved by rolling up nodes are required.
CompactHilbertCurve	Compact Hilbert curve implementation that uses the minimum number of bits needed to establish a bijection between the multidimensional space and the compact Hilbert index, that is, sum(i=0..n-1, m[i]).
FilteredIndexRange<F,R>	Index range with a filter that is valid for the points with a space filling index inside the range.
HilbertIndexMasks	Precomputes the masks associated to the iterations in a Hilbert index.
ListConcatCombiner<T extends Comparable<T>,V extends Content<V>,R extends Range<T,V>>	Filter combiner that works with filters consisting in a list of ranges, and concatenates them.
LongArrayBitVector	An implementation of BitVector based on an array of longs.
LongBitVector	BitVector implementation for vectors of length 64 or less.
LongContent
MapNode<K,V>	Unmodifiable tree node.
MapRegionInspector<T,V extends Content<V>>	Assessor of spatial relationships that first check the input into an internal rollup map, and keeps track of whether the current zooming level is still covered by the map or not.
MathUtils	Math utilities.
MultiDimensionalSpec	Specification of the boundaries of a (compact) multidimensional space.
NodeValue<T>	Encapsulates a value and a flag indicating if the value's node is a leaf.
PlainFilterCombiner<F,T extends Comparable<T>,V extends Content<V>,R extends Range<T,V>>	Very simple filter combiner that always uses the field PlainFilterCombiner.fixedFilter as the combined filter.
Pow2LengthBitSetRange	BitVector range with a power of 2 length, where the inclusive start has all the level lowest bits set to zero, and the lowest level bits of the inclusive end are all set to one.
Pow2LengthBitSetRangeFactory<V>	Transforms a MapNode tree into a Map which contains as keys all paths from the root node to all nodes.
Query<F,R>	Represents a computed query which can be applied, perhaps after further transformations, into an external system such as a storage server.
RangeListFilter<T extends Comparable<T>,V extends Content<V>,R extends Range<T,V>>	Associates a list of ranges with a boolean specifying if the list of ranges has exceeded the maximum limit.
SelectiveFilter<T>	Encapsulates a filter and a flag indicating if the filter could result in more points than needed being selected.
SimpleRegionInspector<F,T,V extends AdditiveValue<V>,R extends Measurable<V>>	Assessor of spatial relationships that works with a query region composed of disjoint orthotopes and assumes uniform distribution of the data points in the multidimensional space.
TestUtils
ZoomingSpaceVisitorAdapter	Adapts the user friendly SpaceVisitor to serve as a ZoomingNavigator.

Enum Summary

Enum	Description
BitSetComparator	Comparator of bit sets that establishes over all bit sets the same total order as the normal one over non-negative numbers, considering a one to one correspondence between non-negative numbers and their little-endian bit set representation.
BitVectorFactories	Commonly used bit vector factories.
SpatialRelation	The interesting spatial relationships between two regions A and B.
TestUtils.IntArrayComparator	Lexicographical comparator of int[].

Package com.google.uzaygezen.core Description

Compact Hilbert index mappings and backtracking query building support for persistence systems.

Throughout the comments we use the following terminology:

• Orthotope
• a href="http://mathworld.wolfram.com/Content.html">Content

Bibliography:

• Compact Hilbert Indices for Multi-Dimensional Data Hamilton, Chris H.; Rau-Chaplin, Andrew Complex, Intelligent and Software Intensive Systems, 2007. CISIS 2007. First International Conference on Volume , Issue , 10-12 April 2007 Page(s):139 - 146 Digital Object Identifier 10.1109/CISIS.2007.16
• Compact Hilbert indices C. Hamilton, Dalhousie University, Faculty of Computer Science, Technical Report CS-2006-07, July 2006
• J.K. Lawder, P.J.H. King SIGMOD Record, Volume 30, Issue 1 (March 2001), Pages: 19-24, ISSN:0163-5808