XPath evaluation in linear time

DOI10.1145/1989727.1989731zbMath1281.68093OpenAlexW2022626404MaRDI QIDQ5395662

Paweł Parys, Mikołaj Bojańczyk

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

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

Related Items (5)

Deciding twig-definability of node selecting tree automata ⋮ Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ Efficient testing and matching of deterministic regular expressions ⋮ The factorisation forest theorem ⋮ Regular expressions for data words

Uses Software

• XPath

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