CN104598392A

CN104598392A - Method for realizing server cache structure by multi-stage Hash

Info

Publication number: CN104598392A
Application number: CN201310527807.6A
Authority: CN
Inventors: 不公告发明人
Original assignee: Nanjing Sirun Software Co Ltd
Current assignee: Nanjing Sirun Software Co Ltd
Priority date: 2013-10-31
Filing date: 2013-10-31
Publication date: 2015-05-06

Abstract

The invention relates to a method for realizing a server cache structure by multi-stage Hash, and can solve the problem of overmany server caches. At present, a computer application technology is penetrated into every walk of life, each industry has the own server, overmany caches exist in the servers, so that the operation efficiency of the server is low after a long time. By aiming at the problem of low working efficiency of the server due to serious caches in the server, the invention realizes a method for realizing the server cache structure by multi-stage Hash, a directory structure of the caches generated in a server operation process can be obtained, and then, the obtained directory structure of the caches of the server can be cleared.

Description

A kind of implementation method utilizing multistage Hash server buffer structure

Technical field

The present invention relates to a kind of implementation method utilizing multistage Hash server buffer structure.The invention belongs to field of computer technology.

Background technology

Current, computer technology has penetrated into often goes in every industry, and server network data transmit-receive does not do buffer memory with storing.If the significant data of company is stored in disk, and data have portion upgrade and have a large amount of access close to office's static but every day, do not do the high-performance that buffer memory can not play machine.Such as, usually, there is the server concentrating fixing model in intra-company, and often kind has its performance boundary, generally comprises but is not limited to CPU computing power, network interface card transmitting-receiving bag ability, memory size and disk size and his read or write speed.Multistage hash is namely relevant with memory size.Suppose that a dell server memory is 8G, if do buffer memory with multistage hash, so just can consider that to the capacity of buffer memory be 6G, namely 3/4 or 2/3 of general memory capacity consider the very big capacity being used as buffer memory.Certain server is certain business service, and simply think that the value of business is key-value form, usually, key has fixed size Ksize certainly, and value maximal value also has ultimate value Vsize_max.

Summary of the invention

The high performance problem that buffer memory can not play machine is not done for this, and as far as possible for company saves human cost, saves time, there is provided work more efficient, invention describes a kind of implementation method utilizing multistage Hash server buffer structure, meet the high-performance operating requirements of corporate server.Concrete steps are as follows:

Step 1: the time range of buffer memory is removed in setting.According to system need carry out the clear of server buffer, time range can be determine according to server time.

Step 2: priority assignation.In order to the security of Deterministic service device data, removing caching function must through authorizing.System manager can carry out right assignment to personnel.The user only having authority could carry out the removing of server buffer in the server.

Step 3: buffer memory is removed.After the logging in system by user had permission, click " removing server buffer " function, system is just automatic by the removing of server buffer, and limited rights user can according to the time selectively to the removing carrying out server buffer in server.。

Step 4: server removes caching record.User is to obtaining after the server buffer of coming removes, and system can the information such as time, operator of automatic record purge buffer memory.

Whether whether the method automatically record active user can remove server buffer in this month (or season, year).In addition, if method also provides the buffer memory needing to remove server just generation within certain time range, in order to avoid important information is eliminated.

Embodiment

Embodiment one

Use Microsoft Visual Studio 2012 as developing instrument, use special database management tools SQL Server on market to set up the database required for system.

1. carry out according to the needs of server the setting can removing server time scope, time range can be determine according to server time, and removing to keep server buffer can not be the up-to-date buffer memory running generation of server.

2. in order to the security of Deterministic service device CACHE DIRECTORY structure.It is need system authorization to use that server buffer removes function.

3., after the logging in system by user had permission, click " removing server buffer " function, system just automatic last time was removed after new generation buffer structure after go, the buffer memory that acquisition is come is according to rise time auto-sequencing.In operation, system can operate vestige by record automatically, records the record that this user removes server buffer.

4. user can carry out clear operation to server buffer according to actual needs.

In addition to the implementation, the present invention can also have other embodiments.All employings are equal to the technical scheme of replacement or equivalent transformation formation, all drop on the protection domain of application claims.

Claims

1. the significant data of company is stored in disk, and data are close to static but have local updating every day and have a large amount of access, do not do the high-performance that buffer memory can not play machine.

2. usually, there is the server concentrating fixing model in intra-company, often kind has its performance boundary, and generally comprise but be not limited to CPU computing power, network interface card transmitting-receiving bag ability, memory size and disk size and his read or write speed, multistage hash is namely relevant with memory size.

3. multistage hash just can realize two characteristics of server buffer above-mentioned, and the first, be cached with power-carrying; The second, each key-value unit have fixed size (Ksize+Vsize_max).

4. multistage hash line number is more, and its space availability ratio is higher, and right seek rate just slows down gradually; Otherwise line number is fewer, then multistage hash seek rate is faster, and right space availability ratio is low, so within line number should be controlled in 50 row, be generally advisable between 20 to 35 row.

5. insertion is provided in method, searches and deletion action.