An intelligent scheme for assigning queries

Kolomvatsos, K. (2018) An intelligent scheme for assigning queries. Applied Intelligence, 48(9), pp. 2730-2745. (doi: 10.1007/s10489-017-1099-5)

Full text not currently available from Enlighten.

Abstract

Analytics provided on top of large scale data streams are the key research subject for future decision making applications. The huge volumes of data make their partitioning imperative to efficiently support novel applications. Such applications should be based on intelligent, efficient methods for querying multiple data partitions. A processor is placed in front of each partition dedicated to manage/execute queries for the specific piece of data. Continuous queries over these data sources require intelligent mechanisms to result the final outcome (query response) in the minimum time with the maximum performance. This paper proposes a mechanism for handling the behavior of an entity that undertakes the responsibility of handling the incoming queries. Our mechanism adopts a time-optimized scheme for selecting the appropriate processor(s) for each incoming query through the use of the Odds algorithm. We try to result the optimal assignment, i.e., queries to processors, in the minimum time while maximizing the performance. We provide mathematical formulations for describing the discussed problem and present simulation results and a comparative analysis. Through a large number of experiments, we reveal the advantages of the model and give numerical results comparing it with a deterministic model as well as with other efforts in the domain.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Kolomvatsos, Dr Kostas
Authors: Kolomvatsos, K.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Applied Intelligence
Publisher:Springer
ISSN:0924-669X
ISSN (Online):1573-7497
Published Online:26 December 2017

University Staff: Request a correction | Enlighten Editors: Update this record