A Semantic Matrix for Aggregate Query Rewriting

Author(s):  
Romain Perriot ◽  
Laurent d’Orazio ◽  
Dominique Laurent ◽  
Nicolas Spyratos
Author(s):  
Leonardo Tininini

An efficient query engine is certainly one of the most important components in data warehouses (also known as OLAP systems or multidimensional databases) and its efficiency is influenced by many other aspects, both logical (data model, policy of view materialization, etc.) and physical (multidimensional or relational storage, indexes, etc). As is evident, OLAP queries are often based on the usual metaphor of the data cube and the concepts of facts, measures and dimensions and, in contrast to conventional transactional environments, they require the classification and aggregation of enormous quantities of data. In spite of that, one of the fundamental requirements for these systems is the ability to perform multidimensional analyses in online response times. Since the evaluation from scratch of a typical OLAP aggregate query may require several hours of computation, this can only be achieved by pre-computing several queries, storing the answers permanently in the database and then reusing them in the query evaluation process. These pre-computed queries are commonly referred to as materialized views and the problem of evaluating a query by using (possibly only) these precomputed results is known as the problem of answering/rewriting queries using views. In this paper we briefly analyze the difference between query answering and query rewriting approach and why query rewriting is preferable in a data warehouse context. We also discuss the main techniques proposed in literature to rewrite aggregate multidimensional queries using materialized views.


2000 ◽  
Vol 12 (5) ◽  
pp. 694-714 ◽  
Author(s):  
Kian-Lee Tan ◽  
Cheng Hian Goh ◽  
Beng Chin Ooi
Keyword(s):  

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 149
Author(s):  
Petros Zervoudakis ◽  
Haridimos Kondylakis ◽  
Nicolas Spyratos ◽  
Dimitris Plexousakis

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.


2021 ◽  
Vol 50 (1) ◽  
pp. 78-85
Author(s):  
Ester Livshits ◽  
Leopoldo Bertossi ◽  
Benny Kimelfeld ◽  
Moshe Sebag

Database tuples can be seen as players in the game of jointly realizing the answer to a query. Some tuples may contribute more than others to the outcome, which can be a binary value in the case of a Boolean query, a number for a numerical aggregate query, and so on. To quantify the contributions of tuples, we use the Shapley value that was introduced in cooperative game theory and has found applications in a plethora of domains. Specifically, the Shapley value of an individual tuple quantifies its contribution to the query. We investigate the applicability of the Shapley value in this setting, as well as the computational aspects of its calculation in terms of complexity, algorithms, and approximation.


2009 ◽  
pp. 3491-3493
Author(s):  
Rosie Jones ◽  
Fuchun Peng

Author(s):  
Hui Liu ◽  
Dawei Yin ◽  
Jiliang Tang
Keyword(s):  

Author(s):  
Xia Yang ◽  
Mong Li Lee ◽  
Tok Wang Ling ◽  
Gillian Dobbie

Sign in / Sign up

Export Citation Format

Share Document