Relaxing Queries Based on XML Structure and Content Preferences

被引:0
作者
Yan, Wei [1 ]
Ma, Z. M. [1 ]
Zhang, Fu [1 ]
Meng, Xiangfu [2 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
[2] Liaoning Tech Univ, Coll Elect & Informat Engn, Huludao 125105, Peoples R China
来源
WEB INFORMATION SYSTEMS ENGINEERING - WISE 2010 WORKSHOPS | 2011年 / 6724卷
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
XML; structure and content; query relaxation; contextual preference; Top-k ranking;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In order to resolve the problem of the empty or many answers returned from XML, this paper proposes a contextual preference query method of XML structural relaxation and content scoring. To provide users with most relevant and ranked query results, firstly, we propose a XML contextual preference (XCP) model, where all the possible relaxing queries are determined by the user's preferences. The XCP model allows users to express their interest on XML tree nodes, and then users assign interest scores to their interesting nodes for quickly providing best answers. Furthermore, based on the proposed XCP model, we propose a preference queries results ranking method, which includes: a Clusters_Merging algorithm to merge clusters based on the similarity of the context states, a Finding_Orders algorithm to find representative orders of the clusters, and a Top-k ranking algorithm to deal with the many answers problem. Results of preliminary user study demonstrate that our method can provide users with most relevant and ranked query results. The efficiency and effectiveness of the approach are also demonstrated by experimental results.
引用
收藏
页码:44 / +
页数:2
相关论文
共 19 条
  • [1] Agrawal R., 2006, P ACM SPECIAL INTERE, P383
  • [2] Amer-Yahia S, 2002, LECT NOTES COMPUT SC, V2287, P496
  • [3] Amer-Yahia S., 2007, P 23 INT C DAT ENG I, P906
  • [4] Amer-Yahia Sihem., 2004, SIGMOD, P83, DOI DOI 10.1145/1007568.1007581
  • [5] Amer-Yahia Sihem., 2005, Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005, P361
  • [6] Cho S., 2008, P 2008 INT S DATABAS, P219
  • [7] Cho SR, 2009, INT CONF RES CHAL, P365, DOI 10.1109/RCIS.2009.5089300
  • [8] Cho S, 2009, LECT NOTES BUS INF P, V24, P160
  • [9] Preference formulas in relational queries
    Chomicki, J
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2003, 28 (04): : 427 - 466
  • [10] Optimal aggregation algorithms for middleware
    Fagin, R
    Lotem, A
    Naor, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (04) : 614 - 656