Database Paper Browser

Back to papers

Cardinality Estimation of Approximate Substring Queries using Deep Learning

Summary: DL-based cardinality estimation for approximate substring queries, outperforming traditional summaries. Introduces efficient train-data generation with shared computations and a novel learning method for fast, accurate training; experiments show clear gains over baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12796
Venue
VLDB
Year
2022
Pagerank
4.7194345e-05
Overall Rank
7,474 | 48.01%
DOI
10.14778/3551793.3551859

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers