One-dimensional and multi-dimensional substring selectivity estimation

@article{Jagadish2000OnedimensionalAM,
  title={One-dimensional and multi-dimensional substring selectivity estimation},
  author={H. V. Jagadish and Olga Kapitskaia and Raymond T. Ng and Divesh Srivastava},
  journal={The VLDB Journal},
  year={2000},
  volume={9},
  pages={214-230}
}
With the increasing importance of XML, LDAP directories, and text-based information sources on the Internet, there is an ever-greater need to evaluate queries involving (sub)string matching. In many cases, matches need to be on multiple attributes/dimensions, with correlations between the multiple dimensions. Effective query optimization in this context requires good selectivity estimates. In this paper, we use pruned count-suffix trees (PSTs) as the basic data structure for substring… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Similar Papers

Loading similar papers…