Studies On Data Warehouse And Data Mining And The Application In Police Information Construction

In this dissertation, some optimum methods are presented by means of dynamic programming method, according to the development of technology for data mining and data warehouse and the characteristic of police information. The main achievements are as follow: 1. This dissertation put forward the police model of data warehouse and data mining. It is also put forward the police model of data mining based on data warehouse. Furthermore, their structure and function are also discussed. 2. The resource of computer network for data warehouse is optimized by means of dynamic programming method. The calculation complexity which is the planar resource distribution of computer LAN&WAN for data warehouse is reduced by means of Lagrange multiplication. The data relationships are analyzed for data warehouse and data mining. The problem that whether these relationships are by chance or inevitability,and how about their degrees in relationship are analyzed. Some optimum methods are obtained by dynamic programming method and complexity of analyzing in course is avoided。3. In order that the total expectation wage reach to maximum during establishing data warehouse, the process of data join carry and the scheme of data processing for workstation are optimized using dynamic programming method in which data need to be integrated from varying apply systems. The data capacity of data warehouse management and storage is greatly increased in network environment. This problem is solved by SAN(Storage Area Network),and the configuration is optimized by dynamic programming method to meet stochastic requirement。4. The data warehouse and its data renewed policy are optimized by dynamic programming method when the data lay out or local deformity in using data warehouse. A sort of rather special dynamic programming method ------arithmetic of transfer close package is adopted to optimize the problem which judge whether a path exist and seek least cost path between a couple of random nodes in intellectual integrating data warehouse information. 5. Two important aspects of data warehouse integration are supplying policy and stocking policy for information resource of data warehouse. These are optimized by dynamic programming method. Aiming at the problems of the data mining sequence of data warehouse and the improvement of data mining, some optimizing policies are gained based on dynamic programming method. 6. Some practice applications for the police model of data warehouse and data mining are put forward based on dynamic programming method.