Development of Query Transformation Method by Cost Optimization | Zendy

Aigerim Altayeva | Zendy; Youngmi Yoon | Zendy; Young Im Cho | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Development of Query Transformation Method by Cost Optimization

Author(s) -

Aigerim Altayeva,

Youngmi Yoon,

Young Im Cho

Publication year - 2016

Publication title -

international journal of fuzzy logic and intelligent systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.296

H-Index - 9

eISSN - 2093-744X

pISSN - 1598-2645

DOI - 10.5391/ijfis.2016.16.1.36

Subject(s) - computer science , transformation (genetics) , query optimization , heuristic , set (abstract data type) , reduction (mathematics) , execution time , sargable , point (geometry) , query language , database , web search query , information retrieval , search engine , programming language , mathematics , artificial intelligence , biochemistry , chemistry , gene , geometry

The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users’ queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive costbased transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research