skip to main content
10.1145/1529282.1529637acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Building an efficient preference XML query processor

Published: 08 March 2009 Publication History

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.

References

[1]
Amer-Yahia, S., Cho, S., Lakshmanan, L. and Srivastava, D. Minimization of tree pattern queries. In Proc. of the ACM SIGMOD Conf., Madison, WI, USA, 2002.
[2]
Cho, S. and Balke, W. T. Order-preserving optimization of twig queries with structural preferences. In Proc. of the Int. Database Engineering & Applications Symposium, Coimbra, Portugal, 2008.
[3]
Chomicki, J. Preference formulas in relational queries. In ACM Transactions on Database Systems, Vol. 28(4), ACM, 2003.
[4]
Kießling, W. Foundations of preferences in database systems. In Proc. of the Int. Conf. on Very Large Databases, Hong Kong, China, 2002.

Cited By

View all
  • (2019)A Tree Pattern Matching Algorithm for XML Queries with Structural PreferencesJournal of Computer and Communications10.4236/jcc.2019.7100607:01(61-83)Online publication date: 2019
  • (2009)Relaxing XML Preference Queries for Cooperative RetrievalEnterprise Information Systems10.1007/978-3-642-01347-8_14(160-171)Online publication date: 2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing
March 2009
2347 pages
ISBN:9781605581668
DOI:10.1145/1529282
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 March 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. XML databases
  2. personalization
  3. preference-based retrieval

Qualifiers

  • Research-article

Conference

SAC09
Sponsor:
SAC09: The 2009 ACM Symposium on Applied Computing
March 8, 2009 - March 12, 2008
Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2019)A Tree Pattern Matching Algorithm for XML Queries with Structural PreferencesJournal of Computer and Communications10.4236/jcc.2019.7100607:01(61-83)Online publication date: 2019
  • (2009)Relaxing XML Preference Queries for Cooperative RetrievalEnterprise Information Systems10.1007/978-3-642-01347-8_14(160-171)Online publication date: 2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media