Hi, We are using Lucene 2.0 to index data stored inside relational database. Like any relational database, our database has quite a few one-to-one and one-to-many relationships. For example, lets say an Object A has one-to-many relationship with Object X and Object Y. As we need to de-normalize relational data as key-value pairs before storing it inside Lucene index, we have de-normalized these relationships (Object X and Object Y) while building an index on Object A.
We have large no of such object relationships and most of the times, the related objects are modified more frequently than the base objects. For example, in our above case, objects X and Y are updated in the system very frequently, whereas Object A is not updated that often. Still, we will need to update Object A entries inside the index, every time its related objects X and/or Y are modified. To avoid the above situation, we were thinking of having 2 separate indexes first index will only index data of base objects (Object A in above example) and second index will contain data about its relationship objects (Object X and Y above), which are updated more frequently. This way, the more frequent updates to Object X and Y will only impact second index that stores relationship information and reduce the cost to re-index object A. However, I dont think, MultiSearcher will be helpful if we want to search for data which spans across both indexes (e.g. some fields of Object A in first index and some fields of Object X or Y in second index). Do we have any option in Lucene to handle such scenario? Can we search across multiple indexes which have some relationships between them and search for fields that span across these indexes? Regards, Rajesh __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
