SSCard estimates substring cardinality using a pruned suffix tree over an FM-index, with learned spline rank functions and an error bound, achieving lower q-error and smaller space than prior methods on five datasets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index
SSCard estimates substring cardinality using a pruned suffix tree over an FM-index, with learned spline rank functions and an error bound, achieving lower q-error and smaller space than prior methods on five datasets.