Fault-tolerant computation of distributed regular path queries

DOI10.1016/j.tcs.2008.09.061zbMath1161.68017OpenAlexW2043112783MaRDI QIDQ1001900

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 tolerancesemistructured dataregular path queriesmessage complexitydistributed query evaluation

Mathematics Subject Classification ID

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

Related Items (1)

Fault-tolerant computation of distributed regular path queries

Uses Software

• GraphLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implication of regular expressions
• Rewriting of regular expressions and regular path queries
• Fault-tolerant computation of distributed regular path queries
• Regular path queries with constraints
• The lower bounds on distributed shortest paths
• Weighted path queries on semistructured databases
• Regular path queries under approximate semantics
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Finding Regular Simple Paths in Graph Databases
• Database Theory - ICDT 2005
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata

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