Graph-based speculative query execution for RDBMS

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper concerns parallelized speculative support for query execution in RDBMS. The support is based on dynamic analysis of input query stream in databases serviced in SQLite. A multi-threaded middleware called the Speculative Layer is introduced which, based on a specific graph representation of a query stream, determines the most promising speculative queries for execution. The paper briefly presents the query graph modelling and analysis methods. Then, an extended version of speculative query execution algorithm is presented which allows combining results of multiple speculative queries for execution of one user input query. Experimental results are presented based on the proposed algorithm assessment in a multi-threaded testbed cooperating with a database serviced in SQLite.

Cite

CITATION STYLE

APA

Sasak-Okoń, A., & Tudruj, M. (2018). Graph-based speculative query execution for RDBMS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10777 LNCS, pp. 303–313). Springer Verlag. https://doi.org/10.1007/978-3-319-78024-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free