Add limited-traversal query on a binary tree with one supernode #69
Conversation
This file contains hidden or 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
jvolmer
force-pushed
the
feature/traversal-batching
branch
from
847fd1c to
566ff5f
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This should test the performance of a traversal on a tree with a supernode where not all neighbours of the supernode are actually required in the traversal due to respective limit.
This can be used to measure the performance changes from batching traversals (https://arangodb.atlassian.net/browse/COR-7), testable on cluster with https://github.com/arangodb/arangodb/pull/22081/files and single server with arangodb/arangodb#22062.
I also refactored the already existing script for the creation of trees for better readability.