CN112115126A - Processing method and device for set data types and database management system - Google Patents
Processing method and device for set data types and database management system Download PDFInfo
- Publication number
- CN112115126A CN112115126A CN202011051541.9A CN202011051541A CN112115126A CN 112115126 A CN112115126 A CN 112115126A CN 202011051541 A CN202011051541 A CN 202011051541A CN 112115126 A CN112115126 A CN 112115126A
- Authority
- CN
- China
- Prior art keywords
- data
- data structure
- memory
- data object
- expandable
- 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
- 238000003672 processing method Methods 0.000 title abstract description 4
- 238000012545 processing Methods 0.000 claims abstract description 41
- 238000000034 method Methods 0.000 claims description 41
- 238000004590 computer program Methods 0.000 claims description 9
- 238000007726 management method Methods 0.000 description 16
- 230000008569 process Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000004931 aggregating effect Effects 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2272—Management thereof
Abstract
The invention relates to a processing method, a device and a database management system of an aggregate data type, which are characterized in that a data object of the aggregate data type stored in a flattened data structure is obtained from an external memory, the data object is stored in an internal memory in an expandable data structure, the data object is processed in the internal memory in the expandable data structure, and the data object is transmitted between modules of the internal memory in the expandable data structure, namely, the data object is stored in the internal memory in the expandable data structure, the data object is transmitted between the modules of the internal memory in the expandable data structure, and the data structure of the data object is not required to be converted by each module of the internal memory, so that the processing efficiency of the aggregate data type is improved, and the data object is stored in the flattened data structure of the external memory, so that the storage space is saved, and the resource utilization rate is improved.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a method and an apparatus for processing aggregate data types, and a database management system.
Background
With the rapid development of computer technology, the application of databases is becoming more and more extensive, and the diversity of data types is a very important index of the overall functions of databases. The purpose of the different data types is for the convenience of computation and storage of the data objects, which may be stored in different data structures.
In a database management system, storage and computation capabilities are provided for any data type of object, and therefore, a corresponding data structure is required to store information for the data type of data object. For an aggregate data type, since the aggregate data type may include a plurality of data objects, the data objects therein need to be conveniently stored, accessed, added, and deleted, in the prior art, the same flattened data structure is usually adopted for both the internal memory and the external memory, when the data objects need to be operated, the data objects stored in the flattened data structure are read from the external memory to the internal memory, when each module in the internal memory processes the data objects, the flattened data structure is converted into an expandable data structure, the data objects are processed, after the processing is finished, the data objects are re-packaged into the flattened data structure, the data objects are transferred among the modules in the internal memory, and the final result of the processing is written into the external memory in the flattened data structure.
However, with prior art methods, the process of aggregating data types is inefficient.
Disclosure of Invention
To solve the technical problem or at least partially solve the technical problem, the present disclosure provides a method, an apparatus, and a database management system for processing aggregate data types.
In a first aspect, the present disclosure provides a method for processing an aggregate data type, including:
acquiring a data object from an external memory, wherein the data object is of an aggregate data type and is stored in the external memory in a flattened data structure;
storing the data object in an expandable data structure in a memory;
and processing the data object in the memory by using an expandable data structure, and transmitting the data object in the expandable data structure among the modules of the memory.
Optionally, before storing the data object in the memory in the extensible data structure, the method further includes:
registering the extensible data structure in a database management system to enable each module in the memory to identify data objects passed in the extensible data structure.
Optionally, registering the extensible data structure in the database management system includes:
declaring the extensible data structure as a global variable in a database management system.
Optionally, the method further includes:
determining keywords and grammar rules of the extensible data structure;
and adding the keywords and the grammar rules into the definition of the set data type.
Optionally, the storing the data object in an expandable data structure to a memory includes: searching in a name space according to the name of the data type;
acquiring an extensible data structure corresponding to the set data type;
and storing the data object into the memory according to the expandable data structure.
Optionally, the method further includes:
and converting the data objects stored in the expandable data structure in the internal memory into a flattened data structure and storing the flattened data structure in the external memory.
In a second aspect, the present disclosure provides a processing apparatus for aggregating data types, comprising:
the data object acquisition module is used for acquiring a data object from an external memory, wherein the data object is of an aggregate data type and is stored in the external memory in a flattened data structure;
the storage module is used for storing the data object into a memory in an expandable data structure;
and the processing module is used for processing the data object in the memory by using an expandable data structure and transmitting the data object in the expandable data structure among the modules of the memory.
Optionally, the processing module is further configured to register the extensible data structure in a database management system, so that each module in the memory can identify the data object passed through the extensible data structure.
Optionally, the processing module is specifically configured to declare, in the database management system, that the extensible data structure is a global variable.
Optionally, the processing module is further configured to determine keywords and syntax rules of the extensible data structure; and adding the keywords and the grammar rules into the definition of the set data type.
Optionally, the processing module is specifically configured to search in a namespace according to a name of the data type; acquiring an extensible data structure corresponding to the set data type; and storing the data object into the memory according to the expandable data structure.
Optionally, the storage module is further configured to convert the data object stored in the memory in the extensible data structure into a flattened data structure, and store the flattened data structure in the external memory.
In a third aspect, the present disclosure provides a database management system, comprising: a processor for executing a computer program stored in a memory, the computer program, when executed by the processor, implementing the steps of the method of any of the first aspects.
In a fourth aspect, the present disclosure provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method of the first aspect.
Compared with the prior art, the technical scheme provided by the embodiment of the disclosure has the following advantages:
the method comprises the steps of obtaining a data object of a set data type stored in a flattened data structure from an external memory, storing the data object into an internal memory in an expandable data structure, processing the data object in the internal memory in the expandable data structure, and transmitting the data object between modules of the internal memory in the expandable data structure, namely, storing the data object in the internal memory by adopting the expandable data structure, transmitting the data object in the expandable data structure between the modules of the internal memory, and not needing to convert the data structure of the data object by the modules of the internal memory, so that the processing efficiency of the set data type is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
In order to more clearly illustrate the embodiments or technical solutions in the prior art of the present disclosure, the drawings used in the description of the embodiments or prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
FIG. 1 is a schematic flow chart diagram illustrating an embodiment of a method for processing aggregate data types according to the present disclosure;
FIG. 2 is a schematic flow chart diagram illustrating another embodiment of a method for processing aggregate data types provided by the present disclosure;
FIG. 3 is a schematic diagram of a storage structure of a flattened data structure provided by the present disclosure;
FIG. 4 is a flowchart illustrating an embodiment of a method for processing aggregate data types according to the present disclosure;
FIG. 5 is a schematic diagram of a processing apparatus for aggregating data types according to the present disclosure;
fig. 6 is a schematic structural diagram of a database management system provided in the present disclosure.
Detailed Description
In order that the above objects, features and advantages of the present disclosure may be more clearly understood, aspects of the present disclosure will be further described below. It should be noted that the embodiments and features of the embodiments of the present disclosure may be combined with each other without conflict.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure, but the present disclosure may be practiced in other ways than those described herein; it is to be understood that the embodiments disclosed in the specification are only a few embodiments of the present disclosure, and not all embodiments.
The set is a composite data type in the database, and the elements with the same data type are combined in a certain sequence, can be operated through the unique index of the elements, and can be increased or decreased. An aggregate data type is characterized by containing multiple elements of the same data type.
Aiming at the set data type, the flat data structure is beneficial to saving the storage space and reading the data object, the extensible data structure is beneficial to the characteristic of operating the data object, the data object of the set data type is processed in a mode of combining the flat data structure and the extensible data structure, specifically, the flat data structure is stored in an external memory, and the extensible data structure is used for processing and transmitting in an internal memory, so that the purposes of convenient calculation and storage of the set data type in the internal memory are achieved, and the processing efficiency of the data object of the set type is improved.
The technical solutions of the present disclosure are described in several specific embodiments, and the same or similar concepts may be referred to one another, and are not described in detail in each place.
Fig. 1 is a schematic flowchart of an embodiment of a processing method for aggregating data types provided by the present disclosure, and as shown in fig. 1, the method of the present embodiment includes:
s101: the data object is retrieved from external memory.
Wherein the data object is of an aggregate data type, and the data object is stored in the external memory in a flattened data structure.
The storage in a flattened data structure means that the data object is stored in a continuous compact data storage space, and the storage mode is favorable for saving the storage space.
When the data object needs to be processed, the data object needs to be read from the external memory into the internal memory, and the data object is processed in the internal memory, for example, the data object in the data object is accessed, added, deleted, and the like.
S102: and storing the data object into a memory in an expandable data structure.
Because the flattened data structure is not beneficial to processing the data object, and the expandable data structure is convenient to process the data object, after the data object is read into the memory, the data object is stored in the memory in the expandable data structure.
In particular, the flattened data structure can be converted into an extensible data structure by an extension function.
The execution logic of the spreading function is as follows:
creating a data object stored by the flattened data structure;
initializing data objects of an extensible data structure store, comprising: initializing a function in a data object stored by an expandable data structure, and creating a structural body in the data object stored by the expandable data structure;
copying a data object stored in a flattened data structure acquired from an external memory to a data object stored in a created flattened data structure;
inserting data of the data object stored by the flattened data structure into the data object stored by the extensible data structure;
and returning a pointer of the readable and writable extensible data structure according to the data object stored in the extensible data structure.
S103: and processing the data objects in the memory by using an expandable data structure, and transmitting the data objects in the expandable data structure among the modules of the memory.
Because the extensible data structure is convenient for processing the data object, the data object is processed by the extensible data structure in the memory, and the data object is transmitted by the extensible data structure among the modules of the memory, namely the data object is transmitted and processed by the extensible data structure in the memory, so that the data structure is prevented from being converted in the transmitting process and the data structure is prevented from being converted again in the processing process.
In this embodiment, a data object of an aggregate data type stored in a flattened data structure is obtained from an external memory, the data object is stored in an expandable data structure in an internal memory, the data object is processed in the expandable data structure in the internal memory, and the data object is transmitted between modules of the internal memory in the expandable data structure, that is, the data object is stored in the internal memory in the expandable data structure, and the data object is transmitted between the modules of the internal memory in the expandable data structure, so that the data structure of the data object is not required to be converted by the modules of the internal memory, thereby improving the processing efficiency of the aggregate data type.
Fig. 2 is a schematic flowchart of another embodiment of a method for processing an aggregate data type provided by the present disclosure, where fig. 2 is based on the embodiment shown in fig. 1, and further before S101, further includes:
s100: registering the extensible data structure in a database management system to enable each module in the memory to identify data objects passed in the extensible data structure.
Alternatively, the extensible data structure may be declared a global variable by being declared a global variable in a database management system.
Before declaring an extensible data structure as a global variable, a set data type can be defined, and keywords and grammar rules of the extensible data structure are determined; and adding the keywords and the grammar rules into the definition of the set data type.
Two data structures of the aggregate data type are defined:
wherein the flattened data structure points to a block of contiguous storage space, comprising the following fields: the method comprises the steps of acquiring the size of a whole block of memory occupied by a data object of an aggregate data type from an external memory, the offset of a first address of non-null data in the data object of the aggregate data type and a data object of a flattened data structure, and the offset of a first address of null data in the data object of the aggregate data type and a data object of the flattened data structure. The flattened data structure defines only the header information of the data objects of the aggregate data type, followed by the type information table, non-null data information, and null mapping information table of the data objects of the aggregate data type. A flattened data structure can stretch complex aggregate data types into a flat structure.
The extensible data structure includes the following fields: the existing data structure "ExpandObjectHeader", type information of the aggregate data type, the number of nested layers of the aggregate data type, the real storage space of the data object of the aggregate data type, the value of the element really stored by the data object of the aggregate data type, and the flattened data structure corresponding to the data object of the aggregate data type. The type information of the aggregated data type includes type information of a key and type information of a value, and key-values of data objects of the aggregated data type can be stored using an array or an associated container in a Standard Template Library (STL), and a real storage space of the data objects of the aggregated data type is an address pointing to the array or the associated container. The extensible data structure can be viewed as a subclass of the existing data structure "ExpandObjectHeader", and can inherit the properties and methods of "ExpandObjectHeader".
The definition of the flattened data structure can be achieved by:
a flattened data structure 'Collection type' is defined, the 'Collection type' points to a continuous storage space, the 'v 1_ len' field in the data structure indicates the size of the whole storage space, the 'max _ index' field indicates the next key of a nested table, the 'limit _ idx' field indicates the limit index of an array, the 'ndims' field indicates the dimension of collection data, the 'dataoffset' field indicates the address offset of non-null data, and the 'nuloffset' field indicates the address offset of null data. The data structure "CollectionType" defines only the header information of the aggregate data object, followed by the null-value mapping information table and non-null data information of the size "ndim × sizeof (int)". The structure can stretch complex aggregate data types into a flat structure as shown in fig. 3.
The definition of the extensible data structure may be implemented as follows:
the elements in the extensible data structure "expandcollector" are defined to record type information of the collection data type, including type information of key-values (key-values), nesting layer number of the collection type, real storage space of the collection type, and values of the elements really stored by the collection type. Therefore, the extensible data structure can be conveniently subjected to calculation and assignment operations. The "hdr" field in the "expandcollector" indicates the existing data structure ExpandObjectHeader, the "ct _ map" field indicates the size of the extensible data structure, the "type" field indicates the information of the aggregate data, the "max _ index" field indicates the next key of the nested table, the "limit _ idx" field indicates the limit index of the array, the "ndims" field indicates the dimension of the aggregate data, the "valxt" field indicates a data structure object describing the memory information, the "Values" indicates an object of the Datum data structure storing key-value data using an STL map or array, the "flat _ size" field indicates the size of the flattened data structure "CollectionType", the "fvalue" field indicates the address of the flattened data structure "CollectionType", and the "nujsize" field indicates the storage space needed by the empty data of the aggregate data object. The "expandcollector" can be regarded as a subclass of the existing data structure "expandobjecthead", and the preceding field of the "expandcollector" structure contains all the fields of the "expandobjecthead" and the following field is "CollectionType". Thus, it can be pointed to by a pointer of the base class "ExpandObjectHeader" and can be used as parameter passing or the like. The whole data structure "expandcollector" is used for storing the type information of the collection, and the basic information is mainly defined generic type information, such as the type information exemplified as a generic type nested table. The field typkey is used to store the type of key of the collection type, which is always an integer of 4 bytes for nested tables and variable arrays, while the key type of the associated array depends on the user-defined type, and the field typdatype is used to store the type of element in which the collection type is stored.
Optionally, one possible implementation manner of S102 is:
searching in a name space according to the name of the data type;
acquiring an extensible data structure corresponding to the set data type;
and storing the data object into the memory according to the expandable data structure.
Fig. 4 is a schematic flowchart of an embodiment of a method for processing an aggregate data type provided by the present disclosure, where fig. 4 is based on the embodiment shown in fig. 1 or fig. 2, and further includes:
s1004: and converting the data objects stored in the expandable data structure in the internal memory into a flattened data structure and storing the flattened data structure in the external memory.
Since the flattened data structure can save storage space, the data objects are stored in the flattened data structure in the external memory.
In particular, the extensible data structure may be converted to a flattened data structure by a flattening function.
The execution logic of the flattening function is as follows:
calculating the size of the required storage space according to the data objects stored in the expandable data structure;
distributing corresponding storage space according to the calculated size of the storage space;
and adding the data of the data object stored in the expandable data structure into the data object of the flattened data structure, thereby realizing flattening of the data object stored in the expandable data structure.
In the embodiment, the storage space is saved and the resource utilization rate is improved by storing the data in a flattened data structure in the external memory.
Fig. 5 is a schematic structural diagram of a processing apparatus for aggregating data types according to the present disclosure, where the apparatus of this embodiment includes: an acquisition module 501, a storage module 502 and a processing module 503.
The obtaining module 501 is configured to obtain a data object from an external memory, where the data object is a collection data type and is stored in the external memory in a flattened data structure;
a storage module 502, configured to store the data object in an expandable data structure in a memory;
a processing module 503, configured to process the data object in the memory in an extensible data structure, and transmit the data object in the extensible data structure between the modules of the memory.
Optionally, the processing module 503 is further configured to register the extensible data structure in a database management system, so that each module in the memory can identify the data object passed through the extensible data structure.
Optionally, the processing module 503 is specifically configured to declare the extensible data structure as a global variable in a database management system.
Optionally, the processing module 503 is further configured to determine keywords and syntax rules of the extensible data structure; and adding the keywords and the grammar rules into the definition of the set data type.
Optionally, the processing module 503 is specifically configured to search in a namespace according to a name of a data type; acquiring an extensible data structure corresponding to the set data type; and storing the data object into the memory according to the expandable data structure.
Optionally, the storage module 502 is further configured to convert the data object stored in the expandable data structure in the internal memory into a flattened data structure and store the flattened data structure in the external memory.
The above device embodiment may be used to implement the technical solution of any one of the method embodiments shown in fig. 1, fig. 2, or fig. 4, and the implementation principle and the technical effect are similar, which are not described herein again.
Fig. 6 is a schematic structural diagram of a database management system provided in the present disclosure, including: a processor 601, said processor 601 being configured to execute a computer program stored in the memory 602, said computer program, when executed by the processor 601, implementing the solution of the method embodiment shown in any of fig. 1, fig. 2 or fig. 4.
The present disclosure also provides a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the solution of any of the method embodiments shown in fig. 1, fig. 2 or fig. 4.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The foregoing are merely exemplary embodiments of the present disclosure, which enable those skilled in the art to understand or practice the present disclosure. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method for processing aggregate data types, comprising:
acquiring a data object from an external memory, wherein the data object is of an aggregate data type and is stored in the external memory in a flattened data structure;
storing the data object in an expandable data structure in a memory;
and processing the data object in the memory by using an expandable data structure, and transmitting the data object in the expandable data structure among the modules of the memory.
2. The method of claim 1, wherein prior to storing the data object in the memory in an extensible data structure, further comprising:
registering the extensible data structure in a database management system to enable each module in the memory to identify data objects passed in the extensible data structure.
3. The method of claim 2, wherein registering the extensible data structure with a database management system comprises:
declaring the extensible data structure as a global variable in a database management system.
4. The method of claim 3, further comprising:
determining keywords and grammar rules of the extensible data structure;
and adding the keywords and the grammar rules into the definition of the set data type.
5. The method of claim 4,
the storing the data object in an expandable data structure to a memory includes:
searching in a name space according to the name of the data type;
acquiring an extensible data structure corresponding to the set data type;
and storing the data object into the memory according to the expandable data structure.
6. The method of any one of claims 1-5, further comprising:
and converting the data objects stored in the expandable data structure in the internal memory into a flattened data structure and storing the flattened data structure in the external memory.
7. A processing apparatus that aggregates data types, comprising:
the data object acquisition module is used for acquiring a data object from an external memory, wherein the data object is of an aggregate data type and is stored in the external memory in a flattened data structure;
the storage module is used for storing the data object into a memory in an expandable data structure;
and the processing module is used for processing the data object in the memory by using an expandable data structure and transmitting the data object in the expandable data structure among the modules of the memory.
8. The apparatus of claim 7, wherein the storage module is further configured to convert the data objects stored in the extensible data structure in the memory into a flattened data structure and store the flattened data structure in the external memory.
9. A database management system, comprising: a processor for executing a computer program stored in a memory, the computer program, when executed by the processor, implementing the steps of the method of any of claims 1-6.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011051541.9A CN112115126A (en) | 2020-09-29 | 2020-09-29 | Processing method and device for set data types and database management system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011051541.9A CN112115126A (en) | 2020-09-29 | 2020-09-29 | Processing method and device for set data types and database management system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112115126A true CN112115126A (en) | 2020-12-22 |
Family
ID=73797359
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011051541.9A Pending CN112115126A (en) | 2020-09-29 | 2020-09-29 | Processing method and device for set data types and database management system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112115126A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6061690A (en) * | 1997-10-31 | 2000-05-09 | Oracle Corporation | Apparatus and method for storage of object collections in a database system |
| US20070168301A1 (en) * | 2005-12-01 | 2007-07-19 | Firestar Software, Inc. | System and method for exchanging information among exchange applications |
| US20080086492A1 (en) * | 2006-10-06 | 2008-04-10 | Shunichi Maeda | Information processing apparatus, image processing apparatus, data conversion method, and computer-readable medium storing data conversion program |
| US8037108B1 (en) * | 2009-07-22 | 2011-10-11 | Adobe Systems Incorporated | Conversion of relational databases into triplestores |
| US20120173822A1 (en) * | 2010-01-06 | 2012-07-05 | Richard Testardi | System and method for storing data off site |
| CN102999429A (en) * | 2011-09-16 | 2013-03-27 | 苹果公司 | Faster tree flattening for a system having non-volatile memory |
| US20180060364A1 (en) * | 2016-08-24 | 2018-03-01 | Sap Se | Database scheme for storing generic data |
| CN110188108A (en) * | 2019-06-10 | 2019-08-30 | 北京平凯星辰科技发展有限公司 | Date storage method, device, system, computer equipment and storage medium |
| CN110490724A (en) * | 2019-07-03 | 2019-11-22 | 平安证券股份有限公司 | The storage method and device of account data |
| CN111680061A (en) * | 2020-06-11 | 2020-09-18 | 腾讯科技（深圳）有限公司 | Data access method, device, equipment and storage medium |
-
2020
- 2020-09-29 CN CN202011051541.9A patent/CN112115126A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6061690A (en) * | 1997-10-31 | 2000-05-09 | Oracle Corporation | Apparatus and method for storage of object collections in a database system |
| US20070168301A1 (en) * | 2005-12-01 | 2007-07-19 | Firestar Software, Inc. | System and method for exchanging information among exchange applications |
| US20080086492A1 (en) * | 2006-10-06 | 2008-04-10 | Shunichi Maeda | Information processing apparatus, image processing apparatus, data conversion method, and computer-readable medium storing data conversion program |
| US8037108B1 (en) * | 2009-07-22 | 2011-10-11 | Adobe Systems Incorporated | Conversion of relational databases into triplestores |
| US20120173822A1 (en) * | 2010-01-06 | 2012-07-05 | Richard Testardi | System and method for storing data off site |
| CN102999429A (en) * | 2011-09-16 | 2013-03-27 | 苹果公司 | Faster tree flattening for a system having non-volatile memory |
| US20180060364A1 (en) * | 2016-08-24 | 2018-03-01 | Sap Se | Database scheme for storing generic data |
| CN110188108A (en) * | 2019-06-10 | 2019-08-30 | 北京平凯星辰科技发展有限公司 | Date storage method, device, system, computer equipment and storage medium |
| CN110490724A (en) * | 2019-07-03 | 2019-11-22 | 平安证券股份有限公司 | The storage method and device of account data |
| CN111680061A (en) * | 2020-06-11 | 2020-09-18 | 腾讯科技（深圳）有限公司 | Data access method, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 李锐;林艳萍;徐正全;冯蔚;: "空间数据存储对象的元数据可伸缩性管理", 计算机应用研究, no. 12, 15 December 2011 (2011-12-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112287182B (en) | Graph data storage and processing method and device and computer storage medium | |
| CN109255055B (en) | Graph data access method and device based on grouping association table | |
| JP6356675B2 (en) | Aggregation / grouping operation: Hardware implementation of hash table method | |
| CN106294190B (en) | Storage space management method and device | |
| Scheidgen et al. | Automated and transparent model fragmentation for persisting large models | |
| WO2006046669A1 (en) | Database management device, method and program | |
| CN105630881A (en) | Data storage method and query method for RDF (Resource Description Framework) | |
| CN101315628A (en) | Internal memory database system and method and device for implementing internal memory data base | |
| CN103959257A (en) | Software translation lookaside buffer for persistent pointer management | |
| CN104361113A (en) | OLAP (On-Line Analytical Processing) query optimization method in memory and flesh memory hybrid storage mode | |
| CN103631911A (en) | OLAP query processing method based on array storage and vector processing | |
| CN106326475A (en) | High-efficiency static hash table implement method and system | |
| CN111221813B (en) | Database index and processing method, device and equipment for database query | |
| CN109656986A (en) | A kind of householder method that business datum summarizes, device and electronic equipment | |
| CN112434027A (en) | Indexing method and device for multi-dimensional data, computer equipment and storage medium | |
| CN114691721A (en) | Graph data query method and device, electronic equipment and storage medium | |
| CN113656397A (en) | Index construction and query method and device for time series data | |
| CN115905630A (en) | Graph database query method, device, equipment and storage medium | |
| CN102193988A (en) | Method and system for retrieving node data in graphic database | |
| US11030714B2 (en) | Wide key hash table for a graphics processing unit | |
| CN113918605A (en) | Data query method, device, equipment and computer storage medium | |
| CN112115126A (en) | Processing method and device for set data types and database management system | |
| US20170192905A1 (en) | Sequential access to page metadata stored in a multi-level page table | |
| Alam et al. | Performance of point and range queries for in-memory databases using radix trees on GPUs | |
| CN115935020A (en) | Graph data storage method and device |
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 |