feat: Compute edges from tags rather than storing #500
Conversation
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
In dense graphs, there may be `O(node^2)` edges for tags with high connectivity. Storing the tags alone (`O(tags)`) allows for faster writes. We can further address dense graphs by using queries with similarity bounds and filters. Other changes: - refactor: Introduce `Link` as interface for `LinkTag` This allows non-tag based links to be added in the future. - refactor: remove unused code Future improvements - Further performance tuning of queries, including denormalization to allow for fewer queries during traversal. - Consider / experiment with single key queries rather than `IN`.
|
Check out this pull request on See visual diffs & provide feedback on Jupyter Notebooks. Powered by ReviewNB |
cbornet
reviewed
Jun 18, 2024
cbornet
reviewed
Jun 18, 2024
cbornet
reviewed
Jun 18, 2024
cbornet
reviewed
Jun 18, 2024
cbornet
reviewed
Jun 18, 2024
cbornet
reviewed
Jun 18, 2024
cbornet
reviewed
Jun 18, 2024
kerinin
reviewed
Jun 18, 2024
libs/langchain/ragstack_langchain/graph_store/extractors/html_link_edge_extractor.py
Outdated
Show resolved
Hide resolved
cbornet
reviewed
Jun 19, 2024
cbornet
reviewed
Jun 20, 2024
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.
In dense graphs, there may be
O(node^2)edges for tags with high connectivity. Storing the tags alone (O(tags)) allows for faster writes. We can further address dense graphs by using queries with similarity bounds and filters.Other changes:
Linkas interface forLinkTagThis allows non-tag based links to be added in the future.ragstack_langchainimportsFuture improvements
IN.