-
-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Implement multi-key slice async queries for CQL storage backend [cql-…
…tests] [tp-tests] - Adds multiQuery support to CQL storage backend. - Ensure `storage.parallel-backend-ops` thread pool is created only for storage backends which don't support multiQuery (multi-key slice operations). - Change purpose of `storage.cql.executor-service` to be used for results deserialization jobs only (not for IO operations). Fixes #2406 Fixes #3747 Fixes #3759 Related to #3170 Signed-off-by: Oleksandr Porunov <alexandr.porunov@gmail.com>
- Loading branch information
Showing
35 changed files
with
1,021 additions
and
760 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
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
90 changes: 90 additions & 0 deletions
90
janusgraph-core/src/main/java/org/janusgraph/diskstorage/util/ChunkedJobDefinition.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 | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,90 @@ | ||
| // Copyright 2023 JanusGraph Authors | ||
| // | ||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| package org.janusgraph.diskstorage.util; | ||
|
|
||
| import java.util.Queue; | ||
| import java.util.concurrent.CompletableFuture; | ||
| import java.util.concurrent.ConcurrentLinkedQueue; | ||
| import java.util.concurrent.locks.ReentrantLock; | ||
|
|
||
| /** | ||
| * | ||
| * @param <T> single chunk of data | ||
| */ | ||
| public class ChunkedJobDefinition<T, C, R> { | ||
|
|
||
| /** | ||
| * Dynamic holder for data chunks to process. | ||
| */ | ||
| private final Queue<T> dataChunks = new ConcurrentLinkedQueue<>(); | ||
|
|
||
| /** | ||
| * If `false` no more data chunks are expected to be added. Thus, the processing thread is open to finish processing and return. | ||
| */ | ||
| private volatile boolean lastChunkRetrieved; | ||
|
|
||
| /** | ||
| * Lock to be acquired by the processing thread to indicate to other potential threads which want to process the same | ||
| * chunks of data that there is already a thread working on processing. | ||
| * Notice that some threads will process only some chunks of data (older chunks) and may leave some unprocessed chunks. | ||
| * Thus, each thread which brings a new chunk of data must check at the end that there is already some thread working on | ||
| * processing the data. In case no threads working on processing the data - the thread which added a chunk of data to `dataChunks` | ||
| * must acquire the lock and process all chunks which are left for processing. | ||
| */ | ||
| private final ReentrantLock processingLock = new ReentrantLock(); | ||
|
|
||
| /** | ||
| * Optional context information which can be used to resume processing for the next chunk of data. | ||
| */ | ||
| private volatile C processedDataContext; | ||
|
|
||
| /** | ||
| * Final computed result | ||
| */ | ||
| private final CompletableFuture<R> result = new CompletableFuture<>(); | ||
|
|
||
| public Queue<T> getDataChunks() { | ||
| return dataChunks; | ||
| } | ||
|
|
||
| public boolean isLastChunkRetrieved() { | ||
| return lastChunkRetrieved; | ||
| } | ||
|
|
||
| public void setLastChunkRetrieved() { | ||
| this.lastChunkRetrieved = true; | ||
| } | ||
|
|
||
| public ReentrantLock getProcessingLock() { | ||
| return processingLock; | ||
| } | ||
|
|
||
| public C getProcessedDataContext() { | ||
| return processedDataContext; | ||
| } | ||
|
|
||
| public void setProcessedDataContext(C processedDataContext) { | ||
| this.processedDataContext = processedDataContext; | ||
| } | ||
|
|
||
| public void complete(R resultData){ | ||
| this.result.complete(resultData); | ||
| } | ||
|
|
||
| public CompletableFuture<R> getResult() { | ||
| return result; | ||
| } | ||
|
|
||
| } |
Oops, something went wrong.