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

Session cache method based on binary balance tree

A binary balanced tree and binary tree technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem that expired nodes cannot be effectively deleted, and achieve the effect of saving memory and using memory effectively

Active Publication Date: 2007-12-19
苏州海加网络科技股份有限公司
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The purpose of the present invention is to provide a kind of SessionCache method based on binary balanced tree. This method combines the characteristics of AVL tree, is used for solving in the server, often encounters the expired node that causes because of the validity judgment that has time limit Problems that cannot be effectively deleted

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
  • Session cache method based on binary balance tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] In order to make the technical means, creative features, goals and effects achieved by the present invention easy to understand, the present invention will be further described below in conjunction with specific embodiments.

[0015] A SessionCache method based on a binary balanced tree. This method uses two binary trees to save nodes. According to time as nodes, all the saved nodes of the entire SessionCache are divided into two sections according to the time period. The first tree saves For all the nodes generated in the previous period, the latter tree stores all the nodes generated in the later period; for example: suppose the expiration time of the entire SessionCache is 5 minutes, so the first tree will save the data of the previous 5 minutes , after 5 minutes, the data will be saved in another tree, so that the nodes of the two time periods are divided into two trees from the perspective of time division. Therefore, assuming that the node generated in the 11th min...

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

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.

Description

technical field [0001] The invention relates to the technical field of computer software, in particular to a SessionCache method, in particular to a Binary Balance Tree-based SessionCache method. Background technique [0002] In server design, various time-related validity judgments are often encountered. For example, the valid Session obtained when a user logs in to a web page can only be valid within a certain time range, and must be cleared after a certain time. [0003] How to check whether the session is still valid, and delete the invalid session, usually in the following ways: [0004] 1. Hash table (hash table) [0005] The method adopted in this method is to use the index as the keyword of Search, so that the node can be quickly found, and at the same time, the creation time of the node is saved in the node, so that when the search finds the data stored in the node, the node can be The validity (mainly time validity) is judged, and the Hash algorithm has the faste...

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): G06F9/44G06F17/30
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