An Overwiew of Evolution of Lexical Query Optimization Techniques
The presented overview is concerned with lexical query optimization and covers papers published in the last four decades. The paper consists of five sections. The first section – Introduction – classifies query optimization techniques into semantic optimizations and lexical optimizations. Semantic o...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| Series: | Труды Института системного программирования РАН |
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/981 |
| _version_ | 1818206061824311296 |
|---|---|
| author | N. A. Mendkovich S. D. Kuznetsov |
| author_facet | N. A. Mendkovich S. D. Kuznetsov |
| author_sort | N. A. Mendkovich |
| collection | DOAJ |
| description | The presented overview is concerned with lexical query optimization and covers papers published in the last four decades. The paper consists of five sections. The first section – Introduction – classifies query optimization techniques into semantic optimizations and lexical optimizations. Semantic optimizations usually relies on data integrity rules that are stores within metadata part of databases, and on data statistics. This kind of optimizations is discussed in many textbooks and papers. Lexical optimizations (more often called rewriting) use only a text of query and no other information about database and its structure. Lexical optimizations are further classified into query transformations, query amelioration, and query reduction. The second section of the paper discusses techniques of query transformation such as predicate pushdown, transformation of nested query into query with joins, etc. Query amelioration is a topic of the third section with a focus on magic set optimizations. The forth section covers query reduction optimizations. The section briefly describes traditional approaches (such as tableau -based) are briefly described and considers in more details three new algorithms proposed by authors. The fifth section concludes the paper. |
| first_indexed | 2024-12-12T04:07:03Z |
| format | Article |
| id | doaj.art-5f27c7ae0a49470f9d3b8714019880a0 |
| institution | Directory Open Access Journal |
| issn | 2079-8156 2220-6426 |
| language | English |
| last_indexed | 2024-12-12T04:07:03Z |
| publishDate | 2018-10-01 |
| publisher | Ivannikov Institute for System Programming of the Russian Academy of Sciences |
| record_format | Article |
| series | Труды Института системного программирования РАН |
| spelling | doaj.art-5f27c7ae0a49470f9d3b8714019880a02022-12-22T00:38:45ZengIvannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-0123010.15514/ISPRAS-2012-23-12981An Overwiew of Evolution of Lexical Query Optimization TechniquesN. A. Mendkovich0S. D. Kuznetsov1ИСП РАНИСП РАНThe presented overview is concerned with lexical query optimization and covers papers published in the last four decades. The paper consists of five sections. The first section – Introduction – classifies query optimization techniques into semantic optimizations and lexical optimizations. Semantic optimizations usually relies on data integrity rules that are stores within metadata part of databases, and on data statistics. This kind of optimizations is discussed in many textbooks and papers. Lexical optimizations (more often called rewriting) use only a text of query and no other information about database and its structure. Lexical optimizations are further classified into query transformations, query amelioration, and query reduction. The second section of the paper discusses techniques of query transformation such as predicate pushdown, transformation of nested query into query with joins, etc. Query amelioration is a topic of the third section with a focus on magic set optimizations. The forth section covers query reduction optimizations. The section briefly describes traditional approaches (such as tableau -based) are briefly described and considers in more details three new algorithms proposed by authors. The fifth section concludes the paper.https://ispranproceedings.elpub.ru/jour/article/view/981оптимизация запросовупрощение запросовлексическая оптимизация запросовмагические множества |
| spellingShingle | N. A. Mendkovich S. D. Kuznetsov An Overwiew of Evolution of Lexical Query Optimization Techniques Труды Института системного программирования РАН оптимизация запросов упрощение запросов лексическая оптимизация запросов магические множества |
| title | An Overwiew of Evolution of Lexical Query Optimization Techniques |
| title_full | An Overwiew of Evolution of Lexical Query Optimization Techniques |
| title_fullStr | An Overwiew of Evolution of Lexical Query Optimization Techniques |
| title_full_unstemmed | An Overwiew of Evolution of Lexical Query Optimization Techniques |
| title_short | An Overwiew of Evolution of Lexical Query Optimization Techniques |
| title_sort | overwiew of evolution of lexical query optimization techniques |
| topic | оптимизация запросов упрощение запросов лексическая оптимизация запросов магические множества |
| url | https://ispranproceedings.elpub.ru/jour/article/view/981 |
| work_keys_str_mv | AT namendkovich anoverwiewofevolutionoflexicalqueryoptimizationtechniques AT sdkuznetsov anoverwiewofevolutionoflexicalqueryoptimizationtechniques AT namendkovich overwiewofevolutionoflexicalqueryoptimizationtechniques AT sdkuznetsov overwiewofevolutionoflexicalqueryoptimizationtechniques |