-
Notifications
You must be signed in to change notification settings - Fork 6
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
Generate SPARQL for nodegroups with cycles #684
Comments
@glguy No real fault of yours, but the fact that the query generator is now non-deterministic sent me on a couple-days wild goose chase. It turns out the infamous LM string query arbitrarily returned in 0.5 seconds or 45 seconds depending upon which random route the query generator happened to choose. I added a sort by ID as a tie-breaker in NodeGroup.getNextHeadNode() just to make it (more?) deterministic. I'm hoping to experiment with the Jena query optimizer now, so I have it arbitrarily sorting in the direction that gives me the long-running version. |
@glguy reports that simpler cycles with MINUS are implemented. This might be a good stopping point. |
@glguy is working on a "final" set of tests |
Or more likely, this one is ambiguous. ?? |
@glguy
But will this actually work?
|
Storing these excellent examples from @galguy here in the issue: Extract correctly linked test results. Finding linked requirements from the same baseline Looking for bad cases of someone reviewing their own requirements |
No description provided.
The text was updated successfully, but these errors were encountered: