-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
PartitionedLuceneLabelScanWriter.java
234 lines (207 loc) · 7.51 KB
/
PartitionedLuceneLabelScanWriter.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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
/*
* 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.index;
import org.apache.lucene.document.Document;
import org.apache.lucene.index.IndexableField;
import org.apache.lucene.index.Term;
import org.apache.lucene.search.IndexSearcher;
import org.apache.lucene.search.SearcherManager;
import org.apache.lucene.search.TermQuery;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.concurrent.locks.Lock;
import org.neo4j.kernel.api.impl.index.bitmaps.Bitmap;
import org.neo4j.kernel.api.impl.index.partition.IndexPartition;
import org.neo4j.kernel.api.impl.index.partition.PartitionSearcher;
import org.neo4j.kernel.api.labelscan.LabelScanWriter;
import org.neo4j.kernel.api.labelscan.NodeLabelUpdate;
import static java.lang.String.format;
public class PartitionedLuceneLabelScanWriter implements LabelScanWriter
{
// TODO: Integer.MAX_VALUE usually used as sentinel marker in lucene, test can we use it as max partition size ?
private final Integer MAXIMUM_PARTITION_SIZE =
Integer.getInteger( "labelScanStore.maxPartitionSize", Integer.MAX_VALUE );
private final BitmapDocumentFormat format;
private final List<NodeLabelUpdate> updates;
private long currentRange;
private final Lock heldLock;
private LuceneLabelScanIndex index;
public PartitionedLuceneLabelScanWriter( LuceneLabelScanIndex index, BitmapDocumentFormat format, Lock heldLock )
{
this.index = index;
this.format = format;
this.heldLock = heldLock;
currentRange = -1;
updates = new ArrayList<>( format.bitmapFormat().rangeSize() );
}
@Override
public void write( NodeLabelUpdate update ) throws IOException
{
long range = format.bitmapFormat().rangeOf( update.getNodeId() );
if ( range != currentRange )
{
if ( range < currentRange )
{
throw new IllegalArgumentException( format( "NodeLabelUpdates must be supplied in order of " +
"ascending node id. Current range:%d, node id of this " +
"update:%d",
currentRange, update.getNodeId() ) );
}
flush();
currentRange = range;
}
updates.add( update );
}
@Override
public void close() throws IOException
{
try
{
flush();
}
finally
{
try
{
index.maybeRefreshBlocking();
}
finally
{
heldLock.unlock();
}
}
}
private Map<Long/*range*/,Bitmap> readLabelBitMapsInRange( IndexSearcher searcher, long range ) throws IOException
{
Map<Long/*label*/,Bitmap> fields = new HashMap<>();
Term documentTerm = format.rangeTerm( range );
TermQuery query = new TermQuery( documentTerm );
FirstHitCollector hitCollector = new FirstHitCollector();
searcher.search( query, hitCollector );
if ( hitCollector.hasMatched() )
{
Document document = searcher.doc( hitCollector.getMatchedDoc() );
for ( IndexableField field : document.getFields() )
{
if ( !format.isRangeOrLabelField( field ) )
{
Long label = Long.valueOf( field.name() );
fields.put( label, format.readBitmap( field ) );
}
}
}
return fields;
}
private void flush() throws IOException
{
if ( currentRange < 0 )
{
return;
}
IndexPartition partition = getCurrentPartition();
try ( PartitionSearcher partitionSearcher = partition.acquireSearcher() )
{
IndexSearcher searcher = partitionSearcher.getIndexSearcher();
Map<Long/*label*/,Bitmap> fields = readLabelBitMapsInRange( searcher, currentRange );
updateFields( updates, fields );
Document document = new Document();
format.addRangeValuesField( document, currentRange );
for ( Map.Entry<Long/*label*/,Bitmap> field : fields.entrySet() )
{
// one field per label
Bitmap value = field.getValue();
if ( value.hasContent() )
{
format.addLabelAndSearchFields( document, field.getKey(), value );
}
}
if ( isEmpty( document ) )
{
partition.getIndexWriter().deleteDocuments( format.rangeTerm( document ) );
}
else
{
partition.getIndexWriter().updateDocument( format.rangeTerm( document ), document );
}
updates.clear();
}
}
// since only one writer is allowed at any point in time
// its safe to do partition allocation without any additional lock
private IndexPartition getCurrentPartition() throws IOException
{
int partition = getPartitionForRange();
while ( isNotEnoughPartitions( partition ) )
{
index.addNewPartition();
}
return index.getPartitions().get( partition );
}
private boolean isNotEnoughPartitions( int partition )
{
return index.getPartitions().size() < (partition + 1);
}
private int getPartitionForRange()
{
return Math.toIntExact( currentRange / MAXIMUM_PARTITION_SIZE );
}
private boolean isEmpty( Document document )
{
for ( IndexableField fieldable : document.getFields() )
{
if ( !format.isRangeOrLabelField( fieldable ) )
{
return false;
}
}
return true;
}
private void updateFields( Iterable<NodeLabelUpdate> updates, Map<Long/*label*/,Bitmap> fields )
{
for ( NodeLabelUpdate update : updates )
{
clearLabels( fields, update );
setLabels( fields, update );
}
}
private void clearLabels( Map<Long,Bitmap> fields, NodeLabelUpdate update )
{
for ( Bitmap bitmap : fields.values() )
{
format.bitmapFormat().set( bitmap, update.getNodeId(), false );
}
}
private void setLabels( Map<Long,Bitmap> fields, NodeLabelUpdate update )
{
for ( long label : update.getLabelsAfter() )
{
Bitmap bitmap = fields.get( label );
if ( bitmap == null )
{
fields.put( label, bitmap = new Bitmap() );
}
format.bitmapFormat().set( bitmap, update.getNodeId(), true );
}
}
}