Database Programming Languages

DOI10.1007/11601524zbMath1159.68408OpenAlexW2496305328MaRDI QIDQ5493341

Sebastian Maneth, Giorgio Busatto, Markus Lohrey

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11601524

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (8)

Congruence Closure of Compressed Terms in Polynomial Time ⋮ The complexity of tree automata and XPath on grammar-compressed trees ⋮ Fast equality test for straight-line compressed strings ⋮ Tree compression using string grammars ⋮ Constant-time tree traversal and subtree equality check for grammar-compressed trees ⋮ Unification with Singleton Tree Grammars ⋮ Random Access to Grammar-Compressed Strings and Trees ⋮ Balancing straight-line programs for strings and trees

Uses Software

• XMill

This page was built for publication: Database Programming Languages