Regular path queries under approximate semantics

DOI10.1007/S10472-005-9016-8MaRDI QIDQ2502162zbMATH OpenOpenAlexFDO

Authors Gösta Grahne, Alex Thomo

Publication date 12 September 2006

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-005-9016-8

zbMATH Keywords

approximate answersregular path queriessemistructured datatransducersweighted automata

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• Foundations of Information and Knowledge Systems
• Approximate answers in databases of labeled objects
• Weighted path queries on semistructured databases
• Preferential regular path queries
• scientific article; zbMATH DE number 2243050

Cites work

• Finding Regular Simple Paths in Graph Databases
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1163636 (Why is no real title available?)
• scientific article; zbMATH DE number 2080479 (Why is no real title available?)
• Improved limitedness theorems on finite automata with distance functions
• Limitedness theorem on finite automata with distance functions
• Limitedness theorem on finite automata with distance functions: An algebraic proof
• New upper bounds to the limitedness of distance automata
• On semigroups of matrices over the tropical semiring
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Path constraints in semistructured databases
• Rational equivalence relations
• Regular path queries with constraints
• Rewriting of regular expressions and regular path queries

Cited in

(13)

• Fault-tolerant computation of distributed regular path queries
• Context-free path querying by Kronecker product
• Weighted path queries on semistructured databases
• Approximate answers in databases of labeled objects
• Preferential regular path queries
• scientific article; zbMATH DE number 2086973 (Why is no real title available?)
• On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
• Approximate XML structure validation based on document-grammar tree similarity
• Visibly Pushdown Transducers for Approximate Validation of Streaming XML
• scientific article; zbMATH DE number 2243050 (Why is no real title available?)
• Foundations of Information and Knowledge Systems
• Evolving schemas for streaming XML
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

This page was built for publication: Regular path queries under approximate semantics

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