全面了解数据库设计中分类算法（Comprehensive understanding of classification algorithms in database design）.docVIP

全面了解数据库设计中分类算法（Comprehensive understanding of classification algorithms in database design） Problems to be solved by classification algorithms In the construction of websites, the application of classification algorithms is very common. In the design of an electronic store, involves the classification of goods; in the design of distribution system, involves the column or channel classification; download this program in software design, involves software classification and so on. It can be said that classification is a very common problem. I often interview some programmers, and I almost ask them questions about classification algorithms almost without exception. Here are a few questions I often ask. Do you think you can answer it easily? 1, classification algorithms are often represented by tree representation and traversal problems. So, if you use a Table in the database to represent tree classification, how many fields should there be? 2, how can you quickly restore a tree from this Table? 3, how do you decide whether a category is a subclass of another category? 4, how to find a classification of all products? 5, how to generate the classification of the path?. 6, how to add new categories? These questions are not easily answered without restricting the progression of the classification and the number of each class. This paper tries to solve these problems. Classified data structure We know that the classified data structure is actually a tree. In the data structure course, you may have learned the Tree algorithm. Since we use databases extensively in our website construction, we will start with the storage of Tree in the database. To simplify the problem, we assume that each node only needs to retain the Name information. We need to make a number for each node. There are many ways of numbering. Often used in databases is automatic numbering. This is true in Access, SQL, Server, and Oracle. Suppose the number field is ID. To indicate that a node ID1 is the parent