RLR> implementing a new kind of btree that supports duplicates (hard).
ain't btree with duplicates very similar to btree-index thing, because
btree-index also supports duplicates?
RLR> Since Postmodern uses the same kind of cursor control that the CL-SQL
RLR> backend does,
why do you think so? cursor are probably biggest difference between CL-SQL
and postmodern -- instead of reading everything and sorting on lisp side, we
use sorting done by postgresql, and pick stuff in portions, i.e. cursor-next
is something like:
SELECT k, v FROM btree11 WHERE ((k = $1) and (v > $2)) OR (k > $1) LIMIT 10
_______________________________________________
elephant-devel site list
elephant-devel@common-lisp.net
http://common-lisp.net/mailman/listinfo/elephant-devel
