On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Controlling overlap in content-oriented XML retrieval
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
An efficient and versatile query engine for TopX search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Flexible and efficient XML search with complex full-text predicates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
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
Kikori-KS: an effective and efficient keyword search system for digital libraries in XML
ICADL'06 Proceedings of the 9th international conference on Asian Digital Libraries: achievements, Challenges and Opportunities
Hi-index | 0.00 |
XML information retrieval (XML-IR) systems search for relevant document fragments in XML documents for given queries. In top-k -search, users control the size of output by an integer k. In XML-IR, however, each output element varies widely in size. Consequently, total output size of top-k elements is uncontrollable by simply giving an integer k. In addition, search results may have nesting elements. If a system orders result elements simply by their relevance, we may browse the same content more than once due to the nestings. To handle these problems, we propose a new ranking method that enables us to browse search results of XML-IR systems efficiently by introducing the concepts of benefit and reading effort. We also propose an evaluation metrics based on benefit and reading effort, and compared the metrics with existing XML-IR metrics by experiments.