DBMS: Recursion (Definitions)

 "Occurs when one process calls itself to run again. With triggers, it's the process of a trigger firing itself. Indirect recursion is where an update to Table1 fires a trigger that affects Table2 that fires a trigger that updates Table1 again. Direct recursion is where an update to Table1 fires a trigger that affects Table1 again that fires the trigger again." (Darril Gibson, "MCITP SQL Server 2005 Database Developer All-in-One Exam Guide", 2008)

"Recursion is a method of defining functions, CTEs, procedures, or triggers in such a way that they call themselves or cause themselves to be called multiple times." (Michael Coles, "Pro T-SQL 2008 Programmer's Guide", 2008)

"When a function calls itself as part of its computation. A termination condition is required to prevent an infinite recursion. See also tail-call recursion." (Dean Wampler & Alex Payne, "Programming Scala", 2009)

"The process of a method calling itself." (Rod Stephens, "Stephens' Visual Basic® Programming 24-Hour Trainer", 2011)

"When a function calls itself as part of its computation. A termination condition is required to prevent an infinite recursion. You can also have cycles of recursion between two or more functions. See also tail-call recursion." (Dean Wampler, "Functional Programming for Java Developers", 2011)

"Recursion is a method of defining functions, CTEs, procedures, or triggers in such a way that they call themselves or cause themselves to be called multiple times." (Jay Natarajan et al, "Pro T-SQL 2012 Programmer's Guide 3rd Ed", 2012)

"The act of a function being re-entered while an instance of the function is still active in the same thread of execution. In the simplest and most common case, a function directly calls itself, although recursion can also occur between multiple functions. Recursion is supported by storing the state for the continuations of partially completed functions in dynamically allocated memory, such as on a stack, although if higher-order functions are supported a more complex memory allocation scheme may be required. Bounding the depth of recursion can be important to prevent excessive use of memory." (Michael McCool et al, "Structured Parallel Programming", 2012)

"The art of defining something (at least partly) in terms of itself, which is a naughty no-no in dictionaries but often works out okay in computer programs if you’re careful not to recurse forever (which is like an infinite loop with more spectacular failure modes)." (Jon Orwant et al, "Programming Perl, 4th Ed.", 2012)

"When a function or method calls itself. In mathematical terms, this is when a function is defined in terms of itself." (Mark C Lewis, "Introduction to the Art of Programming Using Scala", 2012)

"the act of defining a function in terms of itself." ( Manish Agrawal, "Information Security and IT Risk Management", 2014)

"The type of relationship where part of the definition makes a reference to the item being defined" (Daniel Linstedt & W H Inmon, "Data Architecture: A Primer for the Data Scientist", 2014)

"A method of defining functions, common table expressions, procedures, or triggers in such a way that they call themselves or cause themselves to be called multiple times." (Miguel Cebollero et al, "Pro T-SQL Programmer’s Guide 4th Ed", 2015)

"The ability of an algorithm to call itself" (Nell Dale & John Lewis, "Computer Science Illuminated" 6th Ed., 2015)

"A process in which a problem is broken down into one or more self-similar subproblems, which are then also similarly broken down, until one reaches a base case where the solution is well-defined, often by definition." (O Sami Saydjari, "Engineering Trustworthy Systems: Get Cybersecurity Design Right the First Time", 2018)