Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and system for realizing use of interprocess AVL (Self-Balancing Binary Search Tree) tree

An AVL tree, inter-process technology, applied in the field of AVL algorithm, can solve the problem that the operating system cannot be used

Inactive Publication Date: 2018-02-02
杭州吉吉知识产权运营有限公司
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The technical problem to be solved by the present invention is to provide a method and system for realizing the use of inter-process AVL trees, so as to solve the problem that the operating system of the existing AVL tree cannot be used between processes

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for realizing use of interprocess AVL (Self-Balancing Binary Search Tree) tree
  • Method and system for realizing use of interprocess AVL (Self-Balancing Binary Search Tree) tree
  • Method and system for realizing use of interprocess AVL (Self-Balancing Binary Search Tree) tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0045] This embodiment provides a method for implementing the use of AVL trees between processes, such as figure 2 shown, including steps:

[0046] S11: Allocate the values ​​of the AVL tree nodes among the processes in sequence;

[0047] S12: Determine the index value of the inter-process AVL tree node in order;

[0048] S13: Create a shared memory according to the value and index value of the AVL node between processes;

[0049] S14: Map the shared memory to the local process address space of each process;

[0050] S15: Manage the left child node of the inter-process AVL tree through the lchild value; the lchild value corresponds to the index value of the left child node;

[0051] S16: Manage the right child node of the inter-process AVL tree through the rchild value; the rchild value corresponds to the index value of the right child node.

[0052] This embodiment does not modify the traditional AVL tree search, insertion, and deletion algorithms, but only improves the ...

Embodiment 2

[0087] This embodiment provides a system for realizing the use of AVL trees between processes, such as Figure 5 shown, including steps:

[0088] The allocation module 21 is used for sequentially allocating the values ​​of the AVL tree nodes between the processes;

[0089] The numbering module 22 is used to determine the index value of the inter-process AVL tree node in sequence;

[0090] The establishment module 23 is used for establishing the shared memory according to the value and the index value of the AVL node between the processes;

[0091] The mapping module 24 is used for mapping the shared memory to the local process address space of each process;

[0092] The left pointer module 25 is used to manage the left child node of the inter-process AVL tree through the lchild value; the lchild value corresponds to the index value of the left child node;

[0093] The right pointer module 26 is used to manage the right child node of the inter-process AVL tree through the rc...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method and a system for realizing the use of an interprocess AVL (Self-Balancing Binary Search Tree) tree, and is used for solving the problem that an existing AVL tree operating system can not be used among processes. The method comprises the following steps that: S1: distributing the value of an interprocess AVL tree node in sequence; S2: according to the sequence, determining the index value of the interprocess AVL tree node; S3: according to the value and the index value of the interprocess AVL tree node, establishing shared memory; and S4: mapping the shared memory to the local process address space of each process. By use of the method, the index value of the shared memory is used for managing a left subnode and a right subnode to replace a situation that atraditional pointer manages the left subnode and the right subnode, and each node is managed by the AVL tree among the processes.

Description

technical field [0001] The present invention relates to the technical field of AVL algorithms, in particular to a method and system for realizing the use of AVL trees between processes. Background technique [0002] In computer science, AVL trees are the first self-balancing binary search trees to be invented. The maximum difference in height between the two subtrees of any node in an AVL tree is one, so it is also called a height-balanced tree. [0003] AVL tree lookups, insertions and deletions are O(log n) on average and worst case. Additions and deletions may require one or more tree rotations to rebalance the tree. AVL tree is an efficient data structure and is widely used. [0004] However, since the AVL tree uses "pointers" to manage the left and right child nodes, and in modern operating systems, the address spaces of each process are independent, which means that "pointers" are invalid between processes, so the AVL tree in the prior art cannot be used in used be...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/22G06F16/2246
Inventor 葛世飞
Owner 杭州吉吉知识产权运营有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com