Efficient Incremental Evaluation of Succinct Regular Expressions

@inproceedings{Bjrklund2015EfficientIE,
  title={Efficient Incremental Evaluation of Succinct Regular Expressions},
  author={Henrik Bj{\"o}rklund and Wim Martens and Thomas Timm},
  booktitle={CIKM},
  year={2015}
}
Regular expressions are omnipresent in database applications. They form the structural core of schema languages for XML, they are a fundamental ingredient for navigational queries in graph databases, and are being considered in languages for upcoming technologies such as schema- and transformation languages for tabular data on the Web. In this paper we study the usage and effectiveness of the counting operator (or: limited repetition) in regular expressions. The counting operator is a popular… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

SPARQL 1.1 query language

  • S. Harris, A. Seaborne
  • Technical report, World Wide Web Consortium,
  • 2012
Highly Influential
7 Excerpts