Hello Raghavendra,

I am not clear on your question.  When you say "index for requirements" do you mean a index such as a range or Lucene index or do you mean a index such as the index printed at the back of a book that groups similar terms.  If it it the latter have you tried using <indexterm> elements from DocBook? http://www.docbook.org/tdg/en/html/indexterm.html

Can we infer you are building a "requirements management systems"?

When you say "NodeSet Class" what type of class are you referring to?  Is this a Java class?

Thanks - Dan

On Wed, Aug 29, 2012 at 7:40 AM, raghavendra shavi <shaviraghu@gmail.com> wrote:

I am developing an index for my requirements where group of elements form a search result unlike n-gram search or text search where single element has the text where the search result is matched and marked. So when the user searches, the result should be a sequence of grouped matching elements where each group is a single match.

Approach 1

For this i tried to create an element on the fly and add a match's elements to it forming a single match group, but am not successful because as i see all the code, any element created should belong to a persistent or in memory file.

Approach 2

Added all elements of all the matches into single NodeSet and left it to the the xquery to group it and present it to the user since xquery knows how many elements form a single match. This also fails because the NodeSet class does not allow duplicate elements. But my implementation has no duplicates within the same group which is a single match but same elements may apperár in a different group of match.

Can some please help me work this out.


Live Security Virtual Conference
Exclusive live event will cover all the ways today's security and
threat landscape has changed and how IT managers can respond. Discussions
will include endpoint security, mobile security and the latest in malware
threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/
Exist-open mailing list

Dan McCreary
NoSQL Evangelist
office: (952) 931-9198
cell: (612) 986-1552