4 results about "AVL tree" patented technology

The embodiment of the invention provides a polygon topology calculation method and system suitable for line segment intersection judgment of a GIS (Geographic Information System), and the method comprises the steps: obtaining spatial topology data of a designated region, and constructing an intersection point set based on the spatial topology data through a geometric verification method based on a dynamic tolerance and endpoint position relation; and sorting the intersection points in the set, and inserting the edges associated with the sorted points into the AVL Tree in a reverse order, and obtaining the polygon topology related data structure with the efficient retrieval and topology analysis capability after the insertion is finished. The implementation of the method can solve the problem that two line segments are in an intersection state in reality but do not have an intersection relationship in the calculation process, and finally, the two line segments are ensured to also intersect in the calculation process by setting the tolerance.

The invention particularly relates to a file system space management method and system, efficient management of a disk space is realized by constructing double AVL trees, each of the double AVL trees takes a disk segment as a node, the disk segment is defined through an initial position and an end position and follows a left-closed right-open rule, disk offset AVL trees are sorted according to the initial position, and idle length AVL trees are sorted according to the length. During space allocation, whether the maximum idle length of the idle length AVL tree meets the request allocation length or not is judged firstly, continuous spaces are allocated preferentially, and discontinuous spaces are combined when the maximum idle length is insufficient; and after allocation, synchronously deleting allocated disk segments in the double AVL trees and maintaining tree balance. And during space release, detecting the continuity of the to-be-released section and the existing idle section, merging or directly inserting a new idle section into the double AVL tree and keeping balance. The time complexity of space operation is optimized to O (logN), the storage overhead is greatly reduced, the file storage continuity is guaranteed, the read-write performance and the space utilization rate are improved, a large-capacity storage scene is adapted, and many defects of an existing Bitmap scheme are overcome.

The application relates to a file system space management method and system, and efficient management of disk space is realized by constructing double AVL trees, the double AVL trees are both taken as disk segments as nodes, the disk segments are defined by starting positions and ending positions and follow the left-closed right-open rule, wherein the disk offset AVL tree is sorted according to the starting positions, and the free length AVL tree is sorted according to the lengths. When space is allocated, whether the maximum free length of the free length AVL tree meets the requested allocation length is judged, continuous space is preferentially allocated, and non-continuous space is combined when the continuous space is insufficient; after the allocation, the allocated disk segments in the double AVL trees are synchronously deleted, and the tree balance is maintained. When space is released, the continuity of the to-be-released segment and the existing free segment is detected, the new free segment is combined or directly inserted into the double AVL trees, and the balance is maintained. The time complexity of the space operation is optimized to O(logN), the storage cost is greatly reduced, the file storage continuity is guaranteed, the read-write performance and the space utilization rate are improved, the large-capacity storage scene is adapted, and many defects of the existing Bitmap scheme are solved.