A general algorithm for the distributing and dispatching of web database system
Lian Shi-you · 2005
Distributing and dispatching is a kind of difficult problem and some are even NPC problems. Therefore, it is more difficult to solve this kind of problems and generally the technology of AND-OR graph search is used to solve them. This results in some difficulties in programming the distributing and dispatching program in web database systems. In the paper, with the distribution of student graduation design tasks being taken as an example, a general algorithm is given which can solve a kind of distributing and dispatching problem with the restraining condition of each other choosing. This algorithm does not involve complex data structures and searching process, it is only described by the table operations of relation database, and it can be realized through programming in any language which supports Web database.