Lists Home |
Date Index |
* Robert Koberg <firstname.lastname@example.org> [2005-08-13 06:42]:
> Alan Gutierrez wrote:
> > I'm implementing B-Tree to index XML documents. I'd like a
> > to use maximum character value as a boundry, or failing that a
> > minimum character value.
> > I'm working in Java.
> This is not what you were asking about, but have you looked at using
> Jakarta's Lucene? I use contentHandlers to index XML
> content/configurations, basically making it into an XML DB.
> The resulting index can be used for simple/complex searches in the
> normal way or you can query against it in, say, XSL transformations. For
> example you can make up schemes/URIs used in the document function to go
> against a custom URIResolver to get fast/light access to anything in a
> project or multiple merged projects.
I've built a persistant document object model and I'm working
feverishly on integration with Saxon. One of the requirements
will be a persistent, pagable B-Tree implementation for use by
Saxon and <xsl:key/>. Isn't Lucine more of a full text search
engine, not so much a general purpose B-Tree?
My current file format is one big file, and I'd like to keep it
that way, since there might be applications that want something
a user can drag and drop, however...
Lucene was going to come into play to address full text search
sooner or later, with the Lucene indicies being temporary. A
custom protocol and such like, so I'd like to get back to you
on this part.
Alan Gutierrez - email@example.com