XPath evaluation in linear time

DOI10.1145/1989727.1989731MaRDI QIDQ5395662zbMATH OpenOpenAlexFDO

Authors Mikołaj Bojańczyk, Paweł Parys

Publication date 17 February 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1989727.1989731

zbMATH Keywords

XMLXPathtree with data

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• Worst-case optimal algorithm for XPath evaluation over XML streams
• The complexity of XPath query evaluation and XML typing
• Evaluating linear XPath expressions by pattern-matching automata
• On the minimization of XPath queries
• Containment and equivalence for a fragment of XPath

Cited in

(9)

• scientific article; zbMATH DE number 1964836 (Why is no real title available?)
• Deciding twig-definability of node selecting tree automata
• scientific article; zbMATH DE number 1950276 (Why is no real title available?)
• The factorisation forest theorem
• Automata for Positive Core XPath Queries on Compressed Documents
• Efficient testing and matching of deterministic regular expressions
• scientific article; zbMATH DE number 2114412 (Why is no real title available?)
• Regular expressions for data words
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs

Describes a project that uses

Uses Software

• XPath

This page was built for publication: XPath evaluation in linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395662)