DMCA
Building an Efficient Preference XML Query Processor (2009)
| Venue: | In ACM Symposium on Applied Computing (SAC |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Cho09buildingan,
author = {Sungran Cho and Wolf-tilo Balke},
title = {Building an Efficient Preference XML Query Processor},
booktitle = {In ACM Symposium on Applied Computing (SAC},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enabling users to express individual interests and delivering personalized information. As the structure of XML documents plays a major part in retrieval, users often have specific preferences about the structure. For evaluation a query has to be unfolded into an entire set of queries filling the structure with more or less preferred values. Since such structure expansions typically contain redundancies, it is important to identify and simplify necessary expansion queries for effective evaluation. To address these issues, we developed a preference query optimizer that not only determines an optimal set of expansion queries, but also preserves the specific ordering induced by the user preferences with respect to Pareto optimality.
Keyphrases
efficient preference xml query processor specific ordering effective evaluation specific preference important paradigm major part optimal set individual interest user preference preference query optimizer today user-centered information acquisition preferred value xml document necessary expansion query expansion query complex xml document structure expansion pareto optimality entire set
