CN102236648B - Information storage system and method - Google Patents
Information storage system and method Download PDFInfo
- Publication number
- CN102236648B CN102236648B CN201010152854.3A CN201010152854A CN102236648B CN 102236648 B CN102236648 B CN 102236648B CN 201010152854 A CN201010152854 A CN 201010152854A CN 102236648 B CN102236648 B CN 102236648B
- Authority
- CN
- China
- Prior art keywords
- information
- data
- storage space
- data element
- inter
- 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
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 piece chain structure.
Background technology
At present, along with becoming increasingly abundant of the class of business of the increasingly extensive and different field of Iron ore concentration and network communication applications, mutual, storage and the inquiry of various information datas become more and more important.
A kind of principal mode of described information data is message.Conventionally, this message is comprised of a plurality of information fields.Therefore, in various service applications field, to the management of described a plurality of information fields, be, important.After receiving infomational message, the storage system of the existing information data for message mode is a plurality of data elements according to the interface definition of standard by message information Data Division, subsequently, to be stored according to the interface definition of described standard be in the reserved storage space of these message information data to described a plurality of data element.For example, as shown in Figure 1, if 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, 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, for depositing respectively A, B, C, D and E.
Along with developing rapidly of various technical fields and the scope of business, the number of the information field in message information data and length are all changing.Yet, well known by persons skilled in the art as follows: existing storage system all relies on database, but the characteristic due to database, causing each storage unit space is that next-door neighbour distributes, this makes when the length of a certain unit need to be expanded, not only relate to self field, also relate to and subsequent all fields.Therefore, in order to meet growing demand, need to modify to the structure of the database in existing system, still, conventionally, database is the core back-up system of whole operation system, and the change of its structure can affect the change of whole system.Therefore, existing settling mode is: at larger 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 of increase backward and deposits.Yet existing settling mode has following shortcoming: storage space is difficult for expansion, and redundancy is larger; The inquiry of information data, store and read equal inconvenience.
Therefore,, along with the growing of business scope and expansion (particularly electronic transaction field), there is following demand: a kind of dynamic extending is provided and is easy to inquiry and information data storage system and the method for access.
Summary of the invention
In order to solve the existing defect of above-mentioned prior art scheme, the present invention proposes a kind of information storage system and method based on piece chain structure.
The object of the invention is to be achieved through the following technical solutions:
An information storage system, described information storage system comprises piece treating apparatus, described treating apparatus is used for the processing that inter-area traffic interarea is scheduled to, and the inter-area traffic interarea after processing is integrally deposited in first storage space,
Wherein, described treating apparatus comprises:
Data element generation module, described data element generation module is used for according to application demand generated data meta-attribute table, and described data element attribute list is deposited sign and the length attribute of information data unit according to standard interface;
Data Identification module, the described inter-area traffic interarea of described Data Identification module for receiving according to described data element attribute list partition, and dividing the increase sign above of each the information data unit splitting out to indicate the attribute of described each information data unit.
In disclosed scheme, preferably, described treating apparatus also comprises retrieval major key setting device in the above, and described retrieval major key setting device is for being placed into the identification major key of the described inter-area traffic interarea after partition foremost storage.
In disclosed scheme, preferably, described information storage system also comprises chain type coupling arrangement in the above, and described chain type coupling arrangement is used for, by chain pointer, the extention of described inter-area traffic interarea is directed to other storage areas,
Wherein, described chain type coupling arrangement comprises:
Extension blocks generating apparatus, generates second storage space according to application demand when described extension blocks generating apparatus need to be expanded for the length of the individual data unit at described inter-area traffic interarea;
Growth data information-storing device, described growth data information-storing device is for being stored in growth data information second storage space of described generation;
Chain pointer generating apparatus, described chain pointer generating apparatus is for being placed on the pointer value that represents the link position of described second storage space in the precalculated position of the described inter-area traffic interarea after partition.
In disclosed scheme, preferably, the feature of described second storage space of generation is consistent with the feature of described first storage space in the above.
In disclosed scheme, preferably, described data element attribute list has additional field in the above, and described additional field is used for representing successive links position.
In disclosed scheme, preferably, when also need to expanding for the data element number at described inter-area traffic interarea, described extension blocks generating apparatus generates second storage space according to application demand in the above; And described growth data information-storing device is also for being stored in the data element information of expansion second storage space of described generation.
Object of the present invention is also achieved through the following technical solutions:
Information storage means, described information storage means comprise the steps:
(A1), based on application demand generated data meta-attribute table, described data element attribute list is deposited sign and the length attribute of information data unit according to standard interface;
(A2) inter-area traffic interarea receiving based on described data element attribute list partition, and dividing the increasing of each information data unit splitting out to identify to indicate the attribute of described each information data unit above;
(A3) the described inter-area traffic interarea after partition is integrally deposited in first storage space, and the identification major key of the described inter-area traffic interarea after partition is placed into foremost storage.
In disclosed scheme, preferably, described information storage means also comprise the steps: in the above
(B1) in the length of individual data unit, need to expand while maybe needing to increase data element number and generate second storage space based on application demand;
(B2) growth data information is stored in described second storage space of generation;
(B3) pointer value that represents the link position of described second storage space is placed on to the precalculated position in the described inter-area traffic interarea after partition.
In disclosed scheme, preferably, the feature of described second storage space of generation is consistent with the feature of described first storage space in the above.
In disclosed scheme, preferably, described data element attribute list has additional field in the above, and described additional field is used for representing successive links position.
In disclosed scheme, preferably, step (B1) also comprises in the above: when the number of data element need to be expanded, based on application demand, generate described second storage space; And step (B2) also comprises: the data element information of expansion is stored in described second storage space of generation.
Information storage system disclosed in this invention and method tool have the following advantages: can be more flexibly and dynamically solve information data element and change the impact to memory system architecture; Not only solved the problem of the difficult expansion of database space and redundancy, also avoided retrieving problem slowly simultaneously.
Accompanying drawing explanation
By reference to 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 the example data meta-attribute structural drawing of the information storage system based on piece chain structure according to an embodiment of the invention;
Fig. 3 is for having according to an embodiment of the invention the example data meta-attribute structural drawing of the information storage system of chain structure;
Fig. 4 is according to the process flow diagram of the information storage means based on piece chain structure of the present invention.
Embodiment
Fig. 2 is the example data meta-attribute structural drawing of the information storage system based on piece chain structure according to an embodiment of the invention.As shown in Figure 2, the invention discloses a kind of information storage system based on piece chain structure.The storage of piece chain comprises following concept: piece storage, i.e. large space field store; Chain type connects, and adopts pointer mode contiguous block storage space.Storage system disclosed in this invention comprises that piece treating apparatus also further comprises chain type coupling arrangement, and described treating apparatus is used for the processing that information data is scheduled to, and depositing in first storage space the data integral body after processing; Described chain type coupling arrangement is for being directed to other storage areas by chain pointer by the extention of described information data.
In storage system disclosed in this invention, described treating apparatus comprises: data element generation module, described data element generation module is used for according to application demand generated data meta-attribute table, and described data element attribute list is deposited sign and the length attribute of information data unit according to standard interface; Data Identification module, the inter-area traffic interarea of described Data Identification module for receiving according to described data element attribute list partition, and dividing the increase sign above of each the information data unit splitting out to indicate the attribute of each information data unit; Retrieval major key setting device, described retrieval major key setting device is for being placed into the identification major key of the described inter-area traffic interarea after partition foremost storage.
For example, if inter-area traffic interarea be ABCDE and according to the interface definition A of standard, take 1 byte, B and take 2 bytes, C and take that 3 bytes, D take 4 bytes, E takies 5 bytes, corresponding to the data element attribute list of this inter-area traffic interarea as shown in Figure 2.In this example, the concrete value of supposing ABCDE data stream is 112123123412345, and two data elements of CD are major key, and data are after treatment: 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 to evaluate a rational length according to the permutation and combination of the most frequently used data element, a space of then opening up such size in database is just enough, thereby can solve preferably the problem that space is difficult for expansion and redundancy.In addition, when needs are retrieved, first according to data element attribute list, obtain major key information, thereby can navigate to fast the record needing, and after finding record, can parse according to the identifier in data element attribute list the content of each data element.
In storage system disclosed in this invention, described chain type coupling arrangement comprises: extension blocks generating apparatus, and described extension blocks generating apparatus for generating second storage space according to application demand when the length of individual data unit need to be expanded; Growth data information-storing device, described growth data information-storing device is for being stored in growth data information second storage space of described generation; Chain pointer generating apparatus, described chain pointer generating apparatus is for being placed on the pointer value that represents the link position of described second storage space in the precalculated position of the data stream after described processing.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, thereby when individual data unit length need to be expanded when whole data stream length need to be expanded, this storage system is not directly after data stream, to expand, but by chain pointer, redundance is pointed to other storage areas, i.e. described the second storage area.Therefore, in the case, data after described data element attribute list and described processing all need to be modified, be that described data element attribute list need to increase a special field, be used for representing successive links position, for example, define a special identifier symbol FF, when system is read FF, need to go link remaining content according to the address of carrying below.
For example, as shown in Figure 3, suppose that the field A in earlier examples has lengthened length according to application demand, from 1 byte, 5 bytes have been lengthened to, after postponing in additional 4 bytes store of the E field storage unit that is set to GGGG in place, and data stream is above stored in the storage unit that position is MMMM, first described data element attribute list is revised as shown in Figure 3.Thus, new storage thes contents are 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 GGGG address location, and FFMMMM represents that its precursor content searches in MMMM address location.
Equally, when needs increase data element number, processing procedure is similar.As from the foregoing, in storage system disclosed in this invention, by above-mentioned chain type, link, the increase of record is converted to the increase of piece storage space and by the link of pointer, thereby can increase neatly the length of record, and without the structure of the core database of the system of modification.Meanwhile, only in needs, just increase new storage block, thereby also solved the problem of the difficult expansion in space and redundancy.In addition, treated data stream has been mentioned foremost by major key, thereby it is slow that the retrieval that the big-length due to field causes can not occur yet.
Fig. 4 is according to the process flow diagram of the information storage means based on piece chain structure of the present invention.As shown in Figure 4, information storage means disclosed by the invention comprise the steps: that (A1) is based on application demand generated data meta-attribute table, and described data element attribute list is deposited sign and the length attribute of information data unit according to standard interface; (A2) inter-area traffic interarea receiving based on described data element attribute list partition, and dividing the increase sign above of each the information data unit splitting out to indicate the attribute of each information data unit; (A3) the described inter-area traffic interarea after partition is integrally deposited in first storage space, and the identification major key of the described inter-area traffic interarea after partition is placed into foremost storage.
As from the foregoing, when using information storage means disclosed in this invention, only need to evaluate a rational length according to the permutation and combination of the most frequently used data element, a space of then opening up such size in core database is just enough, thereby can solve preferably the problem that space is difficult for expansion and redundancy.In addition, when needs are retrieved, first according to data element attribute list, obtain major key information, thereby can navigate to fast the record needing, and after finding record, can parse according to the identifier in data element attribute list the content of each data element.
Information storage means disclosed in this invention also comprise the steps: that (B1) need to expand while maybe needing to increase data element number and generate second storage space based on application demand in the length of individual data unit; (B2) growth data information is stored in described second storage space of generation; (B3) pointer value that represents the link position of described second storage space is placed on to the precalculated position in the described inter-area traffic interarea after 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, thereby when individual data unit length need to be expanded when whole inter-area traffic interarea length need to be expanded, not directly after inter-area traffic interarea, to expand, but by chain pointer, redundance is pointed to other storage areas, i.e. described second storage space.Therefore, in the case, the described inter-area traffic interarea after described data element attribute list and partition all needs to be modified, and described data element attribute list need to increase a special field, for representing successive links position.
Equally, when needs increase data element number, processing procedure is similar.As from the foregoing, in information storage means disclosed in this invention, by above-mentioned chain type, link, the increase of record is converted to the increase of piece storage space and by the link of pointer, thereby can increase neatly the length of record, and without the structure of revising core database.Meanwhile, only in needs, just increase new storage block, thereby also solved the problem of the difficult expansion in space and redundancy.In addition, because treated data stream has been mentioned foremost by major key, thereby it is slow that the retrieval that the big-length due to field causes can not occur 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: in the situation that not departing from purport of the present invention and scope, those skilled in the art can make different variations and modification to the present invention.
Claims (9)
1. an information storage system, described information storage system comprises piece treating apparatus, the processing for inter-area traffic interarea is scheduled to of described treating apparatus, and the inter-area traffic interarea after processing is integrally deposited in first storage space,
Wherein, described treating apparatus comprises:
Data element generation module, described data element generation module is used for according to application demand generated data meta-attribute table, and described data element attribute list is deposited sign and the length attribute of information data unit according to standard interface;
Data Identification module, the described inter-area traffic interarea of described Data Identification module for receiving according to described data element attribute list partition, and dividing the increase sign above of each the information data unit splitting out to indicate the attribute of described each information data unit;
Wherein, described information storage system also comprises chain type coupling arrangement, and described chain type coupling arrangement is for being directed to other storage areas by chain pointer by the extention of described inter-area traffic interarea;
Wherein, described chain type coupling arrangement comprises:
Extension blocks generating apparatus, generates second storage space according to application demand when described extension blocks generating apparatus need to be expanded for the length of the individual data unit at described inter-area traffic interarea;
Growth data information-storing device, described growth data information-storing device is for being stored in growth data information second storage space of described generation;
Chain pointer generating apparatus, described chain pointer generating apparatus is for being placed on the pointer value that represents the link position of described second storage space in the precalculated position of the described inter-area traffic interarea after partition.
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 for being placed into the identification major key of the described inter-area traffic interarea after partition foremost storage.
3. information storage system according to claim 1, is characterized in that, the feature of described second storage space of generation is consistent with the feature of described first storage space.
4. information storage system according to claim 1, is characterized in that, described data element attribute list has additional field, and described additional field is used for representing successive links position.
5. information storage system according to claim 1, is characterized in that, when described extension blocks generating apparatus also need to be expanded for the data element number at described inter-area traffic interarea, according to application demand, generates second storage space; And described growth data information-storing device is also for being stored in the data element information of expansion second storage space of described generation.
6. information storage means, described information storage means comprise the steps:
(A1), based on application demand generated data meta-attribute table, described data element attribute list is deposited sign and the length attribute of information data unit according to standard interface;
(A2) inter-area traffic interarea receiving based on described data element attribute list partition, and dividing the increasing of each information data unit splitting out to identify to indicate the attribute of described each information data unit above;
(A3) the described inter-area traffic interarea after partition is integrally deposited in first storage space, and the identification major key of the described inter-area traffic interarea after partition is placed into foremost storage;
Wherein, described information storage means also comprise the steps:
(B1) in the length of individual data unit, need to expand while maybe needing to increase data element number and generate second storage space based on application demand;
(B2) growth data information is stored in described second storage space of generation;
(B3) pointer value that represents the link position of described second storage space is placed on to the precalculated position in the described inter-area traffic interarea after partition.
7. information storage means according to claim 6, is characterized in that, the feature of described second storage space of generation is consistent with the feature of described first storage space.
8. information storage means according to claim 6, is characterized in that, described data element attribute list has additional field, and described additional field is used for representing successive links position.
9. information storage means according to claim 6, is characterized in that, step (B1) also comprises: when the number of data element need to be expanded, based on application demand, generate described second storage space; And step (B2) also comprises: the data element information of expansion 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 CN102236648A (en) | 2011-11-09 |
| CN102236648B true 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101021846A (en) * | 2006-02-14 | 2007-08-22 | 乐金电子(中国)研究开发中心有限公司 | Method for storing indefinite frame length structural data stream |
| CN101504662A (en) * | 2009-03-13 | 2009-08-12 | 北大方正集团有限公司 | Data conversion method and apparatus |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1936864B (en) * | 2005-09-22 | 2010-09-08 | 康佳集团股份有限公司 | Non-fixed-length record data recognition method |
| CN100478959C (en) * | 2007-05-30 | 2009-04-15 | 北京航空航天大学 | Embedded database storage management method |
| JP5233255B2 (en) * | 2007-11-30 | 2013-07-10 | セイコーエプソン株式会社 | Variable length data storage device, variable length data storage method, variable length data read method and program thereof |
-
2010
- 2010-04-21 CN CN201010152854.3A patent/CN102236648B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101021846A (en) * | 2006-02-14 | 2007-08-22 | 乐金电子(中国)研究开发中心有限公司 | Method for storing indefinite frame length structural data stream |
| CN101504662A (en) * | 2009-03-13 | 2009-08-12 | 北大方正集团有限公司 | Data conversion method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102236648A (en) | 2011-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102707990B (en) | Container based processing method and device | |
| CN103116661B (en) | A kind of data processing method of database | |
| CN104731896B (en) | A kind of data processing method and system | |
| CN106874348B (en) | File storage and index method and device and file reading method | |
| CN100399325C (en) | Data back up and recovering method of embedded data bank | |
| CN104881466B (en) | The processing of data fragmentation and the delet method of garbage files and device | |
| CN103914483B (en) | File memory method, device and file reading, device | |
| CN102142032B (en) | Method and system for reading and writing data of distributed file system | |
| CN103593257B (en) | A kind of data back up method and device | |
| CN105117417A (en) | Read-optimized memory database Trie tree index method | |
| CN103425435B (en) | Disk storage method and disk storage system | |
| CN104731799A (en) | Memory database management device | |
| CN104572781A (en) | Method and device for generating transaction log | |
| JPH1131096A (en) | Data storage/retrieval system | |
| CN107818114A (en) | A kind of data processing method, device and database | |
| JP2015528957A (en) | Distributed file system, file access method, and client device | |
| CN103778120A (en) | Global file identification generation method, generation device and corresponding distributed file system | |
| CN102541982B (en) | Method for organizing and accessing metadata file log | |
| CN100395712C (en) | Source management method for software system | |
| CN110020272A (en) | Caching method, device and computer storage medium | |
| CN102567419A (en) | Mass data storage device and method based on tree structure | |
| CN112860412B (en) | Service data processing method and device, electronic equipment and storage medium | |
| CN104573112A (en) | Page query method and data processing node for OLTP cluster database | |
| CN104636327A (en) | Distributed type stream data system based on incremental computation | |
| CN116662019B (en) | Request distribution method and device, storage medium and electronic 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 |