-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
NodeRangeDocumentLabelScanStorageStrategy.java
153 lines (134 loc) · 5.74 KB
/
NodeRangeDocumentLabelScanStorageStrategy.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*
* Copyright (c) 2002-2016 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.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 <http://www.gnu.org/licenses/>.
*/
package org.neo4j.kernel.api.impl.labelscan.storestrategy;
import org.apache.lucene.index.IndexableField;
import org.apache.lucene.search.BooleanClause.Occur;
import org.apache.lucene.search.IndexSearcher;
import org.apache.lucene.search.TopDocs;
import java.io.IOException;
import org.neo4j.collection.primitive.Primitive;
import org.neo4j.collection.primitive.PrimitiveLongCollections;
import org.neo4j.collection.primitive.PrimitiveLongIterator;
import org.neo4j.collection.primitive.PrimitiveLongSet;
import org.neo4j.kernel.api.impl.index.LuceneAllDocumentsReader;
import org.neo4j.kernel.api.impl.labelscan.bitmaps.BitmapFormat;
import org.neo4j.kernel.api.impl.labelscan.reader.LuceneAllEntriesLabelScanReader;
import org.neo4j.kernel.api.labelscan.AllEntriesLabelScanReader;
import static org.neo4j.collection.primitive.PrimitiveLongCollections.concat;
/**
* {@link org.neo4j.kernel.api.labelscan.LabelScanStore} implemented using Lucene. There's only one big index for all
* labels
* because the Lucene document structure handles that quite efficiently.
* <p>
* With {@link BitmapFormat#_32 32bit bitmaps} it would look as follows:
* <p>
* { // document for nodes 0-31
* range: 0
* 4: [0000 0001][0000 0001][0000 0001][0000 0001] -- Node#0, Node#8, Node16, and Node#24 have Label#4
* 7: [1000 0000][1000 0000][1000 0000][1000 0000] -- Node#7, Node#15, Node#23, and Node#31 have Label#7
* 9: [0000 0001][0000 0000][0000 0000][1000 0000] -- Node#7, and Node#24 have Label#9
* }
* { // document for nodes 32-63
* range: 1
* 3: [0000 0000][0001 0000][0000 0000][0000 0000] -- Node#52 has Label#3
* }
* <p>
* i.e. each document represents a range of nodes, and in each document there is a field for each label that is present
* on any of the nodes in the range. The value of that field is a bitmap with a bit set for each node in the range that
* has that particular label.
*/
public class NodeRangeDocumentLabelScanStorageStrategy implements LabelScanStorageStrategy
{
// This must be high to avoid to many calls to the lucene searcher. Tweak using LabelScanBenchmark
private static final int RANGES_PER_PAGE = 4096;
private final BitmapDocumentFormat format;
public NodeRangeDocumentLabelScanStorageStrategy( BitmapDocumentFormat format )
{
this.format = format;
}
@Override
public String toString()
{
return String.format( "%s{%s}", getClass().getSimpleName(), format );
}
@Override
public PrimitiveLongIterator nodesWithLabel( IndexSearcher searcher, int labelId )
{
return concat( new PageOfRangesIterator( format, searcher, RANGES_PER_PAGE, format.labelQuery( labelId ),
Occur.MUST, labelId ) );
}
@Override
public PrimitiveLongIterator nodesWithAnyOfLabels( IndexSearcher searcher, int[] labelIds )
{
return concat( new PageOfRangesIterator( format, searcher, RANGES_PER_PAGE,
format.labelsQuery( Occur.SHOULD, labelIds ), Occur.SHOULD, labelIds ) );
}
@Override
public PrimitiveLongIterator nodesWithAllLabels( IndexSearcher searcher, int[] labelIds )
{
return concat( new PageOfRangesIterator( format, searcher, RANGES_PER_PAGE,
format.labelsQuery( Occur.MUST, labelIds ), Occur.MUST, labelIds ) );
}
@Override
public AllEntriesLabelScanReader newNodeLabelReader( LuceneAllDocumentsReader allDocumentsReader )
{
return new LuceneAllEntriesLabelScanReader( allDocumentsReader, format );
}
@Override
public PrimitiveLongIterator labelsForNode( IndexSearcher searcher, long nodeId )
{
try
{
TopDocs topDocs = searcher.search( format.rangeQuery( format.bitmapFormat().rangeOf( nodeId ) ), 1 );
if ( topDocs.scoreDocs.length < 1 )
{
return PrimitiveLongCollections.emptyIterator();
}
else if ( topDocs.scoreDocs.length > 1 )
{
throw new RuntimeException( "This label scan store seems to contain an incorrect number of entries (" +
topDocs.scoreDocs.length + ")" );
}
int doc = topDocs.scoreDocs[0].doc;
PrimitiveLongSet labels = Primitive.longSet();
for ( IndexableField fields : searcher.doc( doc ).getFields() )
{
if ( "range".equals( fields.name() ) )
{
continue;
}
Number numericValue = fields.numericValue();
if ( numericValue != null )
{
Long bitmap = numericValue.longValue();
if ( format.bitmapFormat().hasLabel( bitmap, nodeId ) )
{
labels.add( Long.decode( fields.name() ) );
}
}
}
return labels.iterator();
}
catch ( IOException e )
{
throw new RuntimeException( e );
}
}
}