Using positional sequence patterns to estimate the selectivity of SQL LIKE queries
Authors:
- Mehmet AytimurMAMehmet Aytimur
- Ali CakmakACAli Cakmak
- 1 March 2021
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 165
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Scientific and Technological Research Council of Turkey (117E086)
This publication has 21 references indexed in Scilit:
- FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategyKnowledge and Information Systems, 2017
- The TileDB array data storage managerProceedings of the VLDB Endowment, 2016
- The MEME SuiteNucleic Acids Research, 2015
- Selectivity Estimation for String Predicates Based on Modified Pruned Count‐Suffix TreeChinese Journal of Electronics, 2015
- Conformance checking of processes based on monitoring real behaviorInformation Systems, 2008
- Business process mining: An industrial applicationInformation Systems, 2007
- Estimating the selectivity of approximate string queriesACM Transactions on Database Systems, 2007
- Mining sequential patterns by pattern-growth: the PrefixSpan approachIEEE Transactions on Knowledge and Data Engineering, 2004
- Substring selectivity estimation1999
- Estimating alphanumeric selectivity in the presence of wildcardsACM SIGMOD Record, 1996