Computing desk
< July 26	<< Jun \| July \| Aug >>	July 28 >

Welcome to the Wikipedia Computing Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.

July 27

Fast Fourier transform

Can a relational database, with its set of rows and columns, support the computerization of the Fast Fourier transform ? Afrazer123 (talk) 04:40, 27 July 2024 (UTC)[reply]

No. The FFT algorithms require computations based on the indices. This is not supported by relational databases. The notion of index is in fact alien to the relational model, which is essentially an unordered set of tuples (the rows) of named values (as identified by the row names). One can add the index as a key, basically an extra column, but this does not help. The SQL-type languages that come with such databases also do not support the recursion used by FFT algorithms. --Lambiam 13:18, 27 July 2024 (UTC)[reply]

Thanks for the reply. How pulsating! It seems there's a discharge of some sort which apparently isn't taken into consideration by the RDB while using an extra column (key) only exacerbates things. Also, SQL appears to be to confining, off-limits for the algorithm's recursion. Afrazer123 (talk) 02:09, 28 July 2024 (UTC)[reply]