40 results about "AVL tree" patented technology

A Session Cache method based on binary balance tree includes using front tree to store all nodes generated at former time slot and using back tree to store all nodes generated at later time slot, judging whether all nodes stored on said tree are expired or not by comparing ratio of said nodes setting-up time to their current time when node is searched and deleting off node stored on the tree if node stored on the tree is expired.

The invention discloses a position privacy protection method in a sign-in service, which encrypts each user's sign-in record and numbers each sign-in node through k-anonymously generated position sets, so as to maintain the sign-in chain and protect position privacy for users ; At the same time, increase location privacy protection by adding fake sign-in nodes, and distinguish real sign-in nodes from fake sign-in nodes through the sign bits corresponding to sign-in record ciphertexts. In addition, a header table and Hash table, so that the node numbers contained in the header table and the hash table are the latest node numbers signed by the user and their corresponding decryption keys; in this way, by directly decrypting the ciphertext in the hash table, you can get all Check-in records, and at the same time, by searching the AVL tree, you can get all the friends who have checked in at a specific place and their corresponding head table line numbers, and decrypt the head table to get all the check-in records at a specific place. Therefore, it is also possible to provide two retrieval methods Improve location privacy protection requirements.

The invention discloses a searching and storing method for an embedded database. When an embedded system is under an off-line mode, the method comprises the following steps: external high-speed equipment is used for data organization and storage, a data file is set up and the recording is kept, an index file is kept, index information is kept in an AVL tree node, and finally, a database file is downloaded to embedded equipment for use. When the embedded system is under the off-line mode, the method comprises the following steps: searching AVL tree in the index file through keywords, obtaining the index information, so as to obtain the recording of the date file, or insert newly built tree node into an AVL tree, and keep the index information and the recording. The method provided by the invention fully uses optimization process of the external high-speed equipment according to the characteristics of the resource of date and uses the technologies such as a hash table and AVL three for data organization and storage, and the method provided by the invention has the benefits of less resource consumption and high searching efficiency, and can be used in embedded systems with limited resources.

The invention discloses a wireless sensor network key management method. The method comprises the steps that a base station distributes public and private key pairs to all sensor nodes according to set parameters, cluster head nodes are elected from all the sensor nodes, the elected cluster head nodes send information to the surrounding sensor nodes, the surrounding sensor nodes select the cluster head nodes of their own according to the information so that clusters can be formed, the base station generates a self-balancing binary search tree (AVL tree) of the in-cluster sensor nodes for all the clusters to generate the in-cluster sensor nodes, and the in-cluster sensor nodes inquire the information of the other sensor nodes according to the AVL tree, exchange information, mutually authenticate the legality of the public keys, and share the session keys after the authenticating is successful. According to the method, the AVL tree mode is utilized for storing the public keys and the identity information, the searching time is shortened, and the consumption is reduced; an elliptical curve password system is utilized for achieving key distribution and management, the higher safety of the network can be ensured, and the calculation expenditure can be reduced to the greatest extent.

The present invention relates to a BitMap high-speed fuzzy search method, which includes: software establishment and distribution of rule entries: the required five-tuple combination is divided into AVL trees; each AVL tree has the highest priority according to the exact matching, and the fuzzy matching accuracy is higher The higher the priority, the higher the principle of storing rule nodes, and the blocks are arranged linearly according to the priority; according to the priority, the Bitmap lookup table is established, and the five-tuple information is divided to establish a search index; when updating the Bitmap, it needs to be matched according to the mask Various combinations; generate an index key based on the rule entry information, and then divide it into multiple sub-keys; look up the table based on the index key for the five-tuple of IP network packets. The invention improves the table writing and table lookup mode of the content fuzzy lookup mode, saves logic resources, improves logic processing speed, and simultaneously expands multiple instantiations in a modularized manner, resources can be estimated, is convenient and quick, and reduces design risks.