Satisfiability of xpath expressions

Hidders, Jan (2003) Satisfiability of xpath expressions. In: Lausen, G. and Suciu, D. (eds.) Database Programming Languages: 9th International Workshop. Lecture Notes in Computer Science 2921. Springer, pp. 21-36. ISBN 9783540208969.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/978-3-540-24607-7\_3

Abstract

In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem. Finally, we establish a link between XPath expressions and partial tree descriptions which are studied in computational linguistics.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	20 Apr 2021 18:21
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43939

Statistics

Archive Staff Only (login required)

Edit/View Item