Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Searching XML documents via XML fragments
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Structure and content scoring for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A unifying framework for merging and evaluating XML information
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
As XML information proliferates on the Web, searching XML information via a search engine is crucial to the experience of both casual and experienced Web users. The returned XML fragments in the list is not directly usable, if not confusing, to the users, since in most cases the XML fragments extracted from a large XML repository are incomplete, scattered and redundant. Thus, it is necessary to reiterate the searching process based on user preferences in order to obtain more complete, detailed and usable results. In this paper, we propose a unifying framework which takes searching, merging and user preferences into account. We view search queries and fragment labeling as an input in an on-going searching process, in which the relevant XML fragments are merged into a concise form and returned to the user a ranked result list.