CN106339183A - Data retrieving method and server - Google Patents
Data retrieving method and server Download PDFInfo
- Publication number
- CN106339183A CN106339183A CN201610749786.6A CN201610749786A CN106339183A CN 106339183 A CN106339183 A CN 106339183A CN 201610749786 A CN201610749786 A CN 201610749786A CN 106339183 A CN106339183 A CN 106339183A
- Authority
- CN
- China
- Prior art keywords
- internal memory
- data object
- heap
- server
- unique mark
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/062—Securing storage systems
- G06F3/0623—Securing storage systems in relation to content
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0662—Virtualisation aspects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0674—Disk device
- G06F3/0676—Magnetic disk device
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data retrieving method and a server and aims to solve the technical problem of on-heap memory overflow of a JVM server during retrieving data. The method comprises the following steps: obtaining keywords for retrieving; and retrieving data objects in pages in a memory device according to the keywords, wherein the operations performed for each page of data objects are as follows: successively storing unique identifiers of the data objects with the keywords in an on-heap memory; storing the unique identifiers stored in the on-heap memory in an off-heap memory when the number of the unique identifiers stored in the on-heap memory reaches a threshold value, and deleting the unique identifiers stored in the on-heap memory. The method and the server are used for retrieving data.
Description
Technical field
The present invention relates to field of data retrieval, in particular it relates to a kind of method of data retrieval and server.
Background technology
Jvm (java virtual machine, java virtual machine) is a kind of specification for computing device, and it is one
Fabricate computer out, be to be realized by the various computer function of analogue simulation on actual computer.Large-scale
Service platform in, inside there may be a large amount of jvm servers, for being monitored to the application of this platform, collect all kinds of should
With the data producing, and by being analyzed to Various types of data, when the behavior finding application do not meet expected or when abnormal occur
Alert in time, so that attendant is processed to problem, fix a breakdown or potential problem.
In prior art, when data that jvm server stores in disk enters line retrieval, it is to meet all in disk
In internal memory in the heap of data Cun Chudao jvm server of condition, because the capacity of internal memory in the heap of jvm is less, therefore, to big
When data enters line retrieval, easily cause internal memory and overflow.
Content of the invention
It is an object of the invention to provide a kind of method of data retrieval and server, in order to solve jvm clothes during data retrieval
The technical problem that in the heap of business device, internal memory overflows.
To achieve these goals, first aspect present invention, provides a kind of data retrieval method, and methods described is applied to transport
The server of row java virtual machine jvm, described server includes internal memory and out-pile internal memory in the heap of jvm, and methods described includes:
Described server obtains the keyword of retrieval；
According to described keyword, in storage device, data object is retrieved in paging, wherein, for the execution of every page data object
Hereinafter operate:
The unique mark with the data object of described keyword is stored in internal memory in described heap successively；Wherein, institute
State unique mark for directly inquiring about corresponding data object in described storage device；
When the described uniquely identified number of storage in internal memory in described heap reaches threshold value, will deposit in internal memory in described heap
The described unique mark of storage is stored in described out-pile internal memory, and deletes the described unique mark of storage in internal memory in described heap.
Alternatively, n data object of every page of inclusion in described storage device；
When the described described uniquely identified number when storage in internal memory in described heap reaches threshold value, by internal memory in described heap
The described unique mark of middle storage is stored in described out-pile internal memory, comprising:
After paging retrieves the n data object with described keyword, by the described n number in internal memory in described heap
It is stored in described out-pile internal memory according to the unique mark of object.
Alternatively, methods described also includes:
Read n data object in described storage device according to the n in described out-pile internal memory described unique mark；
Load and show described n data object.
Alternatively, before according to described keyword paging retrieval data object in storage device, methods described is also wrapped
Include:
Paging is carried out to all of data object in described storage device.
Alternatively, methods described also includes:
The memory space of described server is divided, to distribute the memory space of described out-pile internal memory.
Second aspect, provides a kind of server, and described server runs java virtual machine jvm, and described server includes jvm
Heap in internal memory and out-pile internal memory, described server also includes:
Acquiring unit, for obtaining the keyword of retrieval；
Retrieval unit, for according to described keyword in storage device paging retrieval data object；
Memory cell, for the data object by having described keyword unique mark store successively interior in described heap
In depositing；Wherein, described unique mark is used in described storage device directly inquiring about corresponding data object；
Determining unit, the described uniquely identified number for determining storage in internal memory in described heap reaches threshold value；
Described memory cell is additionally operable to, and the described unique mark of storage in internal memory in described heap is stored in described out-pile
Deposit；
Delete unit, for deleting the described unique mark of storage in internal memory in described heap.
Alternatively, n data object of every page of inclusion in described storage device；
Described determining unit is used for, and determines that described retrieval unit paging retrieves the n data pair with described keyword
As；
Described memory cell is used for, and the unique mark of the described n data object in internal memory in described heap is stored in described
In out-pile internal memory.
Alternatively, also include:
Reading unit, for reading the n in described storage device according to the n in described out-pile internal memory described unique mark
Individual data object；
Display unit, for loading and showing described n data object.
Alternatively, also include:
Paging unit, in described retrieval unit, according to described keyword, data object is retrieved in paging in storage device
Before, paging is carried out to all of data object in described storage device.
Alternatively, described server also includes:
Allocation unit, for distributing the memory space of described out-pile internal memory.
Using technique scheme, server paging retrieval data, internal memory in the jvm heap of server in storage device
When the data object unique mark of middle storage reaches some, the unique mark of this data object is stored internal memory in heap
In, and delete the unique mark of storage in internal memory in heap.Compared to existing technology will be all in storage device in data retrieval
Digital independent internal memory in heap, paging retrieval data of the present invention is every time only with reading page of data object internal memory in heap, it is to avoid
Internal memory spilling.And, compared to existing technology, the position of the unique mark storage of data object is changed in out-pile from internal memory in heap
Deposit, equally avoid the excessive spilling causing internal memory in heap of data volume of retrieval.
Specifically, other features and advantages of the present invention will be described in detail in subsequent specific embodiment part.
Brief description
Accompanying drawing is used to provide a further understanding of the present invention, and constitutes the part of specification, with following tool
Body embodiment is used for explaining the present invention together, but is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is a kind of system architecture schematic diagram of existing data retrieval provided in an embodiment of the present invention；
Fig. 2 is a kind of schematic flow sheet of the method for the data retrieval being provided based on the system architecture shown in Fig. 1；
Fig. 3 is a kind of schematic flow sheet of the method for data retrieval provided in an embodiment of the present invention；
Fig. 4 is a kind of system architecture schematic diagram of data retrieval provided in an embodiment of the present invention；
Fig. 5 is a kind of schematic flow sheet of the method for the data retrieval being provided based on the system architecture shown in Fig. 4；
Fig. 6 a is a kind of structural representation of server provided in an embodiment of the present invention；
Fig. 6 b is the structural representation of another kind server provided in an embodiment of the present invention.
Specific embodiment
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described in detail.It should be appreciated that this place is retouched
The specific embodiment stated is merely to illustrate and explains the present invention, is not limited to the present invention.
In order that those skilled in the art is easier to understand the improvement that the embodiment of the present invention has compared to existing technology,
First below the data retrieval method of prior art is simply introduced.
Fig. 1 shows existing system architecture, and including server 10, this server 10 runs java virtual machine jvm 101
And internal memory 102 in the heap of jvm.This system architecture also includes the storage device 11 being connected with this server 10.Wherein, this storage
Equipment 11 can be disk, its data object that is stored with.
Based on the system architecture shown in Fig. 1, data retrieval flow process of the prior art is as shown in Figure 2, comprising:
S201, server obtain the keyword for retrieval.
What deserves to be explained is, the data object in storage device includes multiple attribute informations.For example, it is use in data object
In the case of family, this data object potentially includes the name of this user, date of birth, multiple information such as ID card No..Above-mentioned
Keyword described in step s201 can be any attribute information of data object, for example, the date of birth of user.
S202, this server enter line retrieval according to this keyword in all data objects that this storage device stores.
All data objects with this keyword are stored in internal memory in heap for s203, this server.
From above-mentioned flow process, in prior art, retrieval result is stored in internal memory in heap, so, in the number of retrieval
During according to measuring larger, easily causing in heap internal memory and overflowing, and in heap memory read-write speed relatively low, have impact on recall precision.Above-mentioned
Problem all will be resolved in embodiments of the present invention, below the embodiment of the present invention is described in detail.
The embodiment of the present invention provides a kind of data retrieval method, and the method is applied to server, and this server runs to be had
Jvm, and this server includes internal memory and out-pile internal memory in heap, as shown in figure 3, the method includes:
S301, this server obtain the keyword of retrieval.
Wherein, the keyword of this retrieval can be the keyword of the user input that server gets.Still with user
Illustrated as data object, if nineteen ninety user input date of birth to nineteen ninety-five, this server will be to storage device
All dates of birth of middle storage, the user between nineteen ninety to nineteen ninety-five entered line retrieval.
Above-mentioned be merely illustrative, in the specific implementation, other kinds of object data in storage device, can be stored, inspection
The keyword of rope can also be other keywords, and the present invention does not limit to this.
S302, this server paging retrieval data object in storage device according to this keyword.
Paging retrieval refers to enter line retrieval successively to the every page of data object in storage device.Wherein, every page of data
The number of object can be related with the display of retrieval result.For example, retrieval result can only once show 20 in webpage, then deposit
In storage equipment, the data object number of every one page can think 20.
Further, in paging retrieving, for every page data object execution following steps s303 to step s304.
The unique mark with the data object of described keyword is stored internal memory in this heap by s303, this server successively
In.
Wherein, described unique mark is used in described storage device directly inquiring about corresponding data object.
When the described uniquely identified number that s304, this server store in internal memory in this heap reaches threshold value, by this heap
In internal memory, the described unique mark of storage is stored in this out-pile internal memory, and deletes described unique mark of storage in internal memory in this heap
Know.
Using technique scheme, server paging retrieval data, internal memory in the jvm heap of server in storage device
When the data object unique mark of middle storage reaches some, the unique mark of this data object is stored internal memory in heap
In, and delete the unique mark of storage in internal memory in heap.Compared to existing technology will be all in storage device in data retrieval
Digital independent internal memory in heap, paging retrieval data of the present invention is every time only with reading page of data object internal memory in heap, it is to avoid
Internal memory spilling.And, compared to existing technology, the position of the unique mark storage of data object is changed in out-pile from internal memory in heap
Deposit, equally avoid the excessive spilling causing internal memory in heap of data volume of retrieval.And, out-pile internal memory is compared interior presence in heap and is read
Write speed during data faster that is to say, that the embodiment of the present invention can also improve the efficiency of data retrieval.
In order that those skilled in the art more understands technical scheme provided in an embodiment of the present invention, below to above-mentioned step
Suddenly it is described in detail.
Specifically, out-pile internal memory can be the memory space that server is applied in an initial condition, that is, in above-mentioned steps
Before s301, methods described also includes: the memory space of described server is divided, to distribute depositing of described out-pile internal memory
Storage space.
Wherein, the specific size of the memory space of out-pile internal memory can be set according to the actual requirements, wherein, in out-pile
Deposit and compare internal memory in heap and be more easy to extend, therefore, the embodiment of the present invention can also extend the depositing of out-pile internal memory in follow-up operation
Storage space.
Further, if the non-paging of the data object in storage device, the embodiment of the present invention also might be used before step s302
So that paging is carried out to all of data object in this storage device.
Wherein, in the case of n data object of every page of inclusion in storage device, above-mentioned steps s304 specifically include:
After paging retrieves the n data object with described keyword, the described n data object in internal memory in this heap is unique
Mark is stored in this out-pile internal memory, and deletes the unique mark of storage in internal memory in this heap.
That is, often storing the unique mark of full n data object in internal memory in heap, server will be in internal memory in heap
The unique mark of storage transfers in out-pile internal memory storage, the memory space of internal memory in heap is wiped simultaneously, laggard one
In internal memory in the unique mark storage of the data object that step retrieves heap after being erased, so circulate.Thus, take heap every time
The memory space of internal memory is less than n bar, it is to avoid internal memory spilling.And, store the qualified of out-pile internal memory every time
The uniquely identified number of data object is just one page, is conducive to showing retrieval result.
In addition, what deserves to be explained is, the unique mark of above-mentioned data object can be the cryptographic Hash of data object, in out-pile
Stored with key assignments key-value form in depositing, so that server can directly be inquired about according to unique mark key from storage device
To data object.
Further, a kind of data retrieval method provided in an embodiment of the present invention also includes: according to the n in this out-pile internal memory
Individual described unique mark reads n data object in this storage device, loads and show described n data object.
Illustratively, as shown in figure 4, a kind of system architecture provided in an embodiment of the present invention includes server 40, this server
40 operations have java virtual machine jvm, and this server 40 also includes internal memory 401 and out-pile internal memory 402 in the heap of jvm.This system
Framework also includes the storage device 41 being connected with this server, for data storage object, wherein, data in this storage device
Object is divided into multipage, and to the m page, m is greater than or equal to 2 positive integer to first page as shown in Figure 4.
Based on the system architecture shown in Fig. 4, data retrieval method provided in an embodiment of the present invention is as shown in figure 5, the method
Including:
S501, server 40 initialization when, the memory space of the out-pile internal memory 402 of pre- first to file fixed size.
S502, server 40 obtain the keyword of retrieval.
Referring in particular to the above-mentioned description to step s301, here is omitted.
S503, server 40 enter line retrieval according to this keyword in the first page of storage device 41.
The unique mark in this first page with the data object of this keyword is stored in interior in heap by s504, server 40
Deposit in 401.
S505, server 40 determine whether the unique identification numbers of storage in internal memory 401 in heap reach threshold value.
Wherein, this threshold value can be set in advance according to the actual requirements.For example, entered according to the space size of internal memory in heap
Row setting.
Further, if the unique identification numbers of storage reach this threshold value in internal memory 401 in heap, execution step s506 and
S507, if the unique identification numbers of storage are not up to this threshold value, execution step s508 in internal memory 401 in heap.
The unique mark of storage in internal memory in heap 401 is stored in out-pile internal memory 402 for s506, server 40.
S507, server 40 delete the unique mark of the data object of storage in internal memory 401 in heap.
Further, execution step s508.
S508, server 40 enter line retrieval according to this keyword in the second page of storage device 41, deposit until having retrieved
All data objects in storage equipment 41.
That is, with reference to above-mentioned steps s503 to s507, server 40 is directed to the later every one page of this second page and all holds
Row identical operates, until finishing all data object retrievals in storage device 41.
What deserves to be explained is, after line retrieval is entered to the last page in storage device 41, if unique in internal memory in heap
Mark is not up to this threshold value, and now, the unique mark in internal memory in heap 401 is also transferred to out-pile internal memory 402 and deposited by server 40
Storage.
S509, server 40 read in storage device 41 to should uniquely mark according to the unique mark in out-pile internal memory 402
The data object known.
S510, server 40 load and show retrieval result.
Using said method, in internal memory in heap, often store the unique mark of full a number of data object, server is
The unique mark of storage in internal memory in heap is transferred to storage in out-pile internal memory, the memory space of internal memory in heap is wiped simultaneously
Remove, in internal memory in the unique mark of the data object retrieving further afterwards storage heap after being erased, so circulate.This
Sample, it is ensured that the memory space that each retrieval takies internal memory in heap is less than threshold value, thus keeping away in the case of retrieval exhaustively
Exempt from internal memory spilling.And, the read-write speed of out-pile internal memory is higher than internal memory in heap, and therefore, the embodiment of the present invention can also improve
Recall precision.
What deserves to be explained is, for said method embodiment, in order to be briefly described, therefore it is all expressed as a series of dynamic
Combine, but those skilled in the art should know, the present invention is not limited by described sequence of movement, secondly, this
Skilled person also should know, embodiment described in this description belongs to preferred embodiment, and involved action is simultaneously
It is not necessarily necessary to the present invention.
The embodiment of the present invention also provides a kind of server 60, for implementing a kind of data inspection of said method embodiment offer
The method of rope, this server 60 includes internal memory and out-pile internal memory in the heap of jvm, and as shown in Figure 6 a, described server 60 also wraps
Include:
Acquiring unit 61, for obtaining the keyword of retrieval.
Retrieval unit 62, for according to described keyword in storage device paging retrieval data object.
Memory cell 63, the unique mark for the data object by having described keyword stores in described heap successively
In internal memory.
Wherein, described unique mark is used in described storage device directly inquiring about corresponding data object.
Determining unit 64, the described uniquely identified number for determining storage in internal memory in described heap reaches threshold value.
Described memory cell 63 is additionally operable to, and the described unique mark of storage in internal memory in described heap is stored in described out-pile
Deposit.
Delete unit 65, for deleting the described unique mark of storage in internal memory in described heap.
Using above-mentioned server, this server paging retrieval data, internal memory in the jvm heap of server in storage device
When the data object unique mark of middle storage reaches some, the unique mark of this data object is stored internal memory in heap
In, and delete the unique mark of storage in internal memory in heap.Compared to existing technology will be all in storage device in data retrieval
Digital independent internal memory in heap, paging retrieval data of the present invention is every time only with reading page of data object internal memory in heap, it is to avoid
Internal memory spilling.And, compared to existing technology, the position of the unique mark storage of data object is changed in out-pile from internal memory in heap
Deposit, equally avoid the excessive spilling causing internal memory in heap of data volume of retrieval.And, out-pile internal memory is compared interior presence in heap and is read
Write speed during data faster that is to say, that the embodiment of the present invention can also improve the efficiency of data retrieval.
Alternatively, n data object of every page of inclusion in described storage device；Described determining unit 64 is used for, and determines described
Retrieval unit paging retrieves the n data object with described keyword；Described memory cell 63 is used for, will be interior in described heap
The unique mark of the described n data object deposited is stored in described out-pile internal memory.
That is, often storing the unique mark of full n data object in internal memory in heap, server will be in internal memory in heap
The unique mark of storage transfers in out-pile internal memory storage, the memory space of internal memory in heap is wiped simultaneously, laggard one
In internal memory in the unique mark storage of the data object that step retrieves heap after being erased, so circulate.Thus, take heap every time
The memory space of internal memory is less than n bar, it is to avoid internal memory spilling.And, store the qualified of out-pile internal memory every time
The uniquely identified number of data object is just one page, is conducive to showing retrieval result.
Alternatively, as shown in Figure 6 b, this server 60 also includes:
Reading unit 66, for reading in described storage device according to the n in described out-pile internal memory described unique mark
N data object；Display unit 67, for loading and showing described n data object.
Alternatively, as shown in Figure 6 b, this server 60 also includes:
Paging unit 68, in described retrieval unit, according to described keyword, data pair is retrieved in paging in storage device
As before, paging is carried out to all of data object in described storage device.
Alternatively, as shown in Figure 6 b, this server 60 also includes:
Allocation unit 69, for distributing the memory space of described out-pile internal memory.
What deserves to be explained is, the above dividing elements to this server 60, only a kind of division of logic function, actual realization
When can have other dividing mode.For example, said memory cells 63 and determining unit 64 are divided into a processing unit.
And, the physics realization of above-mentioned each functional unit has been likely to multiple implementations.For example, above-mentioned processing unit can be central authorities
Processor cpu or fpga (field programmable gate array, field programmable gate array), the present invention
This is not limited.
In addition, affiliated it will be apparent to those skilled in the art ground recognize, for convenience and simplicity of description, foregoing description
The each unit of server specific work process, may be referred to the corresponding process in preceding method embodiment, no longer superfluous herein
State.
It should be understood that disclosed apparatus and method in embodiment provided herein, can pass through other
Mode is realized.For example, can be integrated in a processing unit in each functional unit in each embodiment of the present invention it is also possible to
It is that unit is individually physically present it is also possible to two or more units are integrated in a unit.Above-mentioned integrated list
Unit both can be to be realized in the form of hardware, it would however also be possible to employ the form that hardware adds SFU software functional unit is realized.
The above-mentioned integrated unit realized in the form of SFU software functional unit, can be stored in an embodied on computer readable and deposit
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions with so that a computer
Equipment (can be personal computer, server, or network equipment etc.) executes the portion of each embodiment methods described of the present invention
Step by step.And aforesaid storage medium includes: (random access memory, arbitrary access is deposited for u disk, portable hard drive, ram
Reservoir), magnetic disc or CD etc. are various can be with the medium of data storage.
The above, the only specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, and any
Those familiar with the art the invention discloses technical scope in, the change or replacement that can readily occur in, all answer
It is included within the scope of the present invention.Therefore, protection scope of the present invention should be defined by scope of the claims.
Claims (10)
1. a kind of method of data retrieval it is characterised in that methods described be applied to run java virtual machine jvm server,
Described server includes internal memory and out-pile internal memory in the heap of jvm, and methods described includes:
Described server obtains the keyword of retrieval；
According to described keyword, in storage device, data object is retrieved in paging, wherein, following for the execution of every page data object
Operation:
The unique mark with the data object of described keyword is stored in internal memory in described heap successively；Wherein, described only
One identifies for directly inquiring about corresponding data object in described storage device；
When the described uniquely identified number of storage in internal memory in described heap reaches threshold value, by storage in internal memory in described heap
Described unique mark is stored in described out-pile internal memory, and deletes the described unique mark of storage in internal memory in described heap.
2. method according to claim 1 it is characterised in that in described storage device every page inclusion n data object；
When the described described uniquely identified number when storage in internal memory in described heap reaches threshold value, will deposit in internal memory in described heap
The described unique mark of storage is stored in described out-pile internal memory, comprising:
After paging retrieves the n data object with described keyword, by the described n data pair in internal memory in described heap
The unique mark of elephant is stored in described out-pile internal memory.
3. method according to claim 2 is it is characterised in that methods described also includes:
Read n data object in described storage device according to the n in described out-pile internal memory described unique mark；
Load and show described n data object.
4. the method according to any one of claims 1 to 3 it is characterised in that according to described keyword in storage device
Before middle paging retrieval data object, methods described also includes:
Paging is carried out to all of data object in described storage device.
5. the method according to any one of claims 1 to 3 is it is characterised in that methods described also includes:
The memory space of described server is divided, to distribute the memory space of described out-pile internal memory.
6. it is characterised in that described server runs java virtual machine jvm, described server includes the heap of jvm to a kind of server
Internal memory and out-pile internal memory, described server also includes:
Acquiring unit, for obtaining the keyword of retrieval；
Retrieval unit, for according to described keyword in storage device paging retrieval data object；
Memory cell, the unique mark for the data object by having described keyword stores internal memory in described heap successively
In；Wherein, described unique mark is used in described storage device directly inquiring about corresponding data object；
Determining unit, the described uniquely identified number for determining storage in internal memory in described heap reaches threshold value；
Described memory cell is additionally operable to, and the described unique mark of storage in internal memory in described heap is stored in described out-pile internal memory；
Delete unit, for deleting the described unique mark of storage in internal memory in described heap.
7. server according to claim 6 it is characterised in that in described storage device every page inclusion n data object；
Described determining unit is used for, and determines that described retrieval unit paging retrieves the n data object with described keyword；
Described memory cell is used for, and the unique mark of the described n data object in internal memory in described heap is stored in described out-pile
In internal memory.
8. server according to claim 7 is it is characterised in that also include:
Reading unit, for reading the n number in described storage device according to the n in described out-pile internal memory described unique mark
According to object；
Display unit, for loading and showing described n data object.
9. the server according to any one of claim 6 to 8 is it is characterised in that also include:
Paging unit, for described retrieval unit according to described keyword in storage device paging retrieval data object it
Before, paging is carried out to all of data object in described storage device.
10. the server according to any one of claim 6 to 8 is it is characterised in that also include:
Allocation unit, for distributing the memory space of described out-pile internal memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610749786.6A CN106339183B (en) | 2016-08-29 | 2016-08-29 | Data retrieval method and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610749786.6A CN106339183B (en) | 2016-08-29 | 2016-08-29 | Data retrieval method and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106339183A true CN106339183A (en) | 2017-01-18 |
| CN106339183B CN106339183B (en) | 2020-02-11 |
Family
ID=57823927
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610749786.6A Active CN106339183B (en) | 2016-08-29 | 2016-08-29 | Data retrieval method and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106339183B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108196937A (en) * | 2017-12-26 | 2018-06-22 | 金蝶软件（中国）有限公司 | Processing method, device, computer equipment and the storage medium of string |
| CN109324904A (en) * | 2018-09-29 | 2019-02-12 | 智器云南京信息科技有限公司 | Dynamic memory management method and device |
| CN110895475A (en) * | 2018-09-10 | 2020-03-20 | 深圳云天励飞技术有限公司 | Starting method and device of search server and search server |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101894049A (en) * | 2010-07-14 | 2010-11-24 | 中兴通讯股份有限公司 | System and method for recycling garbage object in self-adaptive way |
| CN103914399A (en) * | 2012-12-31 | 2014-07-09 | 中国移动通信集团公司 | Disk cache method and device in parallel computer system |
| CN104620219A (en) * | 2012-08-31 | 2015-05-13 | 优米有限公司 | Network service system and method with off-heap caching |
| CN104915435A (en) * | 2015-06-24 | 2015-09-16 | 努比亚技术有限公司 | Data query method and device |
| CN105224252A (en) * | 2015-09-28 | 2016-01-06 | 北京奇虎科技有限公司 | Date storage method and device |
| CN105893435A (en) * | 2015-12-11 | 2016-08-24 | 乐视网信息技术（北京）股份有限公司 | Data loading and storing equipment, method and system |
-
2016
- 2016-08-29 CN CN201610749786.6A patent/CN106339183B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101894049A (en) * | 2010-07-14 | 2010-11-24 | 中兴通讯股份有限公司 | System and method for recycling garbage object in self-adaptive way |
| CN104620219A (en) * | 2012-08-31 | 2015-05-13 | 优米有限公司 | Network service system and method with off-heap caching |
| CN103914399A (en) * | 2012-12-31 | 2014-07-09 | 中国移动通信集团公司 | Disk cache method and device in parallel computer system |
| CN104915435A (en) * | 2015-06-24 | 2015-09-16 | 努比亚技术有限公司 | Data query method and device |
| CN105224252A (en) * | 2015-09-28 | 2016-01-06 | 北京奇虎科技有限公司 | Date storage method and device |
| CN105893435A (en) * | 2015-12-11 | 2016-08-24 | 乐视网信息技术（北京）股份有限公司 | Data loading and storing equipment, method and system |
Non-Patent Citations (2)
| Title |
|---|
| 余涛: "基于JavaEE平台的websphere应用系统内存溢出浅析", 《硅谷》 * |
| 李海兵: "Java 的缓存系统的设计", 《软件开发与设计》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108196937A (en) * | 2017-12-26 | 2018-06-22 | 金蝶软件（中国）有限公司 | Processing method, device, computer equipment and the storage medium of string |
| CN110895475A (en) * | 2018-09-10 | 2020-03-20 | 深圳云天励飞技术有限公司 | Starting method and device of search server and search server |
| CN110895475B (en) * | 2018-09-10 | 2023-03-31 | 深圳云天励飞技术有限公司 | Search server starting method and device and search server |
| CN109324904A (en) * | 2018-09-29 | 2019-02-12 | 智器云南京信息科技有限公司 | Dynamic memory management method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106339183B (en) | 2020-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200249849A1 (en) | Method and apparatus for managing storage system | |
| US10114908B2 (en) | Hybrid table implementation by using buffer pool as permanent in-memory storage for memory-resident data | |
| US8938603B2 (en) | Cache system optimized for cache miss detection | |
| CN102707966B (en) | Method and device for acceleratively starting operating system, and method, device and terminal for generating prefetched information | |
| US8793427B2 (en) | Remote memory for virtual machines | |
| CN107766469A (en) | A kind of method for caching and processing and device | |
| CN107391544B (en) | Processing method, device and equipment of column type storage data and computer storage medium | |
| CN106339183A (en) | Data retrieving method and server | |
| CN103914483A (en) | File storage method and device and file reading method and device | |
| CN104657435A (en) | Storage management method for application data and network management system | |
| US10713162B1 (en) | System and method for computer data garbage collection acceleration using peer to peer data transfers | |
| CN109460406A (en) | Data processing method and device | |
| US20150186255A1 (en) | Re-use of invalidated data in buffers | |
| CN105468623A (en) | Data processing method and apparatus | |
| CN109408416B (en) | Address mapping table entry page management method and device | |
| CN112596949B (en) | High-efficiency SSD (solid State disk) deleted data recovery method and system | |
| CN106201918A (en) | A kind of method and system quickly discharged based on big data quantity and extensive caching | |
| US11789639B1 (en) | Method and apparatus for screening TB-scale incremental data | |
| CN104899208A (en) | Caching method and apparatus for browser | |
| CN106557274A (en) | Virtual snapshot processing method and processing device | |
| CN104298614A (en) | Method for storing data block in memory device and memory device | |
| CN109582938B (en) | Report generation method and device | |
| CN112148486A (en) | Memory page management method, device and equipment and readable storage medium | |
| CN113778911A (en) | L2P data caching method and device, readable storage medium and electronic equipment | |
| CN105260132A (en) | Method and device for hot loading disk filter drive |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |