Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Importer can write batches of records in parallel
This means that there may be multiple threads writing records into the stores as the final step in most stages. This doesn't mean that there will be multiple threads flushing pages to disk since flushing is separated from writing records. There have been some amount of changes to which steps does what and generally more work have been moved into steps that are naturally parallelizable already. For example property encoder step now also creates property records instead of the writer. For this purpose the IdRangeIterator moved from ha component and IdSequence got a new method nextIdBatch, which some implementations already had.
- Loading branch information
Showing
16 changed files
with
560 additions
and
205 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
49 changes: 49 additions & 0 deletions
49
community/kernel/src/main/java/org/neo4j/unsafe/impl/batchimport/HighestId.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Original file line | Diff line number | Diff line change |
---|---|---|---|
@@ -0,0 +1,49 @@ | |||
/* | |||
* Copyright (c) 2002-2017 "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.unsafe.impl.batchimport; | |||
|
|||
import java.util.concurrent.atomic.AtomicLong; | |||
|
|||
/** | |||
* Tracks a highest id when there are potentially multiple concurrent threads calling {@link #offer(long)}. | |||
*/ | |||
public class HighestId | |||
{ | |||
private final AtomicLong highestId = new AtomicLong(); | |||
|
|||
public void offer( long candidate ) | |||
{ | |||
long currentHighest; | |||
do | |||
{ | |||
currentHighest = highestId.get(); | |||
if ( candidate < currentHighest ) | |||
{ | |||
return; | |||
} | |||
} | |||
while ( !highestId.compareAndSet( currentHighest, candidate ) ); | |||
} | |||
|
|||
public long get() | |||
{ | |||
return highestId.get(); | |||
} | |||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.