Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

🤯 Cognitarium: BGP optimization #309

Open
amimart opened this issue Aug 7, 2023 · 0 comments
Open

🤯 Cognitarium: BGP optimization #309

amimart opened this issue Aug 7, 2023 · 0 comments
Assignees

Comments

@amimart
Copy link
Member

amimart commented Aug 7, 2023

Purpose

When using the PlanBuilder to establish a query plan from a query based on triple patterns, the triple patterns are considered as a Basic Graph Pattern. The current implementation build it in the order the triple patterns are provided but it is not optimal.

Proposal

Before building the Basic Graph Pattern relating to a set of triple patterns, an optimization step could be added to order the patterns based on a computation indice expressing the complexity needed to resolve them. The built BGP would then be optimal, and users won't need to make their own optimization before querying anymore, this we'll also help to decrease resource usages on nodes.

@amimart amimart self-assigned this Aug 7, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
Status: 📋 Backlog
Development

No branches or pull requests

1 participant