CN102236648A - Information storage system and method - Google Patents
Information storage system and method Download PDFInfo
- Publication number
- CN102236648A CN102236648A CN2010101528543A CN201010152854A CN102236648A CN 102236648 A CN102236648 A CN 102236648A CN 2010101528543 A CN2010101528543 A CN 2010101528543A CN 201010152854 A CN201010152854 A CN 201010152854A CN 102236648 A CN102236648 A CN 102236648A
- Authority
- CN
- China
- Prior art keywords
- information
- data
- storage space
- information storage
- data element
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses an information storage system and an information storage method. The information storage system comprises a processing device, and further comprises a chain connecting device, wherein the processing device is use for performing preset processing on information data, and uniformly storing the processed data into a first block storage space; and the chain connecting device is used for pointing the additional part of the information data to other storage regions by a chain pointer. By the information storage system and the information storage method provided by the invention, not only the problem that a database space is difficult to expand and easily redundant is solved, but also the problem of low retrieval speed is solved.
Description
Technical field
The present invention relates to information storage system and method, more specifically, relate to information storage system and method based on the piece chain structure.
Background technology
At present, along with robot calculator is used and the becoming increasingly abundant of the class of business of the increasingly extensive and different field of network communication applications, mutual, the storage and the inquiry of various information datas become more and more important.
A kind of principal mode of described information data is a message.Usually, this message is made up of a plurality of information fields.Therefore, in the various service applications field, be important to the management of described a plurality of information fields.After receiving infomational message, the storage system of existing information data at message mode is split as a plurality of data elements according to the interface definition of standard with the message information data, subsequently, to be stored in the interface definition according to described standard be in the storage space reserved of these message information data to described a plurality of data element.For example, as shown in Figure 1, if the message information data stream is ABCDE and takies 1 byte, B according to the interface definition A of described standard and take 2 bytes, C and take that 3 bytes, D take 4 bytes, E takies 5 bytes, then existing storage system can have been allocated 5 storage unit (being respectively 1 byte, 2 bytes, 3 bytes, 4 bytes and 5 bytes) in advance, is used for depositing respectively A, B, C, D and E.
Along with developing rapidly of the various technical fields and the scope of business, the number of the information field in the message information data and length are all changing.Yet, following is well known by persons skilled in the art: existing storage system all relies on database, but because the characteristic of database, causing each storage unit space all is that the next-door neighbour distributes, this makes when the length of a certain unit need be expanded, not only relate to self field, also relate to all fields thereafter.Therefore, in order to satisfy growing demand, need make amendment to the structure of the database in the existing system, still, usually, database is the core back-up system of whole service system, and the change of its structure can influence the change of total system.Therefore, existing settling mode is: at bigger retaining space of last design of every record, if increased newer field, just directly sternward place; If the extended length of existing field just splits out the length that increases backward and deposits.Yet existing settling mode has following shortcoming: storage space is difficult for expansion, and redundancy is bigger; The inquiry of information data, store and read equal inconvenience.
Therefore, along with the growing of business field and expansion (particularly electronic transaction field), there is following demand: but a kind of dynamic expansion is provided and is easy to inquire about information data storage system and method with access.
Summary of the invention
In order to solve the existing defective of above-mentioned prior art scheme, the present invention proposes a kind of information storage system and method based on the piece chain structure.
The objective of the invention is to be achieved through the following technical solutions:
A kind of information storage system, described information storage system comprises the piece treating apparatus, described treating apparatus is used for processing that inter-area traffic interarea is scheduled to, and the inter-area traffic interarea after will handling integrally deposits in first storage space,
Wherein, described treating apparatus comprises:
Data element generation module, described data element generation module are used for generating the data element attribute list according to application demand, and described data element attribute list is deposited the sign and the length attribute of information data unit according to standard interface;
Data Identification module, described Data Identification module are used for the described inter-area traffic interarea that partition receives according to described data element attribute list, and increase sign to indicate the attribute of described each information data unit in the front of each information data unit that branch splits out.
In the disclosed in the above scheme, preferably, described treating apparatus also comprises retrieval major key setting device, and described retrieval major key setting device is used for the identification major key of the described inter-area traffic interarea after the partition is placed into the foremost storage.
In the disclosed in the above scheme, preferably, described information storage system also comprises the chain type coupling arrangement, and described chain type coupling arrangement is used for by chain pointer the extention of described inter-area traffic interarea being directed to other storage areas,
Wherein, described chain type coupling arrangement comprises:
Extension blocks generating apparatus, described extension blocks generating apparatus are used for generating second storage space according to application demand when the length of the individual data unit of described inter-area traffic interarea need be expanded;
Growth data information-storing device, described growth data information-storing device are used for the second piece storage space of growth data information stores in described generation;
Chain pointer generating apparatus, described chain pointer generating apparatus be used for will described second storage space of expression the pointer value of link position be placed on the precalculated position of the described inter-area traffic interarea after the partition.
In the disclosed in the above scheme, preferably, the feature of described second storage space of generation is consistent with the feature of described first storage space.
In the disclosed in the above scheme, preferably, described data element attribute list has additional field, and described additional field is used to represent the successive links position.
In the disclosed in the above scheme, preferably, described extension blocks generating apparatus also is used for generating second storage space according to application demand when the data element number of described inter-area traffic interarea need be expanded; And described growth data information-storing device also is used for the expanded data metamessage is stored in second storage space of described generation.
Purpose of the present invention also is achieved through the following technical solutions:
A kind of information storage means, described information storage means comprise the steps:
(A1) generate the data element attribute list based on application demand, described data element attribute list is deposited the sign and the length attribute of information data unit according to standard interface;
(A2) inter-area traffic interarea that partition receives based on described data element attribute list, and increase sign to indicate the attribute of described each information data unit in the front of each information data unit that branch splits out;
(A3) the described inter-area traffic interarea after will breaking integrally deposits in first storage space, and the identification major key of the described inter-area traffic interarea after will breaking is placed into the foremost storage.
In the disclosed in the above scheme, preferably, described information storage means also comprise the steps:
(B1) need expand when maybe needing to increase the data element number in the length of individual data unit and generate second storage space based on application demand;
(B2) with the growth data information stores in described second storage space that generates;
(B3) pointer value that will represent the link position of described second storage space is placed on the precalculated position in the described inter-area traffic interarea after the partition.
In the disclosed in the above scheme, preferably, the feature of described second storage space of generation is consistent with the feature of described first storage space.
In the disclosed in the above scheme, preferably, described data element attribute list has additional field, and described additional field is used to represent the successive links position.
In the disclosed in the above scheme, preferably, step (B1) also comprises: generate described second storage space based on application demand when the number of data element need be expanded; And step (B2) also comprises: the expanded data metamessage is stored in described second storage space of generation.
Information storage system disclosed in this invention and method have following advantage: can be more flexibly and dynamically solve the information data element and change impact to memory system architecture; Not only solve simultaneously database space and be difficult for expansion and redundant problem, also avoided retrieving problem slowly.
Description of drawings
In conjunction with the accompanying drawings, technical characterictic of the present invention and advantage will be understood better by those skilled in the art, wherein:
Fig. 1 is the storage node composition of existing information storage system;
Fig. 2 is according to an embodiment of the invention based on the example data meta-attribute structural drawing of the information storage system of piece chain structure;
Fig. 3 is for having the example data meta-attribute structural drawing of the information storage system of chain structure according to an embodiment of the invention;
Fig. 4 is the process flow diagram according to the information storage means based on the piece chain structure of the present invention.
Embodiment
Fig. 2 is according to an embodiment of the invention based on the example data meta-attribute structural drawing of the information storage system of piece chain structure.As shown in Figure 2, the invention discloses a kind of information storage system based on the piece chain structure.The storage of piece chain comprises following notion: piece storage, i.e. large space field store; Chain type connects, and promptly adopts pointer mode contiguous block storage space.Storage system disclosed in this invention comprises the piece treating apparatus and further comprises the chain type coupling arrangement, and described treating apparatus is used for processing that information data is scheduled to, and the depositing in first storage space of the data integral body after will handling; Described chain type coupling arrangement is used for by chain pointer the extention of described information data being directed to other storage areas.
In storage system disclosed in this invention, described treating apparatus comprises: the data element generation module, described data element generation module is used for generating the data element attribute list according to application demand, and described data element attribute list is deposited the sign and the length attribute of information data unit according to standard interface; Data Identification module, described Data Identification module are used for the inter-area traffic interarea that partition receives according to described data element attribute list, and increase sign to indicate the attribute of each information data unit in the front of each information data unit that branch splits out; Retrieval major key setting device, described retrieval major key setting device are used for the identification major key of the described inter-area traffic interarea after the partition is placed into the foremost storage.
For example, if inter-area traffic interarea be ABCDE and take 1 byte, B according to the interface definition A of standard and take 2 bytes, C and take that 3 bytes, D take 4 bytes, E takies 5 bytes, then as shown in Figure 2 corresponding to the data element attribute list of this inter-area traffic interarea.In this example, the concrete value of supposing the ABCDE data stream is 112123123412345, and two data elements of CD are major key, and then data after treatment are: 3F1234F12341F12F125F12345, the data after this processing only take a field.
As from the foregoing, when the core database of design system disclosed in this invention, only need assess out a rational length according to the permutation and combination of the most frequently used data element, a space of opening up such size then in database is just enough, is difficult for expansion and redundant problem thereby can solve the space preferably.In addition, when needs are retrieved, at first obtain major key information, thereby can navigate to the record that needs fast, and find after the record, can parse the content of each data element according to the identifier in the data element attribute list according to the data element attribute list.
In storage system disclosed in this invention, described chain type coupling arrangement comprises: extension blocks generating apparatus, described extension blocks generating apparatus are used for generating second storage space according to application demand when the length of individual data unit need be expanded; Growth data information-storing device, described growth data information-storing device are used for the second piece storage space of growth data information stores in described generation; Chain pointer generating apparatus, described chain pointer generating apparatus are used for the pointer value of the link position of described second storage space of expression is placed on the precalculated position of described processed data stream.Wherein, the feature of second of described generation storage space is consistent with the feature of described first storage space.
In storage system disclosed in this invention, when thereby individual data unit length need be expanded when making that entire stream length need be expanded, this storage system is not directly to expand in the data stream back, but by chain pointer redundance is pointed to other storage areas, promptly described second storage area.Therefore, in the case, data after described data element attribute list and the described processing all need to be modified, be that described data element attribute list need increase a special field, be used to represent the successive links position, for example, define a special identifier symbol FF, when system reads FF, need go to link remaining content according to the address of carrying later.
For example, as shown in Figure 3, suppose that field A in the earlier examples is according to the application demand length that extended, 5 bytes have been lengthened to from 1 byte, in the storage unit of back E field additional 4 bytes store GGGG of being changed on the throne of postponing, and the data stream of front is stored in the storage unit that the position is MMMM, then at first described data element attribute list is revised as shown in Figure 3.Thus, new memory contents is as follows: the content of address location MMMM is: 3F1234F12341F123452F125F1FFGGGG; The content of address location GGGG is: FFMMMM5F2345.Wherein, FFGGGG represents that its follow-up content searches in the GGGG address location, and FFMMMM represents that its precursor content searches in the MMMM address location.
Equally, when needs increased the data element number, processing procedure was similar.As from the foregoing, in storage system disclosed in this invention,, the increase of record is converted to the increase of piece storage space and the link by pointer by the link of above-mentioned chain type, thereby can increase the length of record neatly, and need not the structure of the core database of the system of revising.Simultaneously, only in needs, just increase new storage block, be difficult for expansion and redundant problem thereby also solved the space.In addition, treated data stream has been mentioned the foremost with major key, thereby it is slow that the retrieval that the big length owing to field causes can not take place yet.
Fig. 4 is the process flow diagram according to the information storage means based on the piece chain structure of the present invention.As shown in Figure 4, information storage means disclosed by the invention comprise the steps: that (A1) generates the data element attribute list based on application demand, and described data element attribute list is deposited the sign and the length attribute of information data unit according to standard interface; (A2) inter-area traffic interarea that partition receives based on described data element attribute list, and increase sign to indicate the attribute of each information data unit in the front of each information data unit that branch splits out; (A3) the described inter-area traffic interarea after will breaking integrally deposits in first storage space, and the identification major key of the described inter-area traffic interarea after will breaking is placed into the foremost storage.
As from the foregoing, when using information storage means disclosed in this invention, only need assess out a rational length according to the permutation and combination of the most frequently used data element, a space of opening up such size then in core database is just enough, is difficult for expansion and redundant problem thereby can solve the space preferably.In addition, when needs are retrieved, at first obtain major key information, thereby can navigate to the record that needs fast, and find after the record, can parse the content of each data element according to the identifier in the data element attribute list according to the data element attribute list.
Information storage means disclosed in this invention comprise the steps: also that (B1) need expand when maybe needing to increase the data element number in the length of individual data unit and generate second storage space based on application demand; (B2) with the growth data information stores in described second storage space that generates; (B3) pointer value that will represent the link position of described second storage space is placed on the precalculated position in the described inter-area traffic interarea after the partition.Wherein, the feature of described second storage space of generation is consistent with the feature of described first storage space.
In information storage means disclosed in this invention, when thereby individual data unit length need be expanded when making that whole inter-area traffic interarea length need be expanded, not directly to expand in the inter-area traffic interarea back, but by chain pointer redundance is pointed to other storage areas, promptly described second storage space.Therefore, in the case, the described inter-area traffic interarea after described data element attribute list and the partition all needs to be modified, and promptly described data element attribute list need increase a special field, is used to represent the successive links position.
Equally, when needs increased the data element number, processing procedure was similar.As from the foregoing, in information storage means disclosed in this invention,, the increase of record is converted to the increase of piece storage space and the link by pointer by the link of above-mentioned chain type, thereby can increase the length of record neatly, and need not to revise the structure of core database.Simultaneously, only in needs, just increase new storage block, be difficult for expansion and redundant problem thereby also solved the space.In addition, because treated data stream mentioned the foremost with major key, thereby it is slow that the retrieval that the big length owing to field causes can not take place yet.
Although the present invention is described by above-mentioned preferred implementation, its way of realization is not limited to above-mentioned embodiment.Should be realized that: under the situation that does not break away from purport of the present invention and scope, those skilled in the art can make different variations and modification to the present invention.
Claims (11)
1. information storage system, described information storage system comprises the piece treating apparatus, described treating apparatus is used for processing that inter-area traffic interarea is scheduled to, and the inter-area traffic interarea after will handling integrally deposits in first storage space,
Wherein, described treating apparatus comprises:
Data element generation module, described data element generation module are used for generating the data element attribute list according to application demand, and described data element attribute list is deposited the sign and the length attribute of information data unit according to standard interface;
Data Identification module, described Data Identification module are used for the described inter-area traffic interarea that partition receives according to described data element attribute list, and increase sign to indicate the attribute of described each information data unit in the front of each information data unit that branch splits out.
2. information storage system according to claim 1 is characterized in that, described treating apparatus also comprises retrieval major key setting device, and described retrieval major key setting device is used for the identification major key of the described inter-area traffic interarea after the partition is placed into the foremost storage.
3. according to the described information storage system of any claim among the claim 1-2, it is characterized in that, described information storage system also comprises the chain type coupling arrangement, and described chain type coupling arrangement is used for by chain pointer the extention of described inter-area traffic interarea being directed to other storage areas
Wherein, described chain type coupling arrangement comprises:
Extension blocks generating apparatus, described extension blocks generating apparatus are used for generating second storage space according to application demand when the length of the individual data unit of described inter-area traffic interarea need be expanded;
Growth data information-storing device, described growth data information-storing device are used for the second piece storage space of growth data information stores in described generation;
Chain pointer generating apparatus, described chain pointer generating apparatus be used for will described second storage space of expression the pointer value of link position be placed on the precalculated position of the described inter-area traffic interarea after the partition.
4. information storage system according to claim 3 is characterized in that, the feature of described second storage space of generation is consistent with the feature of described first storage space.
5. information storage system according to claim 3 is characterized in that, described data element attribute list has additional field, and described additional field is used to represent the successive links position.
6. information storage system according to claim 3 is characterized in that, described extension blocks generating apparatus also is used for generating second storage space according to application demand when the data element number of described inter-area traffic interarea need be expanded; And described growth data information-storing device also is used for the expanded data metamessage is stored in second storage space of described generation.
7. information storage means, described information storage means comprise the steps:
(A1) generate the data element attribute list based on application demand, described data element attribute list is deposited the sign and the length attribute of information data unit according to standard interface;
(A2) inter-area traffic interarea that partition receives based on described data element attribute list, and increase sign to indicate the attribute of described each information data unit in the front of each information data unit that branch splits out;
(A3) the described inter-area traffic interarea after will breaking integrally deposits in first storage space, and the identification major key of the described inter-area traffic interarea after will breaking is placed into the foremost storage.
8. information storage means according to claim 7 is characterized in that described information storage means also comprise the steps:
(B1) need expand when maybe needing to increase the data element number in the length of individual data unit and generate second storage space based on application demand;
(B2) with the growth data information stores in described second storage space that generates;
(B3) pointer value that will represent the link position of described second storage space is placed on the precalculated position in the described inter-area traffic interarea after the partition.
9. information storage means according to claim 8 is characterized in that, the feature of described second storage space of generation is consistent with the feature of described first storage space.
10. information storage means according to claim 8 is characterized in that, described data element attribute list has additional field, and described additional field is used to represent the successive links position.
11. information storage means according to claim 8 is characterized in that, step (B1) also comprises: generate described second storage space based on application demand when the number of data element need be expanded; And step (B2) also comprises: the expanded data metamessage is stored in described second storage space of generation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010152854.3A CN102236648B (en) | 2010-04-21 | 2010-04-21 | Information storage system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010152854.3A CN102236648B (en) | 2010-04-21 | 2010-04-21 | Information storage system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102236648A true CN102236648A (en) | 2011-11-09 |
| CN102236648B CN102236648B (en) | 2014-04-16 |
Family
ID=44887306
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010152854.3A Active CN102236648B (en) | 2010-04-21 | 2010-04-21 | Information storage system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102236648B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1936864A (en) * | 2005-09-22 | 2007-03-28 | 康佳集团股份有限公司 | Non-fixed-length record data recognition method |
| CN101021846A (en) * | 2006-02-14 | 2007-08-22 | 乐金电子(中国)研究开发中心有限公司 | Method for storing indefinite frame length structural data stream |
| CN101055589A (en) * | 2007-05-30 | 2007-10-17 | 北京航空航天大学 | Embedded database storage management method |
| US20090144348A1 (en) * | 2007-11-30 | 2009-06-04 | Seiko Epson Corporation | Variable Length Data Storage Device, Variable Length Data Storage Method, Variable Length Data Reading Method, and a Program for the Same |
| CN101504662A (en) * | 2009-03-13 | 2009-08-12 | 北大方正集团有限公司 | Data conversion method and apparatus |
-
2010
- 2010-04-21 CN CN201010152854.3A patent/CN102236648B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1936864A (en) * | 2005-09-22 | 2007-03-28 | 康佳集团股份有限公司 | Non-fixed-length record data recognition method |
| CN101021846A (en) * | 2006-02-14 | 2007-08-22 | 乐金电子(中国)研究开发中心有限公司 | Method for storing indefinite frame length structural data stream |
| CN101055589A (en) * | 2007-05-30 | 2007-10-17 | 北京航空航天大学 | Embedded database storage management method |
| US20090144348A1 (en) * | 2007-11-30 | 2009-06-04 | Seiko Epson Corporation | Variable Length Data Storage Device, Variable Length Data Storage Method, Variable Length Data Reading Method, and a Program for the Same |
| CN101504662A (en) * | 2009-03-13 | 2009-08-12 | 北大方正集团有限公司 | Data conversion method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102236648B (en) | 2014-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP4155966A1 (en) | Blockchain data indexing method, and blockchain data storage method | |
| CN102799679B (en) | Hadoop-based massive spatial data indexing updating system and method | |
| CN106981024B (en) | Transaction limit calculation processing system and processing method thereof | |
| CN104731799A (en) | Memory database management device | |
| CN102142032B (en) | Method and system for reading and writing data of distributed file system | |
| CN102508913A (en) | Cloud computing system with data cube storage index structure | |
| CN101021858A (en) | Data storing method and device, and data seeking, adding and deleting method | |
| CN101763415B (en) | Method and device for generating B tree index of database | |
| JPH1131096A (en) | Data storage/retrieval system | |
| CN112947856A (en) | Memory data management method and device, computer equipment and storage medium | |
| CN107818114A (en) | A kind of data processing method, device and database | |
| CN112000847A (en) | GPU parallel-based adaptive radix tree dynamic indexing method | |
| CN100395712C (en) | Source management method for software system | |
| CN103778120A (en) | Global file identification generation method, generation device and corresponding distributed file system | |
| CN102694878B (en) | Sectional ID (Identity) distributing method | |
| CN102567419B (en) | Mass data storage device and method based on tree structure | |
| CN102609492A (en) | Metadata management method supporting variable table modes | |
| CN104573112A (en) | Page query method and data processing node for OLTP cluster database | |
| CN110020272A (en) | Caching method, device and computer storage medium | |
| CN108984626B (en) | Data processing method and device and server | |
| CN104636327A (en) | Distributed type stream data system based on incremental computation | |
| CN101944121A (en) | Generating method of finite state automaton, keyword matching method and devices and equipment | |
| CN116662019A (en) | Request distribution method and device, storage medium and electronic device | |
| CN102236648B (en) | Information storage system and method | |
| JP6006740B2 (en) | Index management device |
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 |