>You want updates that show up in the reader/searcher without latency?
>I believe LUCENE-1313 is an attempt at that.
Thanks for the info.
>What sort of operations do you use the matrix for? How large can it
>grow? Can you give an example of what the matrix might contain?
>What was the reason to solve your problem using Lucene? Is there some
>specific feature that made something easier or faster than the
>solutions you discarded?
I want to do some mathematical operation which requires matrix manipulation,
and those matrix can be of huge size even though stored as sparse so i want
an embedded system (DB or API) which allow me to store, update, delete and
retrieve cell of matrix as fast as possilble considering disk constraints.
Any suggestion?
Thanks
miztaken
karl
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
--
View this message in context:
http://www.nabble.com/How-to-handle-frequent-updates.-tp18347238p18430143.html
Sent from the Lucene - Java Users mailing list archive at Nabble.com.
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
