The NOX OLAP Query Model: From Algebra to Execution

Taleb, Ahmad; Eavis, Todd; Tabbara, Hiba

doi:10.1007/978-3-642-23544-3_13

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ultimately, such a mechanism allows for 1) compile time syntactic and semantic checking, 2) rich refactoring opportunities, 3) the use of Object Oriented features such as query inheritance, and 4) the utilization of a single programming API for both the application and the database backend. The details of the native language model−known as native language OLAP query eXecution (NOX)−have been described in a previous publication [22]. However, it is important in the current context to at least understand the relationship between the query representation, the optimizer, and the storage engine.…”

Section: B the Nox Query Interfacementioning

confidence: 99%

Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance and Scale It Too

Eavis¹,

Taleb²

2013

Journal of Computing Science and Engineering

Self Cite

View full text Add to dashboard Cite

Over the past generation, data warehousing and online analytical processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While MOLAP systems do indeed provide impressive performance on common analytics queries, they tend to have limited scalability. Conversely, ROLAP's table oriented model scales quite nicely, but offers mediocre performance at best relative to the MOLAP systems. In this paper, we describe a storage and indexing framework that aims to provide both MOLAP like performance and ROLAP like scalability by essentially combining some of the best features from both. Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage model. Specifically, it utilizes an OLAP algebra coupled with a domain specific query optimizer, to map user queries directly to the storage and indexing framework. Experimental results demonstrate that not only does the design improve upon more naive approaches, but that it does indeed offer the potential to optimize both query performance and scalability.

show abstract

Section: B the Nox Query Interfacementioning

confidence: 99%