Best-match querying from document-centric XML
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Narrowed extended XPath i (NEXI)
INEX'04 Proceedings of the Third international conference on Initiative for the Evaluation of XML Retrieval
Controlling overlap in content-oriented XML retrieval
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Strict and vague interpretation of XML-retrieval queries
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
XTreeNet: democratic community search
Proceedings of the VLDB Endowment
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
Information Sciences: an International Journal
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Bricks: the building blocks to tackle query formulation in structured document retrieval
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
FDIA'07 Proceedings of the 1st BCS IRSG conference on Future Directions in Information Access
MAXLCA: a new query semantic model for XML keyword search
Journal of Web Engineering
| Hi-index | 0.00 |
NEXI was introduced in INEX 2004 as a query language for specifying structured and unstructured queries on XML documents. A language expressive enough for INEX yet simple enough for users to get right. These goals have been achieved. In particular, the error rate in CAS queries has dropped from 63% in 2003 to 12% in 2004. This drop is shown to be a consequence of not only the language, but the tools introduced with it: the source code for a parser was downloaded by 13 IP addresses, while a web implementation was accessed 635 times from 71 addresses. Although NEXI is suitable for the adhoc track, it is not sufficiently expressive enough for the heterogeneous track, or for question answering. The syntax necessary to extend to these purposes is proposed. This includes weighted terms and weighted paths. The new syntax is strictly an extension so does not invalidate any existing queries.