A dynamic supervision system for housing security

Abstract

The invention discloses a housing security dynamic supervision system, comprising a rule element configuration module, a rule and detail configuration module, a matching network generation module, a rule matching module, and a matching result processing module; the rule element configuration module provides an application form for housing security objects. Configure and manage all the attributes contained in the data summary form; the rules and details configuration module configures the rules and details; the matching network generation module precompiles the rules and details configured by the rules and details configuration module, and precompiles them into The matching network is used for matching execution; the rule matching module returns the matching flow object by passing in the data object to be matched; the matching result processing module processes the matching flow object obtained by the rule matching module to obtain the matching result object. The invention reduces the workload and cost of research and development and testing personnel, and improves the generality and reusability of the system.

Description

technical field [0001] The invention relates to the field of housing security, in particular to a dynamic monitoring system for housing security. Background technique [0002] Under the conditions of a market economy, in order to ensure that everyone has a house to live in, the state implements some special policies and measures to help groups that rely solely on the market to solve housing difficulties. The general term for this policy system is called the housing security system. In order to facilitate the implementation of the housing security system by housing security centers in various provinces and cities, our company has developed a housing security system to manage security objects, security resources, and security methods. [0003] In the process of applying to become a security object, in order to identify whether the applicant and the family are a group with housing difficulties that meet the local policies, two rule matching tests are designed. Only after the a...

AI Technical Summary

Problems solved by technology

[0007] In this matching method, the nested loop of matching rules and matching items requires matching calculations (number of matching items X number of matching rules) times for each matching. If there are 10 matching items, 10 matching rules are configured, that is, each matching It needs to be calculated 100 times, and the specific matching calculation of each preset matching item is independently hard-coded, and it is necessary to judge whether the matching item can be used for the first validation when performing the first validation; due to local housing in specific cities and districts The insurance policy is unique, the number of matching items and variability is small, and the number of rules used for configuration is small. It is barely available when it is only used by a city or district-level residential insurance center. However, the slow matching process leads to poor user experience. In order to adapt to the change of the housing insurance policy during the maintenance process, it is necessary to directly modify the matching item matching calculation hard-coded code, which will increase the workload of R & D and testing personnel, and easily affect the stability of the system; when other urban housing insurance centers need to use this For the housing security system, due to differences in security policies in different regions, it is necessary to match the entire rule matching module and reconstruct it according to local policies; when the Provincial Housing Security Center carries out housing security management business at the provincial level, take Sichuan Province as an example, Sichuan There are about 21 cities (prefecture-level administrative regions) and 213 districts and counties in the province. Assuming that only the housing insurance policy of each city is different, the districts and counties under the city are implemented according to the municipal-level security policy, and a city is configured with 10 matching rules. There will be a total of 210 matching rules, assuming that there are only 10 matching items in the whole province (actually due to different policies in different regions, the matching items will be different and cannot be unified, and the number will be more), one matching needs to be calculated 210X10=2100 times , regardless of concurrent applications, only a single matching calculation consumes a lot of server performance. If there are many matching rules and matching items, the rule matching verification request will time out and the matching verification will fail.

[0008] To sum up, the existing matching calculation methods have low matching efficiency, bloated implementation code, poor versatility and scalability, and weak maintainability, reusability and portability.

Images