Home // DBKDA 2013, The Fifth International Conference on Advances in Databases, Knowledge, and Data Applications // View article

Optimization of SuperSQL Execution by Query Decomposition

Authors:
Ria Mae Borromeo
Motomichi Toyama

Keywords: database applications; database publishing; query processing; query optimization.

Abstract:
SuperSQL is an extension of SQL that allows formatting and publishing of database contents into various kinds of application data directly as a result of a query. Possible application data output formats include, but are not limited to, HTML, PDF, XML, XLS, and Ajax-driven pages. Originally, the SuperSQL query is directly converted into a single SQL query. In some query cases, this procedure returns a large intermediate table, which typically require a long execution time and consume a lot of memory. To minimize the execution time and memory consumption, query decomposition, the process of dividing a query into sub queries whose result sets’ union is equivalent to the result set of the original query, was applied to SuperSQL query processing. Experiments show that for several query cases, there is significant reduction in SuperSQL query execution time and memory consumption.

Pages: 65 to 70

Copyright: Copyright (c) IARIA, 2013

Publication date: January 27, 2013

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-247-9

Location: Seville, Spain

Dates: from January 27, 2013 to February 1, 2013