TreeSpan: efficiently computing similarity all-matching

Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu. TreeSpan: efficiently computing similarity all-matching. In K. Selçuk Candan, Yi Chen 0001, Richard T. Snodgrass, Luis Gravano, Ariel Fuxman, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, May 20-24, 2012. pages 529-540, ACM, 2012. [doi]

@inproceedings{ZhuLZZY12,
  title = {TreeSpan: efficiently computing similarity all-matching},
  author = {Gaoping Zhu and Xuemin Lin and Ke Zhu and Wenjie Zhang and Jeffrey Xu Yu},
  year = {2012},
  doi = {10.1145/2213836.2213896},
  url = {http://doi.acm.org/10.1145/2213836.2213896},
  researchr = {https://researchr.org/publication/ZhuLZZY12},
  cites = {0},
  citedby = {0},
  pages = {529-540},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, May 20-24, 2012},
  editor = {K. Selçuk Candan and Yi Chen 0001 and Richard T. Snodgrass and Luis Gravano and Ariel Fuxman},
  publisher = {ACM},
  isbn = {978-1-4503-1247-9},
}