On Indexing Error-Tolerant Set Containment

Summary: Indexing asymmetric Jaccard containment with error tolerance and synonym-aware string transformations. Proposes an inverted-list index on token-sets and a size-aware lookup for containment queries; first study of Jaccard containment indexing under string transformations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h23104040901e5eb2
Venue: SIGMOD
Year: 2010
Pagerank: 6.1750986e-05
Overall Rank: 5,333 | 64.15%
DOI: 10.1145/1807167.1807267

Incoming Non-self Citations Over Time

Authors

1. Parag Agrawal (Stanford University)
2. Arvind Arasu (Microsoft)
3. Raghav Kaushik (Microsoft)

BibTeX Citation

@inproceedings{agrawal_sigmod10,
        title = {{On Indexing Error-Tolerant Set Containment}},
        author = {Agrawal, Parag and Arasu, Arvind and Kaushik, Raghav},
        series = {{SIGMOD} '10},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1807167.1807267},
        url = {https://dl.acm.org/doi/10.1145/1807167.1807267},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,318	LSH Ensemble: Internet-Scale Domain Search	2016	VLDB	0.00011047393
2,158	Open Data Integration	2018	VLDB	8.941016e-05
4,147	Local Similarity Search for Unstructured Text	2016	SIGMOD	6.7803631e-05
4,571	SILKMOTH: An Efficient Method for Finding Related Sets with Maximum Matching Constraints	2017	VLDB	6.5286445e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.00064420972
20	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00057568153
108	Approximate String Joins in a Database (Almost) for Free	2001	VLDB	0.0003305531
168	Efficient Exact Set-Similarity Joins	2006	VLDB	0.00027163517
201	Efficient set joins on similarity predicates	2004	SIGMOD	0.00025331535
262	Record Linkage: Similarity Measures and Algorithms	2006	SIGMOD	0.00022821392
1,171	Set Containment Joins: The Good, The Bad and The Ugly	2000	VLDB	0.00011702886
1,618	Efficient Processing of Joins on Set-valued Attributes	2003	SIGMOD	0.00010056773
3,553	Learning String Transformations From Examples	2009	VLDB	7.2089867e-05
4,140	Efficient Type-Ahead Search on Relational Data: a TASTIER Approach	2009	SIGMOD	6.7854783e-05
5,403	Mining Document Collections to Facilitate Accurate Approximate Entity Matching	2009	VLDB	6.1459021e-05
5,795	Efficient Approximate Search on String Collections (Tutorial)	2009	VLDB	5.9926463e-05
7,023	A New Method for Similarity Indexing of Market Basket Data	1999	SIGMOD	5.6186604e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,255	Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme	2011	SIGMOD
2	1,247	Entity Matching: How Similar Is Similar	2011	VLDB
3	12,468	Similarity Joins for Uncertain Strings	2014	SIGMOD
4	2,921	Leveraging Set Relations in Exact Set Similarity Join	2017	VLDB
5	7,842	Efficient Top-k Algorithms for Approximate Substring Matching	2013	SIGMOD
6	4,439	Incremental Maintenance of Length Normalized Indexes for Approximate String Matching	2009	SIGMOD
7	5,207	String Similarity Measures and Joins with Synonyms	2013	SIGMOD
8	201	Efficient set joins on similarity predicates	2004	SIGMOD
9	7,871	Incorporating String Transformations in Record Matching	2008	SIGMOD
10	8,110	Efficient and Tunable Similar Set Retrieval	2001	SIGMOD