Publisher
Springer International Publishing
Reference13 articles.
1. International Handbooks on Information Systems;F Baader,2009
2. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)
3. Bentley, J.L.: Decomposable searching problems. Inf. Process. Lett. 8(5), 244–251 (1979)
4. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002. ACM Press (2002)
5. Eppstein, D.: Are there small machines which can efficiently match regular expressions? (Krishnaswami) (2010).
https://cstheory.stackexchange.com/questions/1132/are-there-small-machines-which-can-efficiently-match-regular-expressions/1273#1273