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
Recommendations
fault toleranceregular path queriesmessage complexitysemistructured datadistributed query evaluation
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Distributed algorithms (68W15)
Cites Work
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Title not available (Why is that?)
- Regular path queries with constraints
- Finding Regular Simple Paths in Graph Databases
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Rewriting of regular expressions and regular path queries
- Weighted path queries on semistructured databases
- Implication of regular expressions
- Regular path queries under approximate semantics
- Database Theory - ICDT 2005
- Fault-tolerant computation of distributed regular path queries
- The lower bounds on distributed shortest paths
- Preferential regular path queries
- Title not available (Why is that?)
Cited In (4)
Uses Software
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)