I have some additional questions about Titanium, as the documentation did not make these particular matters sufficiently clear:
1. Can query results take the form of a lazy sequence, one which will not result in an OOME if it's too large so long as the head is not held onto while it is consumed? E.g. (take 3 (run-query-with-ten-zillion-results)) should not blow up. 2. In particular, can indexed-key searches do so? 3. Given a backing DB that supports global queries of the whole graph, and supposing the graph was ginormous and a query returned all or most of the nodes, could *those* be lazily consumed in an OOME-avoiding manner? -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
