Given that he is already using Java, simply building a object-tree based
on the text file may be also possible. Although a 300MB file may turn
out to be fairly large in memory consumption (possibly caused by quite a
bit of object-overhead).
If that turns out to consume too much memory there are other alternative
data-structures, like a graph database (like neo4j) or some object-database.
Anyway, I wouldn't turn towards Lucene either as my first choice for
this problem.
Best regards,
Arjen
On 15-4-2014 16:04 Ivan Krišto wrote:
Hello!
To me, Lucene doesn't sound as good solution to this problem.
It seems to me that you need classic relational database. Storing tree
structure in relational DBs isn't simple thing but this presentation will
help you:
http://www.slideshare.net/billkarwin/sql-antipatterns-strike-back (slides
48-77).
Regards,
Ivan Krišto
On Tue, Apr 15, 2014 at 12:30 PM, kumagirish <kumagir...@gmail.com> wrote:
Thanks Doug
i have gone through SIREN DB Unfortunately i couldn't find enough
examples
which i could match to my requirement could you point me to any examples
involving tree structure represented in text files
regards,
Girish Durgasi
--
View this message in context:
http://lucene.472066.n3.nabble.com/Indexing-Huge-tree-structure-represented-in-a-Text-file-tp4131125p4131219.html
Sent from the Lucene - Java Users mailing list archive at Nabble.com.
---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-user-h...@lucene.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
For additional commands, e-mail: java-user-h...@lucene.apache.org
