RAM: array processing over a relational DBMS

Developing multimedia applications in relational databases is hindered by a mismatch in computational frameworks. Efficient manipulation of multimedia data calls for array-based processing, which at best is available as a database add-on, not supported by the query optimizer. As a result, array-based processing ends up in dedicated programs outside the DBMS: non-reusable black boxes. The goal of our research is to reduce this gap between user-needs and system functionality by developing a seemless integration of array processing in a relational algebra engine. The paper introduces a declarative language for array-expressions based on the array comprehension, and its mapping to a relational kernel in a prototype implementation. The layered architecture of the resulting array database management system allows the use of structural knowledge available in the array data type. This additional source of information can be exploited for query optimization, which is demonstrated with a case study. The experiments show how the performance of a standard tool for matrix computations can be achieved without sacrificing data independence, highlighting however a critical aspect in the DBMS architecture proposed.

[1]  Djoerd Hiemstra,et al.  Lazy Users and Automatic Video Retrieval Tools in (the) Lowlands , 2001, TREC.

[2]  Peter Baumann,et al.  A Database Array Algebra for Spatio-Temporal Data and Beyond , 1999, NGITS.

[3]  Dan Suciu,et al.  Comprehension syntax , 1994, SGMD.

[4]  Niels Nes,et al.  Image database management systems design considerations algorithms and architecture , 2000 .

[5]  David Maier,et al.  A call to order , 1993, PODS '93.

[6]  Luca Cabibbo,et al.  A Logical Approach to Multidimensional Databases , 1998, EDBT.

[7]  Kenneth Salem,et al.  A Language for Manipulating Arrays , 1997, VLDB.

[8]  Panos Vassiliadis,et al.  Modeling multidimensional databases, cubes and cube operations , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[9]  Timos K. Sellis,et al.  A survey of logical models for OLAP databases , 1999, SGMD.

[10]  Peter Baumann,et al.  Storage of multidimensional arrays based on arbitrary tiling , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[11]  Martin L. Kersten,et al.  A Multi-query Optimizer for Monet , 2000, BNCOD.

[12]  Martin L. Kersten,et al.  Flattening an object algebra to provide performance , 1998, Proceedings 14th International Conference on Data Engineering.

[13]  Djoerd Hiemstra,et al.  A Probabilistic Multimedia Retrieval Model and Its Evaluation , 2003, EURASIP J. Adv. Signal Process..

[14]  Peter Boncz,et al.  UvA-DARE ( Digital Academic Repository ) Monet ; a next-Generation DBMS Kernel For Query-Intensive Applications , 2007 .

[15]  Trenchard More,et al.  Axioms and Theorems for a Theory of Arrays , 1973, IBM J. Res. Dev..

[16]  MoreTrenchard.  Axioms and theorems for a theory of arrays , 1973 .

[17]  Martin L. Kersten,et al.  MIL primitives for querying a fragmented world , 1999, The VLDB Journal.

[18]  Setrag Khoshafian,et al.  A decomposition storage model , 1985, SIGMOD Conference.

[19]  Limsoon Wong,et al.  A query language for multidimensional arrays: design, implementation, and optimization techniques , 1996, SIGMOD '96.

[20]  Nes.  UvA-DARE ( Digital Academic Repository ) Image database management systems design considerations algorithms and architecture , 2007 .