Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Constrained optimalities in query personalization
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Structure and content scoring for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Query result ranking over e-commerce web databases
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Fast contextual preference scoring of database tuples
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Order-preserving optimization of twig queries with structural preferences
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Effective XML content and structure retrieval with relevance ranking
Proceedings of the 18th ACM conference on Information and knowledge management
Hi-index | 0.00 |
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.