Filtering techniques for rewriting XPath queries using views

R. Zhou, C. Liu, Jianxin Li, J. Wang

    Research output: Chapter in Book/Conference paperConference paper

    1 Citation (Scopus)

    Abstract

    In this paper, we propose several filtering techniques for rewriting XPath queries using views. The work is motivated by scenarios dealing with large quantities of queries and views, such as semantic query caching and data integration. Considerable rewriting computation could be saved if we manage to efficiently discover that, given a query Q and a view V, there does not exist a rewriting for Q using V. In contrast to O(|Q||V|) (O(|Q||V|2)) time complexity to compute an equivalent rewriting (contained rewriting) for XP {/,//,[] } , we devise linear algorithms running in O(|Q|) to filter queries for both equivalent rewriting and contained rewriting. Our filtering algorithms can be extended to support queries and views in XP {/,//,[],*} , where the equivalent (or contained) rewriting existence problem is still coNP-hard. © 2008 Springer-Verlag Berlin Heidelberg.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages307-320
    Number of pages14
    Volume5175 LNCS
    DOIs
    Publication statusPublished - 2008
    Event9th International Conference on Web Information Systems Engineering, WISE 2008 - Auckland, New Zealand
    Duration: 1 Sep 20083 Sep 2008

    Conference

    Conference9th International Conference on Web Information Systems Engineering, WISE 2008
    Period1/09/083/09/08

    Fingerprint Dive into the research topics of 'Filtering techniques for rewriting XPath queries using views'. Together they form a unique fingerprint.

    Cite this