CN107656876A - Date storage method and device, computer-readable recording medium, terminal - Google Patents
Date storage method and device, computer-readable recording medium, terminal Download PDFInfo
- Publication number
- CN107656876A CN107656876A CN201710974467.XA CN201710974467A CN107656876A CN 107656876 A CN107656876 A CN 107656876A CN 201710974467 A CN201710974467 A CN 201710974467A CN 107656876 A CN107656876 A CN 107656876A
- Authority
- CN
- China
- Prior art keywords
- data
- array
- storage
- multidimensional
- stored
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0207—Addressing or allocation; Relocation with multidimensional access, e.g. row/column, matrix
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A kind of date storage method and device, computer-readable recording medium, terminal, methods described include：Obtain the information of array to be stored；The type of the data of each node is identical or different in the array；Set storage original position, data storage direction and unit length of the array in default multidimensional data space；On the data storage direction, since the storage original position, the data of corresponding node in the array are stored respectively every coordinate position corresponding to the unit length, until the data of all nodes all complete by storage in the array.Above-mentioned scheme, the flexibility of array data operation can be improved.
Description
Technical field
, can more particularly to a kind of date storage method and device, computer the present invention relates to technical field of data processing
Read storage medium, terminal.
Background technology
Data storage, it is the letter that data flow is required to look up in caused temporary file or process in process
Breath.Conventional storage medium is Disk and tape.Storage organization mode is because of storage medium and different.Data are only in order on tape
File mode accesses；Then sequential access or direct access method can be used on disk by requirement.Data storage method with
Data file tissue is closely related, and its key is corresponding relation between the logical AND physical sequential of foundation record, determines storage
Location, to improve data access speed.
On computer programming language, array is the set for arranging the element of same data type in certain sequence,
One naming of limited individual type identical variable, then distinguishes the set of their variable with numbering, and this name is
For array name, numbering is referred to as subscript.Forming each variable of array turns into the element of component, also referred to as array of array, sometimes
Also referred to as subscript variable.In programming, in order to handle conveniently, some variables with same type are pressed orderly form
A kind of form organized, the collection of the homogeneous data element of these arranged in sequence are collectively referred to as array.
But the storage method of existing array data, the problem of very flexible be present.
The content of the invention
The technical problem that the embodiment of the present invention solves is how to realize the flexibility of array data operation.
To solve the above problems, the embodiments of the invention provide a kind of date storage method, methods described includes：
Obtain the information of array to be stored；The type of the data of each node is identical or different in the array；
Set storage original position, data storage direction and unit of the array in default multidimensional data space
Length；
On the data storage direction, since the storage original position, every coordinate bit corresponding to the unit length
The data for storing corresponding node in the array respectively are put, until the data of all nodes all complete by storage in the array.
Alternatively, methods described also includes：
When deleting the data in the array, the data that will be stored in corresponding coordinate position in the multidimensional memory space
Deleted.
Alternatively, methods described also includes：
When inserting data into the array, the storage of corresponding adjacent node data in the multidimensional data memory space
The data being inserted into are stored in the adjacent memory space position of position.
Alternatively, methods described also includes：
In the multidimensional data space on other storage directions, the data in the array are backed up.
The embodiment of the present invention additionally provides a kind of data storage device, including：
Acquiring unit, suitable for obtaining the information of array to be stored；In the array type of the data of each node it is identical or
It is different；
Setting unit, suitable for setting storage original position, data of the array in default multidimensional data space
Store direction and unit length；
Execution unit is stored, suitable on the data storage direction, since the storage original position, every the unit
Coordinate position corresponding to length stores the data of corresponding node in the array respectively, up to the number of all nodes in the array
Completed according to all storages.
Alternatively, described device also includes：
Data delete unit, suitable for when deleting the data in the array, by corresponding seat in the multidimensional memory space
The data stored in cursor position are deleted.
Alternatively, described device also includes：
Data interpolating unit, suitable for when into the array insert data when, in the multidimensional data memory space corresponding to
The data being inserted into are stored in the adjacent memory space position of the storage location of adjacent node data.
Alternatively, described device also includes：
Backup units, suitable on other storage directions, backing up the number in the array in the multidimensional data space
According to.
The embodiment of the present invention additionally provides a kind of computer-readable recording medium, is stored thereon with computer instruction, described
Computer instruction run when any of the above-described described in date storage method the step of.
The embodiment of the present invention additionally provides a kind of terminal, including memory and processor, and energy is stored on the memory
Enough computer instructions run on the processor, the processor perform above-mentioned data when running the computer instruction
The step of storage method.
Compared with prior art, technical scheme has the following advantages that：
Above-mentioned scheme, by setting storage original position of the array in default multidimensional data space, number
According to storage direction and unit length, and described in multidimensional memory space on data storage direction, from the storage start bit
Beginning is put, the data of corresponding node in the array are stored respectively every coordinate position corresponding to the unit length so that number
Each node data in group can not be limited by data type, and can be according to the storage in multidimensional data space
The information of original position, data storage direction and unit length, can be to determine the coordinate position of data in array, thus can be with
While the rapid and convenient for ensuring array data accesses, the flexibility of data storage operations is improved.
Further, when the data in array are deleted and during insertion operation, it is only necessary to by data to be deleted from
Corresponding position coordinates is deleted in the multidimensional data memory space, or the adjacent storage of the position coordinates in adjacent node is empty
Between it is middle be stored in the data that are inserted into, without carrying out shifting function to the data in data, therefore data manipulation will not be produced
The generation for the situation such as cross the border, thus can further improve the flexibility of data manipulation.
Brief description of the drawings
Fig. 1 is a kind of flow chart of date storage method in the embodiment of the present invention；
Fig. 2 is the storage of array that a kind of date storage method in the embodiment of the present invention is stored in multidimensional memory space
The example schematic of position；
Fig. 3 is a kind of structural representation of data storage device in the embodiment of the present invention.
Embodiment
Prior art, array is typically by including following several inscapes：
（1）The initial address of array starting address, i.e. array in Installed System Memory.
（2）Data unit lengths, also referred to as data type.Wherein, data unit lengths and system platform are closely related,
Such as integer（int）The length of type can be 32 or 64 in different operating system, and integer type and character
（char）The length of type also differs.
（3）The data volume of array, i.e., the quantity of data included in array.
Array described above, the problem of following several respects during computer programming be present：
（1）The unit length of data can not be changed arbitrarily in array.In traditional program coding mode, corresponding node in array
The acquisitions of data all pass through（Initial address+data unit lengths * data bit）Mode obtain.Once data unit lengths
Change, i.e., if data type difference, can lead to not the data for getting respective nodes in array, or can not
Quickly and easily get corresponding data.
（2）The data volume of array can not changed arbitrarily.The information of the data volume of array need initialize array when
Time is determined.When the data volume of array changes, operation may occur subsequently in the operating process to array and cross the border
Situations such as.
In summary, just because of the characteristic of unit length, the flexibility for causing array data operation are greatly limited
System.
To solve the above-mentioned problems in the prior art, the technical scheme that the embodiment of the present invention uses passes through described in setting
Storage original position, data storage direction and unit length of the array in default multidimensional data space, and more
It is corresponding every the unit length since the storage original position described in dimensionization memory space on data storage direction
Coordinate position store the data of corresponding node in the array respectively so that each node data in array can not be counted
According to the limitation of type, thus the flexibility of data manipulation can be improved.
It is understandable to enable the above objects, features and advantages of the present invention to become apparent, below in conjunction with the accompanying drawings to the present invention
Specific embodiment be described in detail.
Fig. 1 shows a kind of flow chart of date storage method in the embodiment of the present invention.A kind of data as shown in Figure 1
Storage method, suitable for the data storage in array in default multidimensional data space, can specifically be included as follows
The step of：
Step S101：Obtain the information of array to be stored.
In specific implementation, array to be stored can include multiple data arranged in sequence, or can also incite somebody to action
The data of corresponding positions sequence are referred to as the data of respective nodes in array.
Wherein, the data type of the data of respective nodes can be with identical in array, can also be different.For example, can basis
Actual needs, character type, integer type or other types etc., this area are arranged to by the data type of each node in array
Technical staff can choose data type corresponding to the data of each node in array according to the actual needs, do not limit herein
System.
Step S102：Set storage original position, data of the array in default multidimensional data space
Store direction and unit length.
In specific implementation, there are more than three reference axis to intersect at a point in multidimensional data space.For example,
When multidimensional data space is three-dimensional data storage space, there is X-axis, Y-axis and Z axis three to intersect at a point for it, i.e.,
Intersect at the reference axis of the origin of coordinates.Wherein, the reference axis of more than three in multidimensional data space both can with orthogonal,
Non-orthogonal mode can also be used, simply in the case that the reference axis of more than three is orthogonal, calculates multidimensional memory space
In corresponding coordinate position when, can be with simplified operation amount, with the multidimensional data space phase using non-orthogonal reference axis
Than can further improve the access speed of array data, namely improve the convenience of data access.
In specific implementation, storage original position of the array in default multidimensional data space, as array
In make number one sequence data in multidimensional data space coordinate position.For example, multidimensional data space is
When three-dimensional, the storage original position in data space can use the coordinate of corresponding X-axis, Y-axis and Z axis to be identified.
The side where store path of the data in multidimensional data space in data storage direction, i.e. array
To it can be uniquely determined by the parameter of respective numbers.For example, in three-dimensional data storage space, data storage side
To the coordinate that can use the X-axis for storing original position, Y-axis and Z axis, and in the storage direction and X-axis, Y-axis and Z axis
The angle of any two reference axis is determined.
Unit length is the data of two neighboring node in array in multidimensional data space between coordinate position
Length interval, namely the array adjacent two storages coordinate positions on the store path on multidimensional data space
Between air line distance.It follows that the unit length in the embodiment of the present invention and the data type in array in the prior art
It is different.
It is to be herein pointed out setting storage starting of the array in default multidimensional data space
, it is necessary to avoid data from storage location being present in multidimensional data space when position, data storage direction and unit length
Between conflict.In other words, grown by the storage original position in multidimensional data space, data storage direction and unit
There cannot be other data in storage location determined by degree on unique store path, otherwise, it would be possible to cause one
More than two data are stored with individual storage location.Wherein, the array is completed in default multidimensional data space
In storage original position, data storage direction and unit length setting operation, it is meant that complete the array in multidimensional
Change the initial work in data space.
Step S103：On the data storage direction, since the storage original position, every the unit length
Corresponding coordinate position stores the data of corresponding node in the array respectively, until the data of all nodes are complete in the array
Portion's storage is completed.
In specific implementation, when it is determined that data storage direction of the array in multidimensional memory space, storage original position,
The information of unit length, the data of each node in array can be calculated in multidimensional storage with the corresponding calculation formula of use
In storage location in space, namely storage direction, since being stored original position, every coordinate corresponding to the unit length
Position, and by the data storage of each node in array in corresponding storage location.
From the above description it can be seen that array is when multidimensional data space is stored, each node in array
The storage location of data is unrelated with the type of each node data in array, and therefore, the data type of each node will be not required in array
Keep identical, can be configured according to the actual needs, therefore the flexibility of array data storage can be improved.
Meanwhile it is determined that storage original position, data of the array in default multidimensional data space are deposited
Store up direction and during unit length, use corresponding calculation formula can be rapidly to obtain depositing for data of each node in array
Storage space is put, and can rapidly access the data of arbitrary node in the array, thus can improve the convenience of data access.
Referring to Fig. 2, using the date storage method in the embodiment of the present invention, data x1, x2 of each nodes of array X, x3,
The store path of x4, x5, x6, x7 in three-dimensional data storage space is D1, data y1, y2, y3, y4 of each node in array Y
Store path in three-dimensional data storage space is D2, and data z1, z2, z3, z4 of each node deposit in three-dimensional data in array Z
The store path stored up in space is D3.
In specific implementation, storage original position, data of the set array in multidimensional data space are deposited
It can be more than one to store up direction and unit length.For example, data in array can be visited according to data according to the actual needs
Ask that authority is respectively divided into corresponding some, and the data for setting various pieces set corresponding storage original position, deposited
Store up direction and unit length.Wherein, storage direction can be with identical with unit length corresponding to the data of various pieces in array
Can be different, as long as set storage direction and unit length will not cause the conflict of data storage location.
, can also be by data x1, x2, x3, x4, x5, x6, x7 by store path D1, D2 and D3 continuing with referring to Fig. 2
The data in array with the first access rights are interpreted as, data y1, y2, y3, y4 are interpreted as to have second to visit in the array
The data of authority are asked, and data z1, z2, z3, z4 are interpreted as to the data in the array with the 3rd access rights.Such a data
Storage mode, can be access rights corresponding to the data setting in array according to the actual needs, so as to control user's logarithm
The access of data in group.For example, the data of the different piece in array are set into different storage dimensions according to access rights
Deng so that the user with different access authority can only access the data that corresponding dimension stores, so as to be easy to data
Access operation be managed.
In specific implementation, the method in the embodiment of the present invention can also include：
Step S104：When deleting the data in the array, by corresponding coordinate position in the multidimensional memory space
The data of storage are deleted.
In specific implementation, when the data of at least one node in the array stored in needing to multidimensional memory space
When carrying out deletion action, storage position of the data for the node that needs are deleted in multidimensional data space can be determined first
The information put, and the data stored at identified storage location are deleted.
In specific implementation, the method in the embodiment of the present invention can also include：
Step S105：When inserting data into the array, the corresponding adjacent node in the multidimensional data memory space
The data being inserted into are stored in the adjacent memory space position of the storage location of data.
In specific implementation, when needing to insert data in array, it can obtain and be inserted into data in the array
The storage location of two adjacent nodes, it is determined that storage location of the two neighboring node in multidimensional data space
When, default rule can be used adjacent in corresponding storage location of the two neighboring node in multidimensional data space
Memory space in determine the data that a coordinate position storage is inserted into.For example, when two neighboring node is in multidimensional number
When y-axis coordinate according to the storage location in memory space is y=0, then by the insertion data in multidimensional data space
Storage location y after coordinate be set to y=1.
It is to be herein pointed out can using in the end interpolation data of array as inserting data into the array
A kind of special case.When needing to add the data of more than one node at the end of array, it is only necessary to it is determined that corresponding storage direction
On storage location, by data to be added be respectively stored in corresponding to storage location.
In specific implementation, the method in the embodiment of the present invention can also include：
Step S106：In the multidimensional data space on other storage directions, the data in the array are backed up.
In specific implementation, in order to improve the reliability of data storage operations, directions can be stored in identified other,
Namely the data of each node in the array are stored in other identified store paths.Wherein, in the multidimensional data
The mode of each node data in the array is stored in memory space on other storage directions, refer to step S101 to S103's
Introduce, will not be repeated here.
The above-mentioned date storage method in the embodiment of the present invention is described in detail, below by above-mentioned method
Corresponding device is introduced.
Fig. 3 shows a kind of structure of data storage device in the embodiment of the present invention.Referring to Fig. 3, the embodiment of the present invention
In a kind of data storage device 30, can include acquiring unit 301, setting unit 302 and storage execution unit 303, wherein：
The acquiring unit 301, suitable for obtaining the information of array to be stored；The type of the data of each node in the array
It is identical or different；
The setting unit 302, suitable for setting storage start bit of the array in default multidimensional data space
Put, data storage direction and unit length；
The storage execution unit 303, suitable on the data storage direction, since the storage original position, every
Coordinate position stores the data of corresponding node in the array respectively corresponding to the unit length, until owning in the array
The data of node all complete by storage.
In specific implementation, the data storage device 30 in the embodiment of the present invention can also include data and delete unit 304,
Wherein：
The data delete unit 304, will be right in the multidimensional memory space suitable for when deleting the data in the array
The data stored in the coordinate position answered are deleted.
In specific implementation, the data storage device 30 in the embodiment of the present invention can also include data interpolating unit 305,
Wherein：
The data interpolating unit 305, suitable for when into the array insert data when, in the multidimensional data memory space
The data being inserted into are stored in the adjacent memory space position of the storage location of corresponding adjacent node data.
In specific implementation, the data storage device 30 in the embodiment of the present invention can also include backup units 306, its
In：
The backup units 306, suitable on other storage directions, backing up the array in the multidimensional data space
In data.
The embodiment of the present invention additionally provides a kind of computer-readable recording medium, is stored thereon with computer instruction, described
Computer instruction run when described in date storage method the step of.Wherein, the date storage method refers to preceding sections
Corresponding introduction, will not be repeated here.
The embodiment of the present invention additionally provides a kind of terminal, including memory and processor, and energy is stored on the memory
Enough computer instructions run on the processor, the processor perform described data when running the computer instruction
The step of storage method.Wherein, the date storage method refers to the corresponding introduction of preceding sections, will not be repeated here.
It is empty in default multidimensional data storage by setting the array using the such scheme in the embodiment of the present invention
Between in storage original position, data storage direction and unit length, and the data storage side described in multidimensional memory space
Upwards, since the storage original position, stored respectively in the array every coordinate position corresponding to the unit length
The data of corresponding node so that each node data in array can not be limited by data type, without presetting
The type of data in data, thus the flexibility of data manipulation can be improved.
Further, when the data in array are deleted and during insertion operation, it is only necessary to by data to be deleted from
Corresponding position coordinates is deleted in the multidimensional data memory space, or the adjacent storage of the position coordinates in adjacent node is empty
Between it is middle be stored in the data that are inserted into, without carrying out shifting function to the data in data, thus can further improve
The flexibility of data manipulation.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is can
To instruct the hardware of correlation to complete by program, the program can be stored in computer-readable recording medium, and storage is situated between
Matter can include：ROM, RAM, disk or CD etc..
The method and system of the embodiment of the present invention are had been described in detail above, the present invention is not limited thereto.Any
Art personnel, without departing from the spirit and scope of the present invention, it can make various changes or modifications, therefore the guarantor of the present invention
Shield scope should be defined by claim limited range.
Claims (10)
- A kind of 1. date storage method, it is characterised in that including：Obtain the information of array to be stored；The type of the data of each node is identical or different in the array；Set storage original position, data storage direction and unit of the array in default multidimensional data space Length；On the data storage direction, the array is set in default multidimensional data space from the storage Storage original position, data storage direction and unit length original position start, every coordinate bit corresponding to the unit length The data for storing corresponding node in the array respectively are put, until the data of all nodes all complete by storage in the array.
- 2. date storage method according to claim 1, it is characterised in that also include：When deleting the data in the array, the data that will be stored in corresponding coordinate position in the multidimensional memory space Deleted.
- 3. date storage method according to claim 2, it is characterised in that also include：When inserting data into the array, the storage of corresponding adjacent node data in the multidimensional data memory space The data being inserted into are stored in the adjacent memory space position of position.
- 4. date storage method according to claim 1, it is characterised in that also include：In the multidimensional data space on other storage directions, the data in the array are backed up.
- A kind of 5. data storage device, it is characterised in that including：Acquiring unit, suitable for obtaining the information of array to be stored；In the array type of the data of each node it is identical or It is different；Setting unit, suitable for setting storage original position, data of the array in default multidimensional data space Store direction and unit length；Execution unit is stored, suitable on the data storage direction, since the storage original position, every the unit Coordinate position corresponding to length stores the data of corresponding node in the array respectively, up to the number of all nodes in the array Completed according to all storages.
- 6. data storage device according to claim 5, it is characterised in that also include：Data delete unit, suitable for when deleting the data in the array, by corresponding seat in the multidimensional memory space The data stored in cursor position are deleted.
- 7. data storage device according to claim 2, it is characterised in that also include：Data interpolating unit, suitable for when into the array insert data when, in the multidimensional data memory space corresponding to The data being inserted into are stored in the adjacent memory space position of the storage location of adjacent node data.
- 8. data storage device according to claim 1, it is characterised in that also include：Backup units, suitable on other storage directions, backing up the number in the array in the multidimensional data space According to.
- 9. a kind of computer-readable recording medium, is stored thereon with computer instruction, it is characterised in that the computer instruction fortune Perform claim requires the step of date storage method described in 1 to 4 any one during row.
- 10. a kind of terminal, it is characterised in that including memory and processor, being stored on the memory can be at the place The computer instruction run on reason device, any one of perform claim requirement 1 to 4 institute when the processor runs the computer instruction The step of date storage method stated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710974467.XA CN107656876A (en) | 2017-10-19 | 2017-10-19 | Date storage method and device, computer-readable recording medium, terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710974467.XA CN107656876A (en) | 2017-10-19 | 2017-10-19 | Date storage method and device, computer-readable recording medium, terminal |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107656876A true CN107656876A (en) | 2018-02-02 |
Family
ID=61119009
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710974467.XA Pending CN107656876A (en) | 2017-10-19 | 2017-10-19 | Date storage method and device, computer-readable recording medium, terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107656876A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108829831A (en) * | 2018-06-15 | 2018-11-16 | 北京探境科技有限公司 | A kind of data processing method, device, hardware device and chip |
| CN109701273A (en) * | 2019-01-16 | 2019-05-03 | 腾讯科技（北京）有限公司 | Processing method, device, electronic equipment and the readable storage medium storing program for executing of game data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1956009A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Presenting method of large scale three-D data set |
| JP4266650B2 (en) * | 2003-01-29 | 2009-05-20 | シャープ株式会社 | Data processing apparatus and data processing method |
| CN103294831A (en) * | 2013-06-27 | 2013-09-11 | 中国人民大学 | Multidimensional-array-based grouping aggregation calculating method in column storage database |
| CN105353994A (en) * | 2015-12-11 | 2016-02-24 | 上海斐讯数据通信技术有限公司 | Data storage method and device for three-dimensional structure and query method and device |
| CN105843591A (en) * | 2016-04-08 | 2016-08-10 | 龙芯中科技术有限公司 | Method and device for generating data through multi-dimensional array sliding as well as processor |
-
2017
- 2017-10-19 CN CN201710974467.XA patent/CN107656876A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4266650B2 (en) * | 2003-01-29 | 2009-05-20 | シャープ株式会社 | Data processing apparatus and data processing method |
| CN1956009A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Presenting method of large scale three-D data set |
| CN103294831A (en) * | 2013-06-27 | 2013-09-11 | 中国人民大学 | Multidimensional-array-based grouping aggregation calculating method in column storage database |
| CN105353994A (en) * | 2015-12-11 | 2016-02-24 | 上海斐讯数据通信技术有限公司 | Data storage method and device for three-dimensional structure and query method and device |
| CN105843591A (en) * | 2016-04-08 | 2016-08-10 | 龙芯中科技术有限公司 | Method and device for generating data through multi-dimensional array sliding as well as processor |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108829831A (en) * | 2018-06-15 | 2018-11-16 | 北京探境科技有限公司 | A kind of data processing method, device, hardware device and chip |
| CN108829831B (en) * | 2018-06-15 | 2020-12-18 | 北京探境科技有限公司 | Data processing method and device, hardware device and chip |
| CN109701273A (en) * | 2019-01-16 | 2019-05-03 | 腾讯科技（北京）有限公司 | Processing method, device, electronic equipment and the readable storage medium storing program for executing of game data |
| CN109701273B (en) * | 2019-01-16 | 2022-04-19 | 腾讯科技（北京）有限公司 | Game data processing method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110334154B (en) | Block chain based hierarchical storage method and device and electronic equipment | |
| CN103744936B (en) | Multi-version concurrency control method in database and database system | |
| CN105630955B (en) | A kind of data acquisition system member management method of high-efficiency dynamic | |
| EP2069979B1 (en) | Dynamic fragment mapping | |
| CN110347684B (en) | Block chain based hierarchical storage method and device and electronic equipment | |
| AU690282B2 (en) | A method for storing and retrieving data and a memory arrangement | |
| CN110347660B (en) | Block chain based hierarchical storage method and device and electronic equipment | |
| US20150227570A1 (en) | Dynamic updates to a semantic database using fine-grain locking | |
| CN1983266A (en) | File system storing transaction records in flash-like media | |
| WO2005045765A1 (en) | System and method for processing a hierarchical data tree | |
| JP2005302038A (en) | Method and system for renaming consecutive key in b-tree | |
| CN104346458B (en) | Date storage method and storage device | |
| CN110413444A (en) | Realize the snapshot collection of the consistency group of storage volume | |
| CN107656876A (en) | Date storage method and device, computer-readable recording medium, terminal | |
| CN111580915A (en) | Topological graph drawing method and device, storage medium and processor | |
| CN111427885B (en) | Database management method and device based on lookup table | |
| CN114064984A (en) | Sparse array linked list-based world state increment updating method and device | |
| CN109032526A (en) | data processing method and device for distributed file system | |
| US20100281082A1 (en) | Subordinate Multiobjects | |
| CN107807793B (en) | The storage of data copy isomery and access method in distributed computer storage system | |
| CN109189343A (en) | A kind of metadata rule method, apparatus, equipment and computer readable storage medium | |
| CN105630702A (en) | Logical volume creation method and system | |
| CN103348653A (en) | Capacity expansion method and device and data access method and device | |
| CN107678979A (en) | Date storage method and device | |
| US20140214899A1 (en) | Leaf names and relative level indications for file system objects |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180202 |
|
| RJ01 | Rejection of invention patent application after publication |