[GitHub] [cayenne] peter-hvass commented on pull request #407: Experimental graph-based db operations sorter

[GitBox <gi...@apache.org>]

peter-hvass commented on pull request #407:
URL: https://github.com/apache/cayenne/pull/407#issuecomment-722311694


   @stariy95 this is great - I'm just messing around with using this now. Am I correct in thinking this is a totally graph-based approach and the Ashwood sorter does not get involved at all? In testing so far that would appear to be the case - and this completely resolves a number of the cases of 'cyclic relations' @andrus has cited multiple times in the past as a limitation for Ashwood sorter and therefore the introduction of Weighted Ashwood as a sort of remedy.
   
   Given that this is labeled 'experimental' - are there any known issues that you might be able to prime us with?
   
   Thank you so much for your work on this - I'll continue testing for our purposes and will report any oddities as we go. :)
   
   


----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
users@infra.apache.org