| In my book SQL For Smarties 2nd edition (Morgan-Kaufmann, 2000),
I wrote a chapter on a programming technique for representing trees and
hierarchies in SQL as nested sets. This technique has become popular enough
that I have spent almost every month since SQL For Smarties was released
explaining the technique in Newsgroups and personal emails. And people who
have used it have been sending me emails with their programming tricks. Oh,
I will still have a short chapter or two on trees in any future edition of SQL for
Smarties, but this topic is worth this short monograph.
The first section of the book is a bit like an introductory college textbook on
graph theory, so you might want to skip over it, if you are current on the
subject. If you are not, then the theory there will explain some of the
constraints that appear in the SQL code later. The middle sections deal with
programming techniques and the end sections deal with related topics in
computer programming. |
|
|
 A First Course in Mathematical Modeling
Offering a solid introduction to the entire modeling process, A FIRST COURSE IN MATHEMATICAL MODELING, 5th Edition delivers an excellent balance of theory and practice, and gives you relevant, hands-on experience developing and sharpening your modeling skills. Throughout, the book emphasizes key facets of modeling, including creative and... |  | Foundations of Robotics: Analysis and Control
Foundations of Robotics presents the fundamental concepts and methodologies for the analysis, design, and control of robot manipulators. It explains the physical meaning of the concepts and equations used, and it provides, in an intuitively clear way, the necessary background in kinetics, linear algebra, and control theory.... | | Automatentheorie und Logik (eXamen.press) (German Edition)
Das Buch beschäftigt sich mit der Theorie endlicher Automaten und den klassischen Resultaten wie den Sätzen von Richard Büchi und Michael Rabin. Die vier Teile des Buchs sind den unterschiedlichen Strukturen gewidmet: endliche Wörter, Bäume, endliche und unendliche Bäume. Jeder Teil endet mit Übungsaufgaben... |
|
