CN101783740B - Method and device for managing message file - Google Patents
Method and device for managing message file Download PDFInfo
- Publication number
- CN101783740B CN101783740B CN2009100772947A CN200910077294A CN101783740B CN 101783740 B CN101783740 B CN 101783740B CN 2009100772947 A CN2009100772947 A CN 2009100772947A CN 200910077294 A CN200910077294 A CN 200910077294A CN 101783740 B CN101783740 B CN 101783740B
- Authority
- CN
- China
- Prior art keywords
- message
- file
- data block
- index node
- write
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for managing a message file. The method comprises the following steps: creating a file system and mapping the file system into a memory, wherein the file system comprises a root directory and a node directory, the root directory comprises a head file, and the node directory comprises a head file and a corresponding data file; selecting the node directory in the file system when a messages is required to be written; and writing a content of the message into the data file of the node directory, and writing information associated with the message in the head file of the node directory. By the adoption of the method and the device of the invention, the message in the file can be quickly positioned and management efficiency of a message queue of the file is improved.
Description
Technical field
The present invention relates to network management technology, be specifically related to a kind of managing message file method and device.
Background technology
In the webmaster application system of telecommunications; Need carry out the message dynamic synchronization of big data quantity to the network element device O&M data in the existing network and network management system; How to guarantee that these synchronous message safeties are lasting and can locate certain message fast, can play fundamental influence runnability, execution efficient and the accuracy of whole network management system.
In most of network management systems the read-write of message generally all is based on the read-write of internal memory or general file system, roughly can be divided into: based on the mode of internal memory, based on the mode of file with based on the mode of database.
In the message read-write based on the mode of file, various ways is arranged also, in realizing process of the present invention, the inventor finds to exist at least in the existing message read-write based on file mode following problem:
(1) read or write speed of existing unformatted file and random access file is slow, fast localization message.
(2) buffering inlet flow file read-write rapid speed, but can only carry out in proper order, be difficult to the message in location and the control documents.
(3), be difficult to the message in location and the control documents though the Memory Mapping File and its read or write speed is very fast.This obviously is difficult to the efficient and the accuracy of the operation of assurance system.
Summary of the invention
The embodiment of the invention provides a kind of managing message file method and device, and the message in the locating file fast improves the efficiency of management of message queue in the file.
For this reason, the embodiment of the invention provides following technical scheme:
A kind of managing message file method that the embodiment of the invention provides comprises:
Set up file system, said file system comprises root and nodal directory, comprises header file under the said root, comprises header file and corresponding data file under the nodal directory, and said file system is mapped to internal memory;
When needs are write message, select the nodal directory in the said file system;
The content of said message is write in the data file under the said nodal directory, and in the header file of said nodal directory, write the relevant information of said message.
A kind of managing message file device that the embodiment of the invention provides comprises:
File is set up the unit, is used to set up file system, and said file system comprises root and nodal directory, comprises header file under the said root, comprises header file and corresponding data file under the nodal directory;
Map unit is used for said file system is mapped to internal memory;
The message writing unit; Be used for when needs are write message; Select the nodal directory in the said file system, and the content of said message is write in the data file under the said nodal directory, and in the header file of said nodal directory, write the relevant information of said message.
The managing message file method and the device of the embodiment of the invention, through setting up file system, said file system comprises root and nodal directory, comprises header file under the said root, comprises header file and corresponding data file under the nodal directory; Said file system is mapped to internal memory; When needs are write message, select the nodal directory in the said file system; The content of said message is write in the data file under the said nodal directory, and in the header file of said nodal directory, write the relevant information of said message.Through the memory-mapped mode, utilize the content of memory cache partial document system, improved the access speed of document queue greatly.Especially for the webmaster application system of telecommunications, the message in the localization message formation fast, real-time, validity and the accuracy of the operation of assurance system.
Description of drawings
Fig. 1 is the flow chart of embodiment of the invention managing message file method;
Fig. 2 is the storage sketch map of embodiment of the invention file system;
Fig. 3 is a kind of structural representation of the Head file under the root in the embodiment of the invention;
Fig. 4 is a kind of structural representation of the Head file under the nodal directory in the embodiment of the invention;
Fig. 5 is the structural representation of the superblock in the Head file under the nodal directory in the embodiment of the invention;
Fig. 6 is a kind of structural representation of the Data file under the nodal directory in the embodiment of the invention;
Fig. 7 is the structural representation of embodiment of the invention managing message file device.
Embodiment
In order to make those skilled in the art person understand the scheme of the embodiment of the invention better, the embodiment of the invention is done further to specify below in conjunction with accompanying drawing and execution mode.
The managing message file method and the device of the embodiment of the invention utilize the pattern of operating system buffer memory, and message file is mapped in the internal memory, and the message queue in the access message file is quick and convenient just as access memory like this.Particularly, the system that at first creates a file, and said file system is mapped to internal memory; When needs are operated message, such as read or deleted file in message content or when message write file, according to message identifier (ID) confirm message in internal memory the position or need the address of write memory, can realize quick operation to this message.
With reference to Fig. 1, be the flow chart of embodiment of the invention managing message file method, may further comprise the steps:
When selecting nodal directory, can confirm according to hash algorithm, such as; At first according to the maximum subfile system number (FileSysCount among the head under the root; If any 3) and the path of current system such as: c:, obtain 3 sub-files system object tabular array; Such as sub [], the path of their bibliographic structure is following: c:; C:; C:.In the time of need writing message then at every turn; Through simple hash algorithm: subfile system index=seed number ++ the maximum subfile system number of %; Again through obtaining certain subfile system among the sub [subfile system index]; Create (File) file object through this subfile system at last, and be set to message identifier in the file object.
Certainly, also can confirm, this embodiment of the invention is not done qualification according to additive method.
Particularly, data block switch mapping table (BitMap) and index node tabulation (InodeList) can be set in the header file under the nodal directory; Data block is set in data file.When writing message, select data block idle in the said data file according to said data block switch mapping table; Select idle index node in the said index node tabulation according to the index node switch in the internal memory; Then, the content of said message is write in the data block of said free time, and in the index node of said free time, write the relevant information of said message.
In order to read message fast, in embodiments of the present invention, can also be with in the formation of said message write memory.Like this, when need when reading message, from said memory queue, read message according to message identifier.
In embodiments of the present invention; When writing message; Select the nodal directory in the said file system; Just can set up the corresponding relation of message identifier and file object according to the nodal directory of selecting, and this corresponding relation is write in the mapping table of a message identifier and file object, after said message being written to corresponding data block and the relevant information of said message write corresponding index node; Can in the object of message identifier corresponding file described in the said mapping table, add the information of corresponding data block and index node, so that when needs deletion message, locate the positional information of said message in file system fast.
When needs deletion message; From said memory queue, delete this message according to message identifier; And according to the mapping table of message identifier and said message identifier and file object; Obtain the subfile system of depositing this message and data block and the index node relevant, upgrade the state of said index node, be about in the index node switch switch that should index node is set to the free time with this message.Simultaneously, also want in the updating memory state of the switch of corresponding said data block in the data block switch mapping table, and the said index node in the index node tabulation in the deletion internal memory, data block switch mapping table is tabulated with index node in the last Head file synchronously.
Need to prove, when writing message, deletion message or updating message, the state of the index switch that the index node in the switch mapping table that all need Update Information in data block corresponding switch state and the internal memory is corresponding.
It is thus clear that, utilize the method for the embodiment of the invention, combine the advantage of buffering inlet flow file and Memory Mapping File and its, through the memory-mapped mode, utilize the content of memory cache partial document system, improved the access speed of document queue greatly.Especially for the webmaster application system of telecommunications, the message in the localization message formation fast, real-time, validity and the accuracy of the operation of assurance system.
The structure of the further explain embodiment of the invention file system of giving an example below.
As shown in Figure 2, be the storage sketch map of embodiment of the invention file system.Wherein, FFS is a root, and 0,1 is nodal directory, certainly, in a file system, one or more nodal directories can be arranged.
As shown in Figure 3, be the structural representation of the Head file under the root in the embodiment of the invention.
In this embodiment, the Head file under the root comprises: the node number of file system, maximum file number, maximum file size also can further comprise check information, such as data checks point shown in Fig. 31 and data checks point 2.Wherein, said checking information is used to check whether said file system is destroyed, to guarantee the correctness of file system.Such as, if the numerical value of data checks point 2 is not equal to the numerical value of data checks point 1, show that then file system is destroyed.
Head file under the nodal directory is used to preserve the storage control information under this nodal directory, and its structure is as shown in Figure 4, comprising: data block switch mapping table and index node tabulation also can further comprise superblock.Wherein:
Said superblock is used to store the subfile system information under this nodal directory, and the specifying information content can mainly contain with reference to shown in Fig. 5: information such as the inclined to one side location of the size of all types of block of informations, sum, block of information and memory address in the subfile system.The data block that comprises in the superblock shown in Fig. 5 is pointed to the path that the location field of storing is used to indicate the file system storage, such as being " C: ".
Comprise switch among the said BitMap, be used to indicate the state of corresponding data block, that is to say, indicate whether existing message writes in the said data block corresponding to each data block in the Data file.Each data block is a corresponding switch among the BitMap can be represented the state of switch with a bit, such as, 0 expression is idle, and 1 expression is busy.
Comprise a plurality of index nodes (i.e. I node among the figure) in the said index node tabulation; Stored the relevant information of a data block in each index node, such as length, settling time, message status, message identifier and the index information of itself (such as the position of index node in the index node tabulation) etc. of message in the data block.The variation of each index node state can represent that when being empty such as index node, the corresponding switch variable is True, otherwise is False through the index node switch.In order to locate certain index node fast, can the form of index node switch with bitmap be kept in the internal memory.
Data file structure under the nodal directory is as shown in Figure 6, comprises a plurality of data blocks.In order to reduce the complexity to file management, the amount of capacity that can set these data blocks is consistent, and wherein each data block is used to store a piece of news.
Need to prove; In practical application, can set the size of said data block according to the maximum length of each message, every message takies a data block; Correspondingly; The relevant information of this message of index node storage is arranged, that is to say that the storage of a piece of news has taken a data block (having stored the content of this message) and an index node (having stored the relevant information of this message).Certainly; If the required memory space that takies of a piece of news is during greater than the capacity of a data block; Also can take a plurality of data blocks, correspondingly, an index node arranged; That is to say that the storage of a piece of news has taken a plurality of data blocks (having stored the content of this message) and an index node (having stored the relevant information of this message).
It is thus clear that, use the method for the embodiment of the invention for ease neatly, the index node in each subfile system can be identical with the quantity of data block, is one to one; The quantity of index node and data block also can be different, is the relation of one-to-many.Specifically can confirm according to applied environment.
Confirmed the structure of file system, just can set up file system according to this structure.At first, setting up before the file directory path of can the select File system depositing, according to the size and the size of depositing the frequency computation part outfile system of message of message.
During calculation document system big or small, need to calculate earlier following information:
Piece number=bitmap block number of BitMap (effectively size)/(8 of data block size *);
Index node piece number=(maximum file number * index node size)/message size;
The piece number of the inclined to one side location+BitMap of the initial inclined to one side location=BitMap of index node;
Switch number among maximum Data file size=data block size * BitMap;
The piece number of piece sum=superblock number+BitMap in Head file and the Data file+index node piece number+data block number;
The piece number of Head number of files=superblock number+BitMap+index node piece number.
Such as, default setting that can the enactment document system is: bitmap number=32K, maximum number of files=8K, the inclined to one side location=1bit of bitmap piece, index node size=64bit, index node number=12, number of data blocks=32K, superblock number=1 etc.
For example: file system path=ffs, data block size=1024B, during 2 Archive sits, system is as shown in Figure 1 according to the default configuration spanned file.
After having set up file system, need said file system be mapped in the internal memory, that is to say file system is carried out initialized process.Can carry out in such a way particularly:
At first read the Head file under the root, confirm the node number of file system, maximum file number and maximum file size, and then the initialization subfile system.
During the initialization subfile system, at first, can confirm the gross space that the current file system is required according to the information of the superblock in the Head file under each nodal directory; Next initialization data piece switch mapping table; Data block switch mapping table in the file system is synchronized among the BitMap of internal memory; Wherein the original position of BitMap in internal memory confirmed according to the data block size that defines in the * superblock of the inclined to one side location of the BitMap in the superblock; The size of BitMap confirms that according to the size of the BitMap in the superblock byte number of a Flush is confirmed according to the size of the header file in the superblock (General Definition Blocksize==headBlockSize); Initialization index node then; Can (be largest index interstitial content in the current system (equal maximum data piece number, equal largest block bitmap number) according to initial inclined to one side location, index node piece number and the maximum data piece number of index node; In internal memory, generate an index node tabulation; Load the information in the index node, the listed files (FileList) of a same length of initialization simultaneously is so that use when reading or delete message.At last, initialization Data file according to the initial inclined to one side location of the data block in the superblock, obtains the data write passage.Promptly according to the inclined to one side location (DataBlockOffset) and the data block number (DataBlockCount) of BitMap, data block, generate a memory-mapped tabulation and be used for the control data piece; As can reach the effect that quick control internal memory and file system are shone upon according to the message relevant informations such as (start address of message, length) in data block initial address in the superblock (DataPosition is a pointer) or the index node.In addition; When initialization; Also need in internal memory, generate a data block object pond and a file object pond in advance; The mapping table of while message identifier of initialization and file object is to preserve the corresponding relation of message identifier and file object, the expense when the frequent generation of minimizing message and deletion.
Based on the file system of above-mentioned foundation, describe the process that message writes, reads and deletes below respectively in detail.
1. write message
At first, according to the selected sub-files system of hash algorithm, that is to say the nodal directory of selecting message to write.Simultaneously, generate the corresponding relation of a piece of news sign and file object, this corresponding relation is saved in the mapping table of said message identifier and file object.
Then; From the index node tabulation of the Head file of said subfile system, select the index node of a free time according to the index node switch; And from the file object pond, select a file; And according to index node initialization this document, mainly comprise the position of current index node in file system and the filename of confirming said file are set, then this document object (information such as title, index, index node, subfile system, inlet flow, output stream) is put in the listed files; Simultaneously, according to file output stream in the file object and the newly-generated internal storage data piece of subfile system, said message is write in this internal storage data piece.If the byte number of current output stream is write the size of message to the threshold value of file more than or equal to current system, then also need to write in the internal memory and file system that the message synchronization in the said internal storage data piece is mapped to said file system.But said threshold value can be self-defined must be smaller or equal to the size of data block.Detailed process is following:
Write data piece: select a freed data blocks according to BitMap, obtain its initial address, said message is write in this freed data blocks, then this data block is write in the Data file;
Write index node: after in freed data blocks, writing message; The state that the index node of said free time is set is busy state; That is to say, in the index node switch switch that should index node is set to busy state, and upgrades the information in the index node; Mainly be that length, state, creation-time and check information etc. with current message are saved in this index node, and the data switch state among this index node and the BitMap is write in the Head file.
Need to prove,, can also said message be written in the memory queue for the ease of reading message fast.
2. read message
When reading message, can directly from memory queue, read message according to message identifier, and need not to read file system, thereby can improve reading speed.
3. deletion message
When needs deletion message; Can directly from said memory queue, delete message according to message identifier; And mapping table according to message identifier and said message identifier and file object; Obtain the subfile system of depositing this message and data block and the index node relevant, upgrade the state of said index node, be about in the index node switch switch that should index node is set to the free time with this message.Simultaneously; Also want in the updating memory state of the switch of corresponding said data block in the data block switch mapping table; And the said index node in the index node tabulation in the deletion internal memory; Data block switch mapping table and index node tabulation in the last Head file synchronously, the state of the index switch that the index node in the switch mapping table that promptly Updates Information in data block corresponding switch state and the internal memory is corresponding.
It is thus clear that the method for the embodiment of the invention utilizes that memory-mapped and Index Algorithm can write fast, read, the message in the delete file system.What this document system stored is the byte stream of binary form, can be suitable for variety of protocol, such as the management of protocol message formations such as http, https, rmi, webservice.
The method of the embodiment of the invention can be applied to multiple Message Processing environment, in the processing that is applied to synchronization message, produces and sends message by the A of system and give the B of system.System A writes formation sending before message (message in the internal memory) gives the B of system with message, and two kinds of situation are arranged then: the message status that (1) can be returned according to the B of system, and system A is responsible for removing the message in the formation; (2) B of system can directly adjust back the A of system and be responsible for removing queue message.Whether final system A can the periodic polling formation, look to have message not by configuration state, resends message and gives the B of system.Can also be applied in the processing of asynchronous message, such as message queue being deployed to an application system separately, system A is responsible for writing message, and the B of system is responsible for reading message, and condition of information is only by B of system and queue system control.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to accomplish through program; Described program can be stored in the computer read/write memory medium; Described storage medium, as: ROM/RAM, magnetic disc, CD etc.
The embodiment of the invention also provides a kind of managing message file device, and is as shown in Figure 7, is a kind of structural representation of this device.
In this embodiment, said device comprises: file is set up unit 701, map unit 702 and message writing unit 703.Wherein, file is set up unit 701, is used to set up file system, and said file system comprises root and nodal directory, comprises header file under the said root, comprises header file and corresponding data file under the nodal directory; Map unit 702 is used for said file system is mapped to internal memory; Message writing unit 703; Be used for when needs are write message; Select the nodal directory in the said file system, and the content of said message is write in the data file under the said nodal directory, and in the header file of said nodal directory, write the relevant information of said message.
To the management of message in the file, the tabulation of data block switch mapping table and index node can be set in the header file under the nodal directory for ease; In the data file under the nodal directory, data block is set.Said message writing unit 703 comprises: nodal directory chooser unit 731 is used to utilize hash algorithm to confirm said nodal directory; Data block selection subelement 732 is used for selecting the idle data block of said data file according to said data block switch mapping table; Index node chooser unit 733 is used for selecting idle index node in the said index node tabulation according to the index switch of internal memory; Write subelement 734, be used for the content of said message is write the data block of said free time, and in the index node of said free time, write the relevant information of said message.
Utilize the device of the embodiment of the invention, can fast message be write in the file system.Detailed process can be with reference to the description in the method for the front embodiment of the invention.
Certainly, in the device of the embodiment of the invention, can also be provided with formation writing unit 704 and message reading unit 705.Wherein, be used for the formation of said message write memory, to make things convenient for reading of message.Like this, when reading message, message reading unit 705 can directly read message according to said message identifier from said memory queue, and need not to read file system, thereby has improved the reading speed of message.
In order further to improve locating speed, in the device of the embodiment of the invention, can also be provided with mapping table and set up unit 706 and message deletion subelement 707 message in the file system.Wherein, Mapping table is set up unit 706; Be used to set up the corresponding relation of said message identifier and file object, said file object comprises following information: the index node that the relevant information of the nodal directory of selection, the data block that said message content writes, said message writes; Message deletion subelement 707 is used for when needs deletion message, according to the corresponding relation of said message identifier and file object, confirming data block and the index node relevant with said message; Upgrade the index on off state in the corresponding internal memory of on off state and said index node in the corresponding data block switch mapping table of said data block.Delete procedure to the message of preserving in the file system can be with reference to the description in the method for the front embodiment of the invention.
The device of the embodiment of the invention utilizes that memory-mapped and Index Algorithm can write fast, read, the message in the delete file system.What this document system stored is the byte stream of binary form, can be suitable for variety of protocol, such as the management of protocol message formations such as http, https, rmi, webservice.
More than the embodiment of the invention has been carried out detailed introduction, used embodiment among this paper the present invention set forth, the explanation of above embodiment just is used for help understanding method and apparatus of the present invention; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that on embodiment and range of application, all can change, in sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. a managing message file method is characterized in that, comprising:
Set up file system; Said file system comprises root and nodal directory; Comprise header file under the said root, comprise header file and corresponding data file under the nodal directory, the header file under the said nodal directory comprises data block switch mapping table and index node tabulation; Said data file comprises data block, and said file system is mapped to internal memory;
When needs are write message, select the nodal directory in the said file system;
Select data block idle in the said data file according to the data block switch mapping table under the said nodal directory;
Select idle index node in the said index node tabulation according to the index switch in the internal memory;
The content of said message is write in the data block of said free time, and in the index node of said free time, write the relevant information of said message.
2. method according to claim 1 is characterized in that, the nodal directory in the said file system of said selection comprises: confirm said nodal directory according to hash algorithm.
3. method according to claim 1 is characterized in that, said method also comprises:
With the formation of said message write memory;
When needs read message, from said memory queue, read message according to message identifier.
4. method according to claim 1 is characterized in that, said method also comprises:
Set up the corresponding relation of message identifier and file object, said file object comprises following information: the index node that the relevant information of the nodal directory of selection, the data block that said message content writes, said message writes;
When needs deletion message,, confirm data block and the index node relevant with said message according to the corresponding relation of said message identifier and file object;
Delete the content in the said data block, and upgrade the index on off state in the corresponding internal memory of on off state and said index node in the corresponding data block switch mapping table of said data block.
5. a managing message file device is characterized in that, comprising:
File is set up the unit; Be used to set up file system; Said file system comprises root and nodal directory, comprises header file under the said root, comprises header file and corresponding data file under the nodal directory; Header file under the said nodal directory comprises data block switch mapping table and index node tabulation, and said data file comprises data block;
Map unit is used for said file system is mapped to internal memory;
The message writing unit; Be used for when needs are write message; Select the nodal directory in the said file system, and the content of said message is write in the data file under the said nodal directory, and in the header file of said nodal directory, write the relevant information of said message; Said message writing unit comprises:
Nodal directory chooser unit is used to utilize hash algorithm to confirm said nodal directory;
The data block selection subelement is used for selecting the idle data block of said data file according to the data block switch mapping table under the said nodal directory;
Index node chooser unit is used for selecting idle index node in the said index node tabulation according to the index switch of internal memory;
Write subelement, be used for the content of said message is write the data block of said free time, and in the index node of said free time, write the relevant information of said message.
6. device according to claim 5 is characterized in that, also comprises:
The formation writing unit is used for the formation of said message write memory.
7. device according to claim 6 is characterized in that, also comprises:
The message reading unit is used for when needs read message, from said memory queue, reads message according to message identifier.
8. device according to claim 5 is characterized in that, also comprises:
Mapping table is set up the unit, is used to set up the corresponding relation of message identifier and file object, and said file object comprises following information: the index node that the relevant information of the nodal directory of selection, the data block that said message content writes, said message writes;
Message deletion subelement is used for when needs deletion message, according to the corresponding relation of said message identifier and file object, confirming data block and the index node relevant with said message; Upgrade the index on off state in the corresponding internal memory of on off state and said index node in the corresponding data block switch mapping table of said data block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100772947A CN101783740B (en) | 2009-01-21 | 2009-01-21 | Method and device for managing message file |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100772947A CN101783740B (en) | 2009-01-21 | 2009-01-21 | Method and device for managing message file |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101783740A CN101783740A (en) | 2010-07-21 |
| CN101783740B true CN101783740B (en) | 2012-02-15 |
Family
ID=42523565
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100772947A Active CN101783740B (en) | 2009-01-21 | 2009-01-21 | Method and device for managing message file |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101783740B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102737064B (en) * | 2011-04-15 | 2016-02-24 | 腾讯科技（深圳）有限公司 | File caching method and device |
| CN104102552A (en) * | 2013-04-15 | 2014-10-15 | 深圳中兴网信科技有限公司 | Message processing method and device |
| CN103605479B (en) * | 2013-10-16 | 2016-06-01 | 北京奇虎科技有限公司 | Data file wiring method and system, data file read method and system |
| CN103823865A (en) * | 2014-02-25 | 2014-05-28 | 南京航空航天大学 | Database primary memory indexing method |
| CN104881441B (en) * | 2015-05-12 | 2018-11-06 | 福建天晴数码有限公司 | File reception and storage method, inspection method based on LAN and system |
| CN108132845A (en) * | 2016-12-01 | 2018-06-08 | 阿里巴巴集团控股有限公司 | Message storage, delivering method and device and electronic equipment |
| CN107122253A (en) * | 2017-04-27 | 2017-09-01 | 努比亚技术有限公司 | Message status storage method, device and computer-readable recording medium |
| CN107040455B (en) * | 2017-05-27 | 2021-05-11 | 北京思特奇信息技术股份有限公司 | Instant message communication method and system based on redis |
| CN108874560B (en) * | 2018-06-05 | 2022-09-09 | 腾讯音乐娱乐科技（深圳）有限公司 | Method and communication device for communication |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0837405A2 (en) * | 1996-10-16 | 1998-04-22 | Canon Kabushiki Kaisha | File management system of image data |
| US6088706A (en) * | 1996-03-08 | 2000-07-11 | International Business Machines Corp. | System and method for managing replicated data by merging the retrieved records to generate a sequence of modifications |
| CN1632765A (en) * | 2004-12-31 | 2005-06-29 | 大唐微电子技术有限公司 | A flash memory file system management method |
| CN1904887A (en) * | 2006-07-28 | 2007-01-31 | 珠海金山软件股份有限公司 | Method for searching deleted document from assigned catalogue in FAT volume |
-
2009
- 2009-01-21 CN CN2009100772947A patent/CN101783740B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6088706A (en) * | 1996-03-08 | 2000-07-11 | International Business Machines Corp. | System and method for managing replicated data by merging the retrieved records to generate a sequence of modifications |
| EP0837405A2 (en) * | 1996-10-16 | 1998-04-22 | Canon Kabushiki Kaisha | File management system of image data |
| CN1632765A (en) * | 2004-12-31 | 2005-06-29 | 大唐微电子技术有限公司 | A flash memory file system management method |
| CN1904887A (en) * | 2006-07-28 | 2007-01-31 | 珠海金山软件股份有限公司 | Method for searching deleted document from assigned catalogue in FAT volume |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101783740A (en) | 2010-07-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101783740B (en) | Method and device for managing message file | |
| CN111008185B (en) | Data sharing method, system and equipment | |
| CN111078653B (en) | Data storage method, system and equipment | |
| CN108255408B (en) | Data storage method and system | |
| CN111090618B (en) | Data reading method, system and equipment | |
| CN110597859B (en) | Method and device for querying data in pages | |
| CN106951375B (en) | Method and device for deleting snapshot volume in storage system | |
| CN110147204B (en) | Metadata disk-dropping method, device and system and computer-readable storage medium | |
| CN109522283B (en) | Method and system for deleting repeated data | |
| CN107045531A (en) | A kind of system and method for optimization HDFS small documents access | |
| CN103544045A (en) | HDFS-based virtual machine image storage system and construction method thereof | |
| CN102402602A (en) | B+ tree indexing method and device of real-time database | |
| CN109710185A (en) | Data processing method and device | |
| CN113282249B (en) | Data processing method, system, device and medium | |
| CN112748877A (en) | File integration uploading method and device and file downloading method and device | |
| JP4755244B2 (en) | Information generation method, information generation program, and information generation apparatus | |
| CN112800007B (en) | Directory entry expansion method and system suitable for FAT32 file system | |
| CN104516945A (en) | Hadoop distributed file system metadata storage method based on relational data base | |
| CN111241090B (en) | Method and device for managing data index in storage system | |
| CN108271420B (en) | Method for managing files, file system and server system | |
| CN102495838B (en) | Data processing method and data processing device | |
| CN111274616A (en) | Ceph object storage based overall uploading segmented verification implementation method | |
| CN115576947A (en) | Data management method and device, combined library, electronic equipment and storage medium | |
| CN114489481A (en) | Method and system for storing and accessing data in hard disk | |
| CN114461635A (en) | MySQL database data storage method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |