Database Paper Browser

Back to papers

Approximate Substring Matching over Uncertain Strings

Summary: Proposes (k, tau)-matching semantics for approximate substring matching over uncertain strings modeled by probability distributions. Introduces multilevel filtering using signature-distance and two bound-based verification algorithms to reduce indexing and verification costs, validated on real and synthetic datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10306
Venue
VLDB
Year
2011
Pagerank
4.5768015e-05
Overall Rank
8,143 | 43.36%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
8,306 Online Windowed Subsequence Matching over Probabilistic Sequences 2012 SIGMOD 4.5435639e-05
11,904 Indexing Metric Uncertain Data for Range Queries 2015 SIGMOD 4.1945683e-05
11,979 Similarity Joins for Uncertain Strings 2014 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
125 Approximate String Joins in a Database (Almost) for Free 2001 VLDB 0.00044847972
4,901 Probabilistic String Similarity Joins 2010 SIGMOD 5.8411648e-05
6,351 SigMatch: Fast and Scalable Multi-Pattern Matching 2010 VLDB 5.1005697e-05
Previous Page 1 / 1 Next

Semantically Similar Papers