SQL and its variant TSQL have been controversial. Although SQL is mainly considered a data query language, some people think that their expression ability surpasses this limited range.

Andrew GIERTH in a set of slides, it is convincing that SQL can achieve Turing completeability even if SQL does not extend such as PL/SQL or PSM. He proves this by using a public expression (CTE) and window functions in SQL to prove this in SQL. CTE allows users to create self -referenced name expressions to achieve recursive problems solve. This function is possibly opened for the complexity of computing that is usually not related to SQL.

Significance and influence

It must be noted that the completeness of the SQL Turing is not interested in designing. The introduction of CTE is to enhance the performance of the language declaration, rather than transforming it into a general programming language similar to C.

This understanding highlights the profound computing power that may generate in the seemingly simple structure. SQL's recursion capacity through CTE releases the expression similar to Turing's complete system. actual application

Although it may be unrealistic to write a compiler with SQL, the theoretical significance of the Turing's completeness is worthy of attention. This shows that SQL may solve a wider computing problem than previously thought. From Mandebrow's visualization to complex mathematical simulation, the possibility of SQL -based solutions surpass traditional data query and operation.