On the relational database type numerical programming

The numerical algorithms have become quite complex and require dynamic data structures with fast searching and modification facilities. The advanced front algorithm is a well-known and efficient algorithm of the non-structural mesh generation. We present an accelerated version of this algorithm as an example to demonstrate, that a simplified relational database model is an efficient tool for handling dynamic data structures arising from numerical problems. The main advantage of the presented technique is the simple and uniform data structure and the application of the balanced trees for searching and modification.