Querying XML Documents Made Easy: Nearest Concept Queries
Proceedings of the 17th International Conference on Data Engineering
The overlap problem in content-oriented XML retrieval evaluation
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Effective keyword search in relational databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Yago: a core of semantic knowledge
Proceedings of the 16th international conference on World Wide Web
Identifying meaningful return information for XML keyword search
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Query biased snippet generation in XML search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Introduction to Information Retrieval
Introduction to Information Retrieval
Field-weighted XML retrieval based on BM25
INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Narrowed extended XPath i (NEXI)
INEX'04 Proceedings of the Third international conference on Initiative for the Evaluation of XML Retrieval
| Hi-index | 0.00 |
We propose and evaluate a method for obtaining more accurate search results in extensible markup language (XML) fragment search, which is a search that produces only relevant fragments or portions of an XML document. The existing approaches generate a ranked list in descending order of each XML fragment's relevance to a search query; however, these approaches often extract irrelevant XML fragments and overlook more relevant fragments. To address these problems, our approach extracts relevant XML fragments by considering the size of the fragments and the relationships between the fragments. Next, we score the XML fragments to generate a refined ranked list. For scoring, we rank the XML fragments that are informative for user information needs as high in the list. In particular, each XML fragment is scored using the statistics of its descendant and ancestor XML fragments. Our experimental evaluations show that the proposed method outperforms BM25E, a conventional approach, which neither reconstructs XML fragments nor uses descendant and ancestor statistics.