org.neo4j.kernel.impl.index.schema.PointIndexReader Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of neo4j-kernel Show documentation
Show all versions of neo4j-kernel Show documentation
Neo4j kernel is a lightweight, embedded Java database designed to
store data structured as graphs rather than tables. For more
information, see http://neo4j.org.
/*
* Copyright (c) "Neo4j"
* Neo4j Sweden AB [http://neo4j.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see
{
private final IndexSpecificSpaceFillingCurveSettings spaceFillingCurveSettings;
private final SpaceFillingCurveConfiguration configuration;
PointIndexReader( GBPTree tree, IndexLayout layout, IndexDescriptor descriptor,
IndexSpecificSpaceFillingCurveSettings spaceFillingCurveSettings, SpaceFillingCurveConfiguration configuration )
{
super( tree, layout, descriptor );
this.spaceFillingCurveSettings = spaceFillingCurveSettings;
this.configuration = configuration;
}
@Override
void validateQuery( IndexQueryConstraints constraints, PropertyIndexQuery[] predicates )
{
if ( predicates.length > 1 )
{
throw new IllegalArgumentException( format( "Tried to query a point index with a composite query. " +
"Composite queries are not supported by a point index. Query was: %s ", Arrays.toString( predicates ) ) );
}
if ( constraints.order() != IndexOrder.NONE )
{
throw new IllegalArgumentException( "Tried to query a point index with order. Order is not supported by a point index." );
}
validateSupportedPredicates( predicates[0] );
}
private void validateSupportedPredicates( PropertyIndexQuery predicate )
{
if ( EnumSet.of( IndexQueryType.ALL_ENTRIES, IndexQueryType.EXACT ).contains( predicate.type() )
|| (predicate.type() == IndexQueryType.RANGE && predicate.valueGroup() == ValueGroup.GEOMETRY) )
{
return;
}
throw new IllegalArgumentException( format(
"Tried to query index with illegal query. Only %s, %s, and %s %s queries are supported by a point index. Query was: %s",
IndexQueryType.ALL_ENTRIES, IndexQueryType.EXACT, ValueGroup.GEOMETRY, IndexQueryType.RANGE, predicate ) );
}
@Override
public void query( IndexProgressor.EntityValueClient client, QueryContext context, AccessMode accessMode,
IndexQueryConstraints constraints, PropertyIndexQuery... predicates )
{
if ( predicates.length == 0 )
{
return;
}
PropertyIndexQuery predicate = predicates[0];
if ( predicate.type() == IndexQueryType.RANGE )
{
context.monitor().queried( descriptor );
validateQuery( constraints, predicates );
PropertyIndexQuery.GeometryRangePredicate geometryRangePredicate = (PropertyIndexQuery.GeometryRangePredicate) predicate;
try
{
// With GeometryRangeQuery predicate this query changes from a straight-forward: build from/to and seek...
// into a query that is split into multiple sub-queries.
BridgingIndexProgressor multiProgressor = new BridgingIndexProgressor( client, descriptor.schema().getPropertyIds() );
client.initialize( descriptor, multiProgressor, accessMode, false, constraints, geometryRangePredicate );
double[] from = geometryRangePredicate.from() == null ? null : geometryRangePredicate.from().coordinate();
double[] to = geometryRangePredicate.to() == null ? null : geometryRangePredicate.to().coordinate();
CoordinateReferenceSystem crs = geometryRangePredicate.crs();
SpaceFillingCurve curve = spaceFillingCurveSettings.forCrs( crs );
List ranges = curve.getTilesIntersectingEnvelope( from, to, configuration );
for ( SpaceFillingCurve.LongRange range : ranges )
{
// Here's a sub-query that we'll have to do for this geometry range.
PointKey treeKeyFrom = layout.newKey();
PointKey treeKeyTo = layout.newKey();
initializeFromToKeys( treeKeyFrom, treeKeyTo );
// We can not take query inclusion / exclusion into consideration here because then we risk missing border values. Always use
// Inclusion.LOW / HIGH respectively and filter out points later on.
treeKeyFrom.writePointDerived( crs, range.min, LOW );
treeKeyTo.writePointDerived( crs, range.max + 1, HIGH );
startSeekForInitializedRange( multiProgressor, treeKeyFrom, treeKeyTo, context.cursorContext(), accessMode,
true, constraints, geometryRangePredicate );
}
}
catch ( IllegalArgumentException e )
{
// Invalid query ranges will cause this state (eg. min>max)
client.initialize( descriptor, IndexProgressor.EMPTY, accessMode, false, constraints, geometryRangePredicate );
}
}
else
{
super.query( client, context, accessMode, constraints, predicates );
}
}
@Override
boolean initializeRangeForQuery( PointKey treeKeyFrom, PointKey treeKeyTo, PropertyIndexQuery[] predicates )
{
// if we are here, we made it past the validation, and we know there is only one predicate, and it is either allEntries, or an exact match
PropertyIndexQuery predicate = predicates[0];
switch ( predicate.type() )
{
case ALL_ENTRIES:
treeKeyFrom.initValueAsLowest( -1, ValueGroup.GEOMETRY );
treeKeyTo.initValueAsHighest( -1, ValueGroup.GEOMETRY );
return false;
case EXACT:
PropertyIndexQuery.ExactPredicate exactPredicate = (PropertyIndexQuery.ExactPredicate) predicate;
treeKeyFrom.initFromValue( -1, exactPredicate.value(), NEUTRAL );
treeKeyTo.initFromValue( -1, exactPredicate.value(), NEUTRAL );
return false;
default:
// just in case, throw
validateSupportedPredicates( predicate );
}
return false;
}
}