I am wondering whether it is possible to efficiently treat a subset of a given btree as its own tree. Specifically: if I have a collection of miscellaneous data, which I'll call Things, some of which are Triples, can I specifically examine all of the Triples in my collection, and from that sub-set, find those Triples whose first slot is, say, equal to 5?
Or must I do what seems to be the expected thing, and treat Things and Triples as a separate btrees if I want to efficiently search through the slots of my Triples? _______________________________________________ elephant-devel site list [EMAIL PROTECTED] http://common-lisp.net/mailman/listinfo/elephant-devel
