ABSTRACT
We propose a new multidimensional array query model giving array bounds and other shape-related metadata a central role. Arrays are treated as shaped maps from indices to values. Schemas are augmented by shape constraints. Queries also have shape preconditions. Within this framework, we introduce the index-based array queries expressing index reorganizations and value summarizations. We define them via adeclarative, rule-based language with shape-membership constraints inits rule bodies and subscripting and aggregation in its rule heads. We explore safety (including bounds analysis) and query equivalence for various subclasses divided according to the aggregator type, whether we allow disjunctions, and whether we allow (limited) Presburger arithmetic in index and shape terms. We show safety istractable in the nonarithmetic cases, while state safety remains in P in the arithmetic ones. We show that, for a class of monoid-based setand bag aggregators, equivalence reduces to equivalence of index-cores- core queries collecting array indices rather than values. Forset-aggregator queries, we give complete characterizations of equivalence in terms of containment maps and show the equivalenceproblems are in P in the nonarithmetic, conjunctive case and in coNP in all others.
- B. Allcock, I. Foster, et al. High-performance remote access to climate simulation data: A challenge problem for data grid technologies. In Parallel Computing, 29(10):1335--1356, 2003. Google Scholar
Digital Library
- P. Baumann. On the management of multidimensional discrete data. VLDB Journal, 4(3):401--444, 1994. Google Scholar
Digital Library
- P. Baumann, A. Dehmel et al. The multidimensional database system RasDaMan. In SIGMOD'98, pp.575--577. Google Scholar
Digital Library
- P. Baumann. A database array algebra for spatio-temporal data and beyond. In NGITS'99, pp. 76--93.Google Scholar
- M. Benedikt and L. Libkin. Safe constraint queries. In PODS'98, pp.99--108. Google Scholar
Digital Library
- L. Cabibbo and R. Torlone. Querying multidimensional databases. In DBPL'97. Google Scholar
Digital Library
- S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. SIGMOD Record, 26(1):65--74, Mar. 1997. Google Scholar
Digital Library
- S. Cohen. Containment of aggregate queries. SIGMOD Record, 34(1):77--85, Mar. 2005. Google Scholar
Digital Library
- S. Cohen, W. Nutt, and A. Serebrenik. Rewriting aggregate queries using views. In PODS'99, pp. 155--166. Google Scholar
Digital Library
- L. Fegaras and D. Maier. Optimizing object queries using an effective calculus. TODS, 25(4):457--516, 2000. Google Scholar
Digital Library
- E. Grädel. Subclasses of Presburger arithmetic and the polynomial-time hierarchy. TCS, 56:289--301, 1988. Google Scholar
Digital Library
- S. Grumbach, M. Rafanelli and L. Tininini. Querying aggregate data. In PODS'99, pp. 174--184. Google Scholar
Digital Library
- O. H. Ibarra and J. Su. On the containment and equivalence of database queries with linear constrants. In PODS'97, pp. 32--43. Google Scholar
Digital Library
- A. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146--160, 1988. Google Scholar
Digital Library
- K. Lellahi and V. Tannen. A calculus for collections and aggregates. In LNCS 1290: CTCS'97, pp. 261--280. Google Scholar
Digital Library
- L. Libkin, R. Machlin, and L. Wong A query language for multidimensional arrays: design, implementation, and optimization techniques. In SIGMOD'96, pp. 228--239. Google Scholar
Digital Library
- R. Machlin. Index-based multidimensional queries: safety and equivalence. (Available online at www.panix.com/¿rona.)Google Scholar
- D. Maier and B. Vance. A call to order. In PODS'93, pp. 1--16. Google Scholar
Digital Library
- A. Marathe and K. Salem. Query processing techniques for arrays. In SIGMOD'99, pp. 323--334. Google Scholar
Digital Library
- W. Nutt, Y. Sagiv, and S. Shurin. Deciding equivalences among aggregate queries. In PODS'98, pp. 214--223. Google Scholar
Digital Library
- W. Pugh A practical algorithm for exact array dependence analysis. CACM, 35(8):102--114, 1992. Google Scholar
Digital Library
- P. Revesz. Safe datalog queries with linear constraints. In CP'98, pp. 355--369.Google Scholar
- B. Scarpellini. Complexity of subcases of Presburger arithmetic. Trans. AMS, 284(1):203--218, 1984.Google Scholar
Cross Ref
- D. Toman and J. Chomicki. Datalog with integer periodicity constraints. J. Log.Prog. 35(3):263--290, 1998.Google Scholar
Cross Ref
- A. van Ballegooij, A. P. de Vries and M. Kersten. RAM: Array processing over a relational DBMS. Technical Report INS-R0301, CWI, March 2003.Google Scholar
- R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. In PODS'92, pp. 331--345. Google Scholar
Digital Library
- J. von zur Gathen and M. Sieveking. A bound on solutions of linear integer equalities and inequalities. Proc. AMS, 72(1):155--158, 1978.Google Scholar
Cross Ref
Index Terms
Index-based multidimensional array queries: safety and equivalence
Recommendations
Deciding equivalences among conjunctive aggregate queries
Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators count, count-distinct, min, max, and sum. Essentially, this class contains unnested SQL queries with the above aggregate ...
Equivalence of nested queries with mixed semantics
PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsWe consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection types. Using an encoding of nested objects as flat relations, we translate ...
Equivalence of SQL queries in presence of embedded dependencies
PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsWe consider the problem of finding equivalent minimal-size reformulations of SQL queries in presence of embedded dependencies [1]. Our focus is on select-project-join (SPJ) queries with equality comparisons, also known as safe conjunctive (CQ) queries, ...






Comments