24
edits
Places:Full Text Indexing: Difference between revisions
m
→Front-End
Mindboggler (talk | contribs) m (→References) |
Mindboggler (talk | contribs) m (→Front-End) |
||
| Line 252: | Line 252: | ||
== Front-End == | == Front-End == | ||
===nsNavQueryParser=== | |||
The function of this is to break the query given in human language into a graph of TermQuery and BooleanQuery. BooleanQuery is a struct with two operand(each a TermQuery or BooleanQuery) and an operator(AND, OR, NOT, XOR). Although the idea here is to implement all kind of queries as in: http://lucene.apache.org/java/docs/queryparsersyntax.html eventually. nsNavHistoryQuery is used to query using the query struct. The results of which is url_list which is displayed using view. | The function of this is to break the query given in human language into a graph of TermQuery and BooleanQuery. BooleanQuery is a struct with two operand(each a TermQuery or BooleanQuery) and an operator(AND, OR, NOT, XOR). Although the idea here is to implement all kind of queries as in: http://lucene.apache.org/java/docs/queryparsersyntax.html eventually. nsNavHistoryQuery is used to query using the query struct. The results of which is url_list which is displayed using view. | ||
== References == | == References == | ||
# [http://www.vldb.org/conf/1992/P353.PDF An Efficient Indexing Technique for full-text database systems] Justin Jobel, Alistair Moffet, Ron Sacks Davis | # [http://www.vldb.org/conf/1992/P353.PDF An Efficient Indexing Technique for full-text database systems] Justin Jobel, Alistair Moffet, Ron Sacks Davis | ||
# [http://www.n3labs.com/pdf/putz91using-inverted-DBMS.pdf Using a relational database for an Inverted Text index] Steve Putz, Xerox PARC | # [http://www.n3labs.com/pdf/putz91using-inverted-DBMS.pdf Using a relational database for an Inverted Text index] Steve Putz, Xerox PARC | ||