Vector and matrix operations programmed with udfs in a relational dbms

In general, a relational DBMS provides limited capabilities to perform multidimensional statistical analysis, which re-quires manipulating vectors and matrices. In this work, we study how to extend a DBMS with basic vector and matrix operators by programming User-Dened Functions (UDFs). We carefully analyze UDF features and limitations to imple-ment vector and matrix operations commonly used in statis-tics, machine learning and data mining, paying attention to DBMS, operating system and computer architecture con-straints. UDFs represent a C programming interface that allows the denition of scalar and aggregate functions that can be used in SQL. UDFs have several advantages and lim-itations. A UDF allows fast evaluation of arithmetic expres-sions, memory manipulation, using multidimensional arrays and exploiting all C language control statements. Neverthe-less, a UDF cannot perform disk I/O, the amount of heap and stack memory that can be allocated is small and the UDF code must consider specic architecture characteris-tics of the DBMS. We experimentally compare UDFs and SQL with respect to performance, ease of use, exibility and scalability. We prole UDFs based on call overhead, memory management and interleaved disk access. We show UDFs are faster than standard SQL aggregations and as fast as SQL arithmetic expressions