Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Altinel M, Franklin M (2000) Efficient filtering of XML documents for selective dissemination of information. In: Proceedings of 26th international conference on very large data bases, Cairo. Morgan Kaufmann, Missouri, pp 53–64
Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM international conference on management of data, Atlantic City. ACM, New York, pp 322–331
Chan C-Y, Felber P, Garofalakis M, Rastogi R (2002) Efficient filtering of XML documents with XPath expressions. In: Proceedings of the 18th international conference on data engineering, San Jose. IEEE Computer Society, Piscataway, pp 235–244
Chan C-Y, Garofalakis M, Rastogi R (2002) RE-tree: an efficient index structure for regular expressions. In: Proceedings of 28th international conference on very large data bases, Hong Kong. Morgan Kaufmann, Missouri, pp 251–262
Chan C-Y, Garofalakis M, Rastogi R (2003) RE-tree: an efficient index structure for regular expressions. VLDB J 12(2):102–119
Clark J, DeRose S (1999) XML Path Language (XPath) Version 1.0. W3C Recommendation. http://www.w3.org./TR/xpath. Accessed Nov 1999
Diao Y, Fischer P, Franklin M, To R (2002) YFilter: efficient and scalable filtering of XML documents. In: Proceedings of the 18th international conference on data engineering, San Jose. IEEE Computer Society, Piscataway, pp 341–342
Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM international conference on management of data, Boston. ACM, New York, pp 47–57
Hopcroft J, Ullman J (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Reading
Kannan S, Sweedyk Z, Mahaney S (1995) Counting and random generation of strings in regular languages. In: Proceedings of the 6th ACM-SIAM symposium on discrete algorithms, San Francisco. ACM, New York, pp 551–557
Rissanen J (1978) Modeling by shortest data description. Automatica 14:465–471
Stewart JW (1998) BGP4, inter-domain routing in the Internet. Addison Wesley, Reading
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Chan, C., Garofalakis, M., Rastogi, R. (2016). Indexed Regular Expression Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_339
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_339
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering