Query Evaluation on Compressed Trees (Extended Abstract)

Authors:
Markus Frick;Martin Grohe;Christoph Koch
Affiliations:
-;-;-
Venue:
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Year:
2003

Citing 0
Cited 35

Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
Logic-based web information extraction

ACM SIGMOD Record
Binary queries for document trees

Nordic Journal of Computing
The Lixto data extraction project: back and forth between theory and practice

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Closure properties and decision problems of dag automata

Information Processing Letters
Processing queries on tree-structured data efficiently

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Interactive learning of node selecting tree transducer

Machine Learning
The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata
Automata for XML---A survey

Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Tight lower bounds for query processing on streaming and external memory data

Theoretical Computer Science
Path queries on compressed XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient processing of expressive node-selecting queries on XML data in secondary storage: a tree automata-based approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Online evaluation of regular tree queries

Nordic Journal of Computing
Efficient memory representation of XML document trees

Information Systems
Quantity comparison of concurrency control methods for XML database systems based on DOM API

International Journal of Web Engineering and Technology
XPath leashed

ACM Computing Surveys (CSUR)
Reasoning about XML with Temporal Logics and Automata

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach

Fundamenta Informaticae
Closure properties and decision problems of dag automata

Information Processing Letters
Probabilistic XML via Markov Chains

Proceedings of the VLDB Endowment
Queries on Xml streams with bounded delay and concurrency

Information and Computation
Controlled term rewriting

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Automata for positive core XPath queries on compressed documents

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient memory representation of XML documents

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
N-ary queries by tree automata

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Minimizing tree automata for unranked trees

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Matching with regular constraints

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Logics for unranked trees: an overview

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Tree automata and XPath on compressed trees

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Deciding twig-definability of node selecting tree automata

Proceedings of the 15th International Conference on Database Theory
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach

Fundamenta Informaticae
XML compression via DAGs

Proceedings of the 16th International Conference on Database Theory
Tree compression with top trees

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
XML tree structure compression using RePair

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of evaluating unary (or node-selecting)queries on unranked trees compressed in a naturalstructure-preserving way, by the sharing of common subtrees. Themotivation to study unary queries on unranked trees comes fromthe database field, where querying XML documents, which can beconsidered as unranked labelled trees, is an important task.We give algorithms and complexity results for the evaluationof XPath and monadic datalog queries. Furthermore, we proposea new automata-theoretic formalism for querying trees and givealgorithms for evaluating queries defined by such automata.