Dynamic tree structured directory retrieval method in BS (browser/server) structure software
A technology of directory retrieval and dynamic tree, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as multi-tasking
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0034] In the JSON-based dynamic tree structure fast directory retrieval method in the BS structure software of the present invention, the core problem is how to construct a tree efficiently according to the retrieval conditions, and the algorithm adopted by the present invention is as follows:
[0035] 1) Take out the tree node information.
[0036] Use the traditional SQL statement query method to interact with the database to obtain all tree-shaped directory information;
[0037] 2) Data cache.
[0038] Due to the need to quickly construct a tree according to the search conditions, the tree node information must not be loaded by frequent access to the database. One is to reduce the pressure on the database, and the other is to save time for interacting with the database. Therefore, the java heap memory technology is used to cache the data for the data source:
[0039] The Java virtual machine has a heap (Heap), which is the runtime data area, and the memory of all class i...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
