Swinburne
Browse

Containment between unions of xpath queries

Download (229.95 kB)
conference contribution
posted on 2024-07-09, 19:15 authored by Rui ZhouRui Zhou, Chengfei LiuChengfei Liu, Junhu Wang, Jianxin Li
In this paper, we address the containment problem for unions of XPath queries with and without schema. We find the problem can be always reduced into containment problem between one single query and a union of queries. When schema is not available, the problem can be further reduced into checking containment between pairwise queries(each from one union), but this only holds for some XPath subsets, such as XP{/,//,[]}, but not for XP{/,//,[],∗}. We then show the problem is still solvable in XP{/,//,[],∗}, though no efficient algorithm exists. When schema is at hand, we propose a strategy to rewrite a query into a union of simplified queries based on schema information, and then apply methods developed when schema is not taken into account. The problem is then reduced into checking containment between unions of queries in XP{/,[]}without schema.

History

Available versions

PDF (Accepted manuscript)

ISBN

9783642008863

ISSN

1611-3349

Journal title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

5463

Pagination

405-420

Publisher

Springer

Copyright statement

Copyright © 2009 Springer-Verlag Berlin Heidelberg. The accepted manuscript is reproduced in accordance with the copyright policy of the publisher. The definitive version of the publication is available at www.springer.com.

Language

eng

Usage metrics

    Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC