ACM Home Page
Please provide us with feedback. Feedback
Advanced SQL modeling in RDBMS
Full text PdfPdf (279 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 30 ,  Issue 1  (March 2005) table of contents
Special Issue: SIGMOD/PODS 2003
Pages: 83 - 121  
Year of Publication: 2005
ISSN:0362-5915
Authors
Andrew Witkowski  Oracle Corporation, Redwood Shores, CA
Srikanth Bellamkonda  Oracle Corporation, Redwood Shores, CA
Tolga Bozkaya  Oracle Corporation, Redwood Shores, CA
Nathan Folkert  Oracle Corporation, Redwood Shores, CA
Abhinav Gupta  Oracle Corporation, Redwood Shores, CA
John Haydu  Oracle Corporation, Redwood Shores, CA
Lei Sheng  Oracle Corporation, Redwood Shores, CA
Sankar Subramanian  Oracle Corporation, Redwood Shores, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 218,   Citation Count: 2
Additional Information:

appendices and supplements   abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1061318.1061321
What is a DOI?

APPENDICES and SUPPLEMENTS
Online appendix to designing mediation for context-aware applications. The appendix supports the information on page 83.


ABSTRACT

Commercial relational database systems lack support for complex business modeling. ANSI SQL cannot treat relations as multidimensional arrays and define multiple, interrelated formulas over them, operations which are needed for business modeling. Relational OLAP (ROLAP) applications have to perform such tasks using joins, SQL Window Functions, complex CASE expressions, and the GROUP BY operator simulating the pivot operation. The designated place in SQL for calculations is the SELECT clause, which is extremely limiting and forces the user to generate queries with nested views, subqueries and complex joins. Furthermore, SQL query optimizers are preoccupied with determining efficient join orders and choosing optimal access methods and largely disregard optimization of multiple, interrelated formulas. Research into execution methods has thus far concentrated on efficient computation of data cubes and cube compression rather than on access structures for random, interrow calculations. This has created a gap that has been filled by spreadsheets and specialized MOLAP engines, which are good at specification of formulas for modeling but lack the formalism of the relational model, are difficult to coordinate across large user groups, exhibit scalability problems, and require replication of data between the tool and RDBMS. This article presents an SQL extension called SQL Spreadsheet, to provide array calculations over relations for complex modeling. We present optimizations, access structures, and execution models for processing them efficiently. Special attention is paid to compile time optimization for expensive operations like aggregation. Furthermore, ANSI SQL does not provide a good separation between data and computation and hence cannot support parameterization for SQL Spreadsheets models. We propose two parameterization methods for SQL. One parameterizes ANSI SQL view using subqueries and scalars, which allows passing data to SQL Spreadsheet. Another method presents parameterization of the SQL Spreadsheet formulas. This supports building stand-alone SQL Spreadsheet libraries. These models are then subject to the SQL Spreadsheet optimizations during model invocation time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
4
 
5
 
6
7
8
 
9
Howson, C. 2002. Business Objects: The Complete Reference. McGraw-Hill/Osborne, New York, NY.
10
 
11
12
 
13
Olap Application Developer's Guide. 2004. Oracle Database 10g Release 1 (10.1) Documentation. 2004. Oracle, Redwood Shores, CA.
 
14
 
15
16
17
 
18
Tarjan, R. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2, 146--160.
 
19
20
 
21
Zemke, F., Kulkarni, K., Witkowski, A., and Lyle, B. 1999. Introduction to OLAP function. Change proposal. ANS-NCTS H2-99-14 (April).



REVIEW

"Charles William Bash : Reviewer"

Structured query language (SQL) has been called overly simplistic since its original description, but it has been enhanced and elaborated upon over the years to become a very capable data programming language. The authors propose an additional ext  more...

Collaborative Colleagues:
Andrew Witkowski: colleagues
Srikanth Bellamkonda: colleagues
Tolga Bozkaya: colleagues
Nathan Folkert: colleagues
Abhinav Gupta: colleagues
John Haydu: colleagues
Lei Sheng: colleagues
Sankar Subramanian: colleagues