Abstract

Abstract: In this paper, we propose a query-oriented fragment search approach for efficient and effective XML search engines on relational database systems. Conventional approaches for XML fragment search have only considered statistics of XML documents stored in a database system to rank a search result. As a result, almost all XML fragment search engines have attained negative results in the research field of information retrieval (IR). To cope with this problem, considering not only statistics in the database system but also ones extracted from a query helps to improve retrieval accuracy of XML fragment search engines; however, it is also faced with a problem related with their efficiencies. Therefore, we have to devise ways of achieving both highly-relevant search results and efficient query processing. We implemented our XML search engine adopting the query-oriented fragment search approach, and found that it allows users to search XML fragments more accurately and effectively than conventional ones on our XML search engine.