A Ranking Scheme for XML Information Retrieval Based on Benefit and Reading Effort

Toshiyuki Shimizu and Masatoshi Yoshikawa

Abstract. 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.

LNCS 4822, p. 230 ff.

Full article in PDF | BibTeX

lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2007