Database Programming Languages

DOI10.1007/11601524zbMATH Open1159.68408OpenAlexW2496305328MaRDI QIDQ5493341FDOQ5493341

Authors: Giorgio Busatto, Markus Lohrey, Sebastian Maneth 

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

Recommendations

• scientific article; zbMATH DE number 1927149
• Succinct ordinal trees with level-ancestor queries
• Succinct ordinal trees with level-ancestor queries
• Validating XML documents in the streaming model with external memory
• Compression of unordered XML trees

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (13)

• Compression of unordered XML trees
• Unification with Singleton Tree Grammars
• Balancing straight-line programs for strings and trees
• Title not available (Why is that?)
• The complexity of tree automata and XPath on grammar-compressed trees
• Fast equality test for straight-line compressed strings
• Constant-time tree traversal and subtree equality check for grammar-compressed trees
• Acceleration of XML Parsing through Prefetching
• XML compression techniques: A survey and comparison
• Random access to grammar-compressed strings and trees
• Title not available (Why is that?)
• Implementation and Application of Automata
• Congruence closure of compressed terms in polynomial time

Uses Software

• XMill

This page was built for publication: Database Programming Languages

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