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.

Sign up for GitHub

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

Jump to bottom

GraphFragment in "Worst-case optimal joins, in dataflow" #44

Open
remysucre opened this issue May 21, 2020 · 0 comments
Open

GraphFragment in "Worst-case optimal joins, in dataflow" #44

remysucre opened this issue May 21, 2020 · 0 comments

Comments

@remysucre
Copy link

The sentence explaining the graph representation is very hard to parse: "We will represent a fragment of graph by a list of destinations and offsets into this list for each vertex." Can you give some examples? How do you represent a graph with just 1 triangle?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@remysucre