Hi Alex, I am reading between the lines of your question; let me know if I'm misunderstanding. If you have a single query that generates a huge result set, regardless of whether it gets the results in one step or via an iterator, getting them all will be slow. But if you intend to join that query with another query, such that their intersection would be a much smaller final result set, then it could be implemented much faster than our current mechanism (which fetches the entire first result set before doing anything further). Specifically, the two query results can be joined via a linear scan, which could be really fast in C.
So it sounds like what you really want is true JOIN operators (joining across two or more queries), and that is exactly what we are starting to work on next. It would be great if you're interested in helping to define exactly what fast JOIN operators are needed first. Yours, Chris --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "pygr-dev" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/pygr-dev?hl=en -~----------~----~----~----~------~----~------~--~---
