Top-k String Similarity Joins-Reference-Cited by-同舟云学术

Top-k String Similarity Joins

Published:2020-07-07 Issue: Volume: Page:
ISSN:
Container-title:32nd International Conference on Scientific and Statistical Database Management
language:
Short-container-title:

Author:

Qi Shuyao¹,Bouros Panagiotis²,Mamoulis Nikos³

Affiliation:

1. The University of Hong Kong

2. Johannes Gutenberg University Mainz

3. University of Ioannina

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3400903.3400922

Reference37 articles.

1. Thomas Brinkhoff Hans-Peter Kriegel and Bernhard Seeger. 1993. Efficient Processing of Spatial Joins Using R-Trees. In SIGMOD. 237–246. Thomas Brinkhoff Hans-Peter Kriegel and Bernhard Seeger. 1993. Efficient Processing of Spatial Joins Using R-Trees. In SIGMOD. 237–246.

2. Surajit Chaudhuri Venkatesh Ganti and Raghav Kaushik. 2006. A Primitive Operator for Similarity Joins in Data Cleaning. In ICDE. 5. Surajit Chaudhuri Venkatesh Ganti and Raghav Kaushik. 2006. A Primitive Operator for Similarity Joins in Data Cleaning. In ICDE. 5.

3. Christos Doulkeridis Akrivi Vlachou Yannis Kotidis and Neoklis Polyzotis. 2012. Processing of Rank Joins in Highly Distributed Systems. In ICDE. 606–617. Christos Doulkeridis Akrivi Vlachou Yannis Kotidis and Neoklis Polyzotis. 2012. Processing of Rank Joins in Highly Distributed Systems. In ICDE. 606–617.

4. Ronald Fagin Amnon Lotem and Moni Naor. 2001. Optimal aggregation algorithms for middleware. In PODS. 102–113. Ronald Fagin Amnon Lotem and Moni Naor. 2001. Optimal aggregation algorithms for middleware. In PODS. 102–113.

5. Luis Gravano Panagiotis G. Ipeirotis H. V. Jagadish Nick Koudas S. Muthukrishnan and Divesh Srivastava. 2001. Approximate String Joins in a Database (Almost) for Free. In VLDB. 491–500. Luis Gravano Panagiotis G. Ipeirotis H. V. Jagadish Nick Koudas S. Muthukrishnan and Divesh Srivastava. 2001. Approximate String Joins in a Database (Almost) for Free. In VLDB. 491–500.