This is possible, but the problem here is performance. Why is it not possible to support pagination in a more efficient way? Suppose, a Searcher looks through Documents and find the matching ones. Theoretically, it can stop searching when the result hit number gets more than a threshold. Searcher may save it's state (reference to the last matched document) whithin the searcher instance, making it possible for incremental search.
What is the restriction here in Lucene indices structure, which prevents us from having this kind of search? is_maximum wrote: > > Mosen, > In order to support pagination, I wrapped the Hits is a class just like > java.sql.ResultSet > You can create a wrapper class and put the Hits in that and implement some > methods like next() prev() to forward and backward through the docuements. > > Hope this help you. > > -- > Regards, > Mohammad > -- View this message in context: http://www.nabble.com/Emulating-Pages-Search-tf3500169.html#a9776722 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]
