1. Arasu A, Ganti V, Kaushik R (2006) Efficient exact set-similarity joins. In: Proceedings of the international conference on very large databases (VLDB), VLDB Endowment, pp 918–929
2. Augsten N, Böhlen M, Dyreson C, Gamper J (2012) Windowed $$pq$$ -grams for approximate joins of data-centric XML. VLDB J 21(4):463–488
3. Augsten N, Böhlen M, Gamper J (2004) Reducing the integration of public administration databases to approximate tree matching. In: Electronic government—third international conference, LNCS 3183. Springer, Zaragoza, pp 102–107
4. Augsten N, Böhlen M, Gamper J (2005) Approximate matching of hierarchical data using $$pq$$ -grams. In: Proceedings of the international conference on very large databases (VLDB). ACM Press, Trondheim, pp 301–312
5. Augsten N, Böhlen M, Gamper J (2006) An incrementally maintainable index for approximate lookups in hierarchical data. In: Proceedings of the international conference on very large databases (VLDB). ACM Press, Seoul, pp 247–258