Query Rewriting for Incremental Continuous Query Evaluation in HIFUN
HIFUN is a high-level query language for expressing analytic queries of big datasets, offering a clear separation between the conceptual layer, where analytic queries are defined independently of the nature and location of data, and the physical layer, where queries are evaluated. In this paper, we...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-05-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/5/149 |
id |
doaj-e98d2ed6a4b24f46aa78b2803323309c |
---|---|
record_format |
Article |
spelling |
doaj-e98d2ed6a4b24f46aa78b2803323309c2021-05-31T23:28:49ZengMDPI AGAlgorithms1999-48932021-05-011414914910.3390/a14050149Query Rewriting for Incremental Continuous Query Evaluation in HIFUNPetros Zervoudakis0Haridimos Kondylakis1Nicolas Spyratos2Dimitris Plexousakis3Institute of Computer Science, FORTH-ICS, 70013 Heraklion, GreeceInstitute of Computer Science, FORTH-ICS, 70013 Heraklion, GreeceLaboratoire de Recherche en Informatique, Université de Paris-Sud, 91400 Orsay, FranceInstitute of Computer Science, FORTH-ICS, 70013 Heraklion, GreeceHIFUN is a high-level query language for expressing analytic queries of big datasets, offering a clear separation between the conceptual layer, where analytic queries are defined independently of the nature and location of data, and the physical layer, where queries are evaluated. In this paper, we present a methodology based on the HIFUN language, and the corresponding algorithms for the incremental evaluation of continuous queries. In essence, our approach is able to process the most recent data batch by exploiting already computed information, without requiring the evaluation of the query over the complete dataset. We present the generic algorithm which we translated to both SQL and MapReduce using SPARK; it implements various query rewriting methods. We demonstrate the effectiveness of our approach in temrs of query answering efficiency. Finally, we show that by exploiting the formal query rewriting methods of HIFUN, we can further reduce the computational cost, adding another layer of query optimization to our implementation.https://www.mdpi.com/1999-4893/14/5/149big dataquery languageincremental processing |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Petros Zervoudakis Haridimos Kondylakis Nicolas Spyratos Dimitris Plexousakis |
spellingShingle |
Petros Zervoudakis Haridimos Kondylakis Nicolas Spyratos Dimitris Plexousakis Query Rewriting for Incremental Continuous Query Evaluation in HIFUN Algorithms big data query language incremental processing |
author_facet |
Petros Zervoudakis Haridimos Kondylakis Nicolas Spyratos Dimitris Plexousakis |
author_sort |
Petros Zervoudakis |
title |
Query Rewriting for Incremental Continuous Query Evaluation in HIFUN |
title_short |
Query Rewriting for Incremental Continuous Query Evaluation in HIFUN |
title_full |
Query Rewriting for Incremental Continuous Query Evaluation in HIFUN |
title_fullStr |
Query Rewriting for Incremental Continuous Query Evaluation in HIFUN |
title_full_unstemmed |
Query Rewriting for Incremental Continuous Query Evaluation in HIFUN |
title_sort |
query rewriting for incremental continuous query evaluation in hifun |
publisher |
MDPI AG |
series |
Algorithms |
issn |
1999-4893 |
publishDate |
2021-05-01 |
description |
HIFUN is a high-level query language for expressing analytic queries of big datasets, offering a clear separation between the conceptual layer, where analytic queries are defined independently of the nature and location of data, and the physical layer, where queries are evaluated. In this paper, we present a methodology based on the HIFUN language, and the corresponding algorithms for the incremental evaluation of continuous queries. In essence, our approach is able to process the most recent data batch by exploiting already computed information, without requiring the evaluation of the query over the complete dataset. We present the generic algorithm which we translated to both SQL and MapReduce using SPARK; it implements various query rewriting methods. We demonstrate the effectiveness of our approach in temrs of query answering efficiency. Finally, we show that by exploiting the formal query rewriting methods of HIFUN, we can further reduce the computational cost, adding another layer of query optimization to our implementation. |
topic |
big data query language incremental processing |
url |
https://www.mdpi.com/1999-4893/14/5/149 |
work_keys_str_mv |
AT petroszervoudakis queryrewritingforincrementalcontinuousqueryevaluationinhifun AT haridimoskondylakis queryrewritingforincrementalcontinuousqueryevaluationinhifun AT nicolasspyratos queryrewritingforincrementalcontinuousqueryevaluationinhifun AT dimitrisplexousakis queryrewritingforincrementalcontinuousqueryevaluationinhifun |
_version_ |
1721417451657232384 |