DBScholar

Back to papers

An Efficient Filter for Approximate Membership Checking

Summary: Proposes a filter-verification framework for approximate substring membership against a large dictionary, enabling efficient named-entity and biomedical concept extraction. Introduces a novel in-memory filter that prunes non-matches early, guarantees no false negatives, and outperforms prior methods in filtering power and runtime. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hfff34be678695036
Venue
SIGMOD
Year
2008
Pagerank
7.2531528e-05
Overall Rank
3,501 | 76.47%
DOI
10.1145/1376616.1376697

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chakrabarti_sigmod08,
        title = {{An Efficient Filter for Approximate Membership Checking}},
        author = {Chakrabarti, Kaushik and Chaudhuri, Surajit and Ganti, Venkatesh and Xin, Dong},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376697},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376697},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank Cited Paper Year Venue Pagerank
5 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0010679641
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
Previous Page 1 / 1 Next

Semantically Similar Papers