Fault-tolerant computation of distributed regular path queries

DOI10.1016/J.TCS.2008.09.061zbMATH Open1161.68017OpenAlexW2043112783MaRDI QIDQ1001900FDOQ1001900

Authors Maryam Shoaran, Alex Thomo

Publication date 19 February 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.09.061

zbMATH Keywords

fault toleranceregular path queriesmessage complexitysemistructured datadistributed query evaluation

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Distributed algorithms (68W15)

Recommendations

• Weighted path queries on semistructured databases
• Regular path queries under approximate semantics
• scientific article; zbMATH DE number 5808834
• Regular path queries with constraints
• Foundations of Information and Knowledge Systems

Cites work

• scientific article; zbMATH DE number 219218 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Database Theory - ICDT 2005
• Fault-tolerant computation of distributed regular path queries
• Finding Regular Simple Paths in Graph Databases
• Implication of regular expressions
• Preferential regular path queries
• Regular path queries under approximate semantics
• Regular path queries with constraints
• Rewriting of regular expressions and regular path queries
• The lower bounds on distributed shortest paths
• Weighted path queries on semistructured databases

Cited in

(4)

• Fault-tolerant computation of distributed regular path queries
• Nagging: A scalable fault-tolerant paradigm for distributed search
• scientific article; zbMATH DE number 7724191 (Why is no real title available?)
• Distributed search trees: fault tolerance in an asynchronous environment

Describes a project that uses

Uses Software

• GraphLog

This page was built for publication: Fault-tolerant computation of distributed regular path queries

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