Abstract
Accurate cost and time estimation of a query is one of the major success indicators for database management systems. SQL allows the expression of flexible queries on text-formatted data. The LIKE operator is used to search for a specified pattern (e.g., LIKE "luck %") in a string database. It is vital to estimate the selectivity of such flexible predicates for the query optimizer to choose an efficient execution plan. In this paper, we study the problem of estimating the selectivity of a LIKE query predicate over a bag of strings. We propose a new type of pattern-based histogram structure to summarize the data distribution in a particular column. More specifically, we first mine sequential patterns over a given string database and then construct a special histogram out of the mined patterns. During query optimization time, pattern-based histograms are exploited to estimate the selectivity of a LIKE predicate. The experimental results on a real dataset from DBLP show that the proposed technique outperforms the state of the art for generic LIKE queries likeke $\%s_1\%s_2\%...\%s_n\%$ where $s_i$ represents one or more characters. What is more, the proposed histogram structure requires more than two orders of magnitude smaller memory space, and the estimation time is almost an order of magnitude less in comparison to the state of the art.
Highlights
One of the key reasons for the success of relational database management systems is their advanced query optimization capabilities
We propose a new technique, SPH, to estimate the selectivity of LIKE query predicates based on a novel summary structure called pattern-based histograms
We build a special histogram structure on top of the sequence patterns extracted from a string database
Summary
One of the key reasons for the success of relational database management systems is their advanced query optimization capabilities. The query optimizer explores all or a subset of possible execution plan alternatives and determines the most efficient way to execute a given query. With the explosion of the Internet and textbased data, the role of the query optimizer is even more critical to efficiently query the huge amounts of textual data. Rather than exact equality string predicates, often, flexible patterns are preferred to search in such textual data piles. SQL provides the LIKE operator to enable approximate string searches. Consider a table in a database that stores customer records such as name, age, salary, etc. In SQL, such a query is expressed as follows: SELECT * FROM CUSTOMERS WHERE name LIKE ‘Lucia%’
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
