Relative Expressiveness of Nested Regular Expressions

@inproceedings{Barcel2012RelativeEO,
  title={Relative Expressiveness of Nested Regular Expressions},
  author={Pablo Barcel{\'o} and Jorge P{\'e}rez and Juan L. Reutter},
  booktitle={AMW},
  year={2012}
}
Nested regular expressions (NREs) have been proposed as a powerful formalism for querying RDFS graphs, but not too much investigation on NREs has been pursued in a more general graph database context. In this paper we study the relative expressiveness of NREs by comparing it with the language of conjunctive regular path queries (CRPQs), which is one of the most widely studied query languages for graph databases. Among other results, we show that NREs and CRPQs are incomparable in terms of… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Similar Papers

Loading similar papers…