Database Paper Browser

Back to papers

Efficient and Effective KNN Sequence Search with Approximate n-grams

Summary: Proposes KNN sequence search under edit distance using longer approximate n-grams for pruning with a two-level index. CA-based filtering with a frequency queue reduces false positives, enabling progressive results and early termination; parallel execution scales. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10761
Venue
VLDB
Year
2014
Pagerank
4.2500258e-05
Overall Rank
9,933 | 30.90%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,074 Pigeonring: A Principle for Faster Thresholded Similarity Search 2019 VLDB 5.2242306e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers