Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Foundations of Aggregation Constraints
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Hypothetical Queries in an OLAP Environment
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Querying Multiple Features of Groups in Relational Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
QC-trees: an efficient summary structure for semantic OLAP
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Depth-first search and linear grajh algorithms
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Parallel SQL execution in Oracle 10g
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Data densification in a relational database system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Vertical and horizontal percentage aggregations
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Horizontal aggregations for building tabular data sets
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Advanced SQL modeling in RDBMS
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Bridging the gap between OLAP and SQL
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimizing refresh of a set of materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A formal characterization of PIVOT/UNPIVOT
Proceedings of the 14th ACM international conference on Information and knowledge management
Integrating K-Means Clustering with a Relational DBMS Using SQL
IEEE Transactions on Knowledge and Data Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Cost-based query transformation in Oracle
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Vector and matrix operations programmed with UDFs in a relational DBMS
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Using grouping variables to express complex decision support queries
Data & Knowledge Engineering
Building statistical models and scoring with UDFs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Business modeling using SQL spreadsheets
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Symmetric relations and cardinality-bounded multisets in database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
PIVOT and UNPIVOT: optimization and execution strategies in an RDBMS
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Implementing logic spreadsheets in less
The Knowledge Engineering Review
IEICE - Transactions on Information and Systems
Enhanced subquery optimizations in Oracle
Proceedings of the VLDB Endowment
Fast UDFs to compute sufficient statistics on large data sets exploiting caching and sampling
Data & Knowledge Engineering
An efficient sheet partition technique for very large relational tables in OLAP
BNCOD'07 Proceedings of the 24th British national conference on Databases
Spreadsheet as a relational database engine
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
ASSET queries: a declarative alternative to MapReduce
ACM SIGMOD Record
θ-Constrained multi-dimensional aggregation
Information Systems
Supporting real-time supply chain decisions based on RFID data streams
Journal of Systems and Software
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
A framework and a language for on-line analytical processing on graphs
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Automatic web spreadsheet data extraction
Proceedings of the 3rd International Workshop on Semantic Search Over the Web
Can we analyze big data inside a DBMS?
Proceedings of the sixteenth international workshop on Data warehousing and OLAP
Hi-index | 0.00 |
One of the critical deficiencies of SQL is lack of support for n-dimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications have to emulate them using joins, recently introduced SQL Window Functions [18] and complex and inefficient CASE expressions. The designated place in SQL for specifying calculations is the SELECT clause, which is extremely limiting and forces the user to generate queries using nested views, subqueries and complex joins. Furthermore, SQL-query optimizer is pre-occupied with determining efficient join orders and choosing optimal access methods and largely disregards optimization of complex numerical formulas. Execution methods concentrated on efficient computation of a cube [11], [16] rather than on random access structures for inter-row calculations. This has created a gap that has been filled by spreadsheets and specialized MOLAP engines, which are good at formulas for mathematical modeling but lack the formalism of the relational model, are difficult to manage, and exhibit scalability problems. This paper presents SQL extensions involving array based calculations for complex modeling. In addition, we present optimizations, access structures and execution models for processing them efficiently.