CN117573708A - Partitioned caching, storing and using method and system for rocket real-time test data - Google Patents
Partitioned caching, storing and using method and system for rocket real-time test data Download PDFInfo
- Publication number
- CN117573708A CN117573708A CN202311364422.2A CN202311364422A CN117573708A CN 117573708 A CN117573708 A CN 117573708A CN 202311364422 A CN202311364422 A CN 202311364422A CN 117573708 A CN117573708 A CN 117573708A
- Authority
- CN
- China
- Prior art keywords
- data
- caching
- test data
- time
- real
- 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
- 238000012360 testing method Methods 0.000 title claims abstract description 184
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000004044 response Effects 0.000 claims abstract description 5
- 230000000737 periodic effect Effects 0.000 claims description 34
- 230000000903 blocking effect Effects 0.000 claims description 3
- 238000009472 formulation Methods 0.000 claims description 3
- 239000000203 mixture Substances 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 8
- 238000013500 data storage Methods 0.000 abstract description 8
- 238000002474 experimental method Methods 0.000 abstract description 3
- 230000008859 change Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 230000003139 buffering effect Effects 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000007405 data analysis Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000000638 solvent extraction Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- 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/25—Integrating or interfacing systems involving database management systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Human Computer Interaction (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a method and a system for caching, storing and using rocket real-time test data in blocks, wherein the method for caching, storing and using rocket real-time test data in blocks comprises the following steps: defining a data block; responding to the definition of the completed data block, and aiming at different test characteristics, formulating a data block cache rule; responding to the establishment of the caching rules, and carrying out real-time caching; in response to completing the real-time caching, the combining and the using of the data are performed. According to the data block caching and storing method, the transmission pressure of the test data network can be effectively reduced by using a small amount of memory. Experiments prove that the method effectively reduces the data transmission pressure and the data storage space, and improves the data storage efficiency and the query use efficiency.
Description
Technical Field
The application relates to the field of data processing, in particular to a partitioned caching, storing and using method and a partitioned caching, storing and using system for rocket real-time test data.
Background
In order to ensure accurate interpretation of rocket test states, test data are usually stored in real time for professionals to interpret afterwards. Rocket test data are various and huge in volume, and currently, two storage modes are mainly adopted: one is a file classification storage mode, namely, when analyzing test data in real time, adding the test data classification into different data files; the other is a classified storage mode of the database, namely, each time one frame of test data is analyzed, the test data is stored in the database in real time. When the classified file mode is adopted to store test data in real time, file read-write operation needs to be frequently carried out, larger memory space is consumed, the influence on the software performance is larger, and the software is not easy to find in use; when the database is used for storage, the requirement on network performance is higher, and when the concurrency of test data is larger, the phenomenon of data packet drop easily occurs due to network transmission bottleneck.
Therefore, how to provide a data caching and storing method capable of reducing memory consumption during file storage and effectively reducing network transmission pressure is an urgent problem to be solved by those skilled in the art.
Disclosure of Invention
In order to overcome the defects in the prior art, the application provides a method and a system for caching and storing real-time test data in blocks. In the process of analyzing test data, the test data are cached according to the data blocks and stored into a database supporting the storage of the data blocks through a network interface.
The application provides an improved method for caching, storing and using rocket real-time test data in blocks, which comprises the following steps: defining a data block; responding to the definition of the completed data block, and aiming at different test characteristics, formulating a data block cache rule; responding to the establishment of the caching rules, and carrying out real-time caching; in response to completing the real-time caching, the combining and the using of the data are performed.
As described above, the definition of the data block includes that the test data timestamp and the test data value are stored in the form of data blocks, that is, the data block belongs to the array type, and the rest of the fields are text types.
As above, in response to completing the definition of the data block, formulating the data block cache rule for different test characteristics includes: a buffer rule is formulated for the periodical test data; and setting a caching rule for the aperiodic test data.
As above, wherein formulating the caching rules for the periodic test data includes: a first cache rule is formulated for the periodic test data; and setting a second buffer rule for the periodic test data.
As described above, the buffering rule of the non-periodic test data is based on a timing commit policy, that is, a fixed time slice is adopted, when the time slice is timed, a plurality of test data are combined to commit for a data block, and when the capacity of the data block is greater than the capacity of the specified commit data, the data block is split into a plurality of blocks to commit.
A partitioned caching, storing and using system of rocket real-time test data comprises a defining unit, a caching rule making unit, a real-time caching unit and a combined using unit; the definition unit is used for defining the data blocks; the cache rule making unit is used for making data block cache rules according to different test characteristics; the real-time caching unit is used for carrying out real-time caching; the combined use unit is used for combining and using data.
As described above, the definition unit performs the definition of the data block, which includes that the test data timestamp and the test data value are stored in the data block manner, that is, belong to the array type, and the rest of the fields are text types.
As described above, the cache rule making unit makes the data block cache rule according to different test characteristics, including: a buffer rule is formulated for the periodical test data; and setting a caching rule for the aperiodic test data.
As above, the cache rule making unit makes a cache rule for the periodic test data, including: a first cache rule is formulated for the periodic test data; and setting a second buffer rule for the periodic test data.
As described above, when the buffer rule making unit makes a buffer rule for non-periodic test data, the buffer rule making unit mainly uses a timing commit policy, that is, a fixed time slice is adopted, and when the time slice timing is finished, a plurality of test data are combined to commit data blocks, and when the data block capacity is greater than the specified commit data capacity, the data blocks are split into a plurality of blocks to commit.
The application has the following beneficial effects:
according to the data block caching and storing method, the transmission pressure of the test data network can be effectively reduced by using a small amount of memory. Experiments prove that the method effectively reduces the data transmission pressure and the data storage space, and improves the data storage efficiency and the query use efficiency.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following description will briefly introduce the drawings that are required to be used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings may also be obtained according to these drawings for a person having ordinary skill in the art.
FIG. 1 is a flow chart of a method for partitioned caching, storing and using rocket real-time test data provided according to an embodiment of the present application;
fig. 2 is a schematic diagram of an internal structure of a system for caching, storing and using rocket real-time test data according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application, taken in conjunction with the accompanying drawings, clearly and completely describes the technical solutions of the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
The application provides a test data caching, storing and using method based on a data blocking idea. And in the process of caching the data blocks, according to the characteristics of different data, a data block caching and submitting strategy of a timing, fixed length and event mechanism is adopted, so that the method is dynamically suitable for the correctness of data block storage under various test conditions.
Example 1
As shown in fig. 1, the present application provides a method for caching, storing and using rocket real-time test data in blocks, which specifically includes the following steps:
step S110: the definition of the data block is performed.
The rocket test data partitioning is mainly processed aiming at the time characteristic of test data, namely, millions of data possibly exist in the test data values, the data values are stored in a data block mode, and the data storage records are reduced. The data block is only aimed at the data value of single test data, and the main storage attribute is test data meaning, test data category, test data timestamp, test data value, test data ordering field and the like.
The test data time stamp and the test data value are stored in a data block mode, namely, the data block type is adopted, and the rest fields are text types.
Further, the plurality of data blocks may be integrated into a set of ordered data blocks according to the data ordering field.
Step S120: and responding to the definition of the completed data block, and formulating data block cache rules aiming at different test characteristics.
Different caching rules are formulated for the non-periodic and periodic test data of the rocket. And confirming that the test data is periodic data or non-periodic data, and making different caching rules for the periodic data and the non-periodic data.
Specifically, for non-periodic test data, a timing submitting strategy is mainly adopted, namely, a fixed time slice is adopted, when the time slice timing is finished, a plurality of test data are combined to submit for a data block, and when the data block capacity is larger than the designated submitted data capacity, the data block is split into a plurality of blocks to submit.
For periodic test data, the fixed-length submitting strategy is mainly adopted, namely, when the capacity size of the test data block is the designated size, the data block submitting of single test data is carried out. Aiming at other special test conditions, when the test data issuing channel changes, data is interrupted and the like, an event trigger mechanism is adopted to submit the data block, the time slice length or the data block length is not judged any more, and the cached data is directly submitted.
Wherein the data caching rule is formulated for the periodic test data specifically comprises the following substeps:
step S1201: and setting a first buffer rule of the data block for the periodical test data.
Step S1202: and setting a second buffer rule of the data block for the periodical test data.
Wherein step S1201 specifically includes the following sub-steps:
step S12011: the test data is cached and time-clocked.
Step S12012: and judging whether the counted time is consistent with the number of the time slices.
If the two are identical, step S12013 is performed. If the two are inconsistent, the process exits.
Step S12013: a combination of a plurality of test data is performed.
Step S12014: and judging whether the combined data length reaches the designated length.
If the specified length is reached, step S12016 is performed. If the specified length is not reached, step S12015 is performed.
Step S12015: and judging whether the test data are combined.
If the test data combination is completed, step S12016 is performed. If the test data is not assembled, the process returns to step S12013.
Step S12016: submitting test data, emptying cache data, emptying the time and explaining the flow.
Wherein step S1202 specifically includes the following sub-steps:
step S12021: and carrying out buffering of the test data and calculating the length of the data block.
Step S12022: and judging whether the length of the data block reaches the designated length.
If the specified length is not reached, step S12023 is performed. If the specified length is reached, step S12024 is performed.
Step S12023: and judging whether a channel change exists or not, and interrupting the data.
If there is a channel change, the data interrupt event, step S12024 is performed. If there is no channel change, the data interrupt event is returned to step S12021.
Step S12024: submitting test data, emptying cache data, emptying the time and explaining the flow.
Step S130: and responding to the establishment of the caching rules, and carrying out real-time caching.
Specifically, the test data cache is cached by adopting a dictionary data structure, index values of the dictionary are test data basic attribute information, dictionary values are data block objects, and the data block objects comprise test data basic attribute information, a sequencing field, a test data analysis timestamp array and a test data value array. The process of buffering and submitting the test data blocks includes three steps, namely, firstly, converting the frame count of the data source code by adopting a linear piecewise function when analyzing a plurality of test data of a frame of the data source code, wherein the converted value is an ordering field of single test data; secondly, positioning a data block object of the test data according to the index value of the dictionary, adding the test time and the test value into the array, and updating the ordering field of the test data; after the data caching is tested, judging whether a timing or fixed-length data block submitting condition is met, submitting the current data block if the timing or fixed-length data block submitting condition is met, and otherwise, continuing to add test data into the data block.
Step S140: in response to completing the real-time caching, the combining and the using of the data are performed.
Specifically, after the test data is stored in real time, the test data can be combined horizontally and vertically according to the sorting fields during use. The transverse combination combines a plurality of test data blocks with the same type and the same ordering field to form a data matrix, so that whether a plurality of test data relations meet design indexes in the same time period is conveniently analyzed. And the longitudinal combination sorts all data blocks of the single test data according to the sorting field to form a complete data set of the single test data, so that the change trend of the single data is conveniently analyzed.
Example two
As shown in fig. 2, the present application provides a system for caching, storing and using rocket real-time test data in blocks, where the system specifically includes: definition unit 210, cache rule formulation unit 220, real-time cache unit 230, and combined use unit 240.
The definition unit 210 is used for defining the data block.
The rocket test data partitioning is mainly processed aiming at the time characteristic of test data, namely, millions of data possibly exist in the test data values, the data values are stored in a data block mode, and the data storage records are reduced. The data block is only aimed at the data value of single test data, and the main storage attribute is test data meaning, test data category, test data timestamp, test data value, test data ordering field and the like. The test data time stamp and the test data value are stored in a data block mode, namely, the data block type is adopted, and the rest fields are text types.
Further, the plurality of data blocks may be integrated into a set of ordered data blocks according to the data ordering field.
The cache rule making unit 220 is configured to make a data block cache rule according to different test characteristics.
Different caching rules are formulated for the non-periodic and periodic test data of the rocket. And confirming that the test data is periodic data or non-periodic data, and making different caching rules for the periodic data and the non-periodic data.
Specifically, for non-periodic test data, a timing submitting strategy is mainly adopted, namely, a fixed time slice is adopted, when the time slice timing is finished, a plurality of test data are combined to submit for a data block, and when the data block capacity is larger than the designated submitted data capacity, the data block is split into a plurality of blocks to submit.
For periodic test data, the fixed-length submitting strategy is mainly adopted, namely, when the capacity size of the test data block is the designated size, the data block submitting of single test data is carried out. Aiming at other special test conditions, when the test data issuing channel changes, data is interrupted and the like, an event trigger mechanism is adopted to submit the data block, the time slice length or the data block length is not judged any more, and the cached data is directly submitted.
Wherein the cache rule making unit 220 makes a data cache rule for the periodic test data specifically includes the following sub-steps:
step S1201: and setting a first buffer rule of the data block for the periodical test data.
Step S1202: and setting a second buffer rule of the data block for the periodical test data.
Wherein step S1201 specifically includes the following sub-steps:
step S12011: the test data is cached and time-clocked.
Step S12012: and judging whether the counted time is consistent with the number of the time slices.
If the two are identical, step S12013 is performed. If the two are inconsistent, the process exits.
Step S12013: a combination of a plurality of test data is performed.
Step S12014: and judging whether the combined data length reaches the designated length.
If the specified length is reached, step S12016 is performed. If the specified length is not reached, step S12015 is performed.
Step S12015: and judging whether the test data are combined.
If the test data combination is completed, step S12016 is performed. If the test data is not assembled, the process returns to step S12013.
Step S12016: submitting test data, emptying cache data, emptying the time and explaining the flow.
Wherein step S1202 specifically includes the following sub-steps:
step S12021: and carrying out buffering of the test data and calculating the length of the data block.
Step S12022: and judging whether the length of the data block reaches the designated length.
If the specified length is not reached, step S12023 is performed. If the specified length is reached, step S12024 is performed.
Step S12023: and judging whether a channel change exists or not, and interrupting the data.
If there is a channel change, the data interrupt event, step S12024 is performed. If there is no channel change, the data interrupt event is returned to step S12021.
Step S12024: submitting test data, emptying cache data, emptying the time and explaining the flow.
The real-time buffering unit 230 is used for real-time buffering.
Specifically, the test data cache is cached by adopting a dictionary data structure, index values of the dictionary are test data basic attribute information, dictionary values are data block objects, and the data block objects comprise test data basic attribute information, a sequencing field, a test data analysis timestamp array and a test data value array. The process of buffering and submitting the test data blocks includes three steps, namely, firstly, converting the frame count of the data source code by adopting a linear piecewise function when analyzing a plurality of test data of a frame of the data source code, wherein the converted value is an ordering field of single test data; secondly, positioning a data block object of the test data according to the index value of the dictionary, adding the test time and the test value into the array, and updating the ordering field of the test data; after the data caching is tested, judging whether a timing or fixed-length data block submitting condition is met, submitting the current data block if the timing or fixed-length data block submitting condition is met, and otherwise, continuing to add test data into the data block.
The combined use unit 240 is used for combining and using data.
Specifically, after the test data is stored in real time, the test data can be combined horizontally and vertically according to the sorting fields during use. The transverse combination combines a plurality of test data blocks with the same type and the same ordering field to form a data matrix, so that whether a plurality of test data relations meet design indexes in the same time period is conveniently analyzed. And the longitudinal combination sorts all data blocks of the single test data according to the sorting field to form a complete data set of the single test data, so that the change trend of the single data is conveniently analyzed.
The application has the following beneficial effects:
according to the data block caching and storing method, the transmission pressure of the test data network can be effectively reduced by using a small amount of memory. Experiments prove that the method effectively reduces the data transmission pressure and the data storage space, and improves the data storage efficiency and the query use efficiency.
Although the examples referred to in the present application are described for illustrative purposes only and not as limitations on the present application, variations, additions and/or deletions to the embodiments may be made without departing from the scope of the application.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. The method for caching, storing and using the rocket real-time test data in a blocking manner is characterized by comprising the following steps of:
defining a data block;
responding to the definition of the completed data block, and aiming at different test characteristics, formulating a data block cache rule;
responding to the establishment of the caching rules, and carrying out real-time caching;
in response to completing the real-time caching, the combining and the using of the data are performed.
2. The method for partitioned caching, storing and using rocket real-time test data according to claim 1, wherein defining the data blocks comprises storing the test data time stamps and the test data values in the form of data blocks, namely, in the form of an array type, and the rest of fields are text types.
3. The method of claim 1, wherein responsive to completing definition of the data block, formulating data block caching rules for different test characteristics comprises:
a buffer rule is formulated for the periodical test data;
and setting a caching rule for the aperiodic test data.
4. A method of partitioned caching, storing and using rocket real-time test data as recited in claim 3, wherein developing caching rules for periodic test data comprises:
a first cache rule is formulated for the periodic test data;
and setting a second buffer rule for the periodic test data.
5. A method for partitioned caching, storing and using rocket real-time test data as defined in claim 3, wherein the caching rule of non-periodic test data is based on a timing submitting policy, namely, a fixed time slice is adopted, when the timing of the time slice is finished, a plurality of test data are combined to submit data blocks, and when the capacity of the data blocks is larger than the capacity of appointed submitted data, the data blocks are split into a plurality of blocks to submit.
6. The system for caching, storing and using the rocket real-time test data in a blocking manner is characterized by comprising a definition unit, a cache rule making unit, a real-time cache unit and a combined use unit;
the definition unit is used for defining the data blocks;
the cache rule making unit is used for making data block cache rules according to different test characteristics;
the real-time caching unit is used for carrying out real-time caching;
the combined use unit is used for combining and using data.
7. The system for partitioned caching, storing and using rocket real-time test data as recited in claim 6, wherein the defining unit defines the data blocks by storing the test data time stamp and the test data value in the form of data blocks, i.e. belonging to the array type, and the rest of the fields are text types.
8. The segmented caching, storing and using system for rocket real-time test data as recited in claim 6, wherein the caching rule formulation unit for formulating the data segmented caching rules for different test characteristics comprises:
a buffer rule is formulated for the periodical test data;
and setting a caching rule for the aperiodic test data.
9. The segmented caching, storing and using system for rocket real-time test data as recited in claim 8, wherein the caching rule formulation unit for formulating caching rules for periodic test data comprises:
a first cache rule is formulated for the periodic test data;
and setting a second buffer rule for the periodic test data.
10. The system for partitioned caching, storing and using rocket real-time test data according to claim 8, wherein the caching rule making unit makes caching rules for non-periodic test data, mainly comprising a timing submitting policy, namely adopting a fixed time slice, combining a plurality of test data to submit data blocks when the time slice timing is finished, and splitting into a plurality of blocks to submit when the data block capacity is larger than the designated submitted data capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311364422.2A CN117573708A (en) | 2023-10-19 | 2023-10-19 | Partitioned caching, storing and using method and system for rocket real-time test data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311364422.2A CN117573708A (en) | 2023-10-19 | 2023-10-19 | Partitioned caching, storing and using method and system for rocket real-time test data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117573708A true CN117573708A (en) | 2024-02-20 |
Family
ID=89859642
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311364422.2A Pending CN117573708A (en) | 2023-10-19 | 2023-10-19 | Partitioned caching, storing and using method and system for rocket real-time test data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117573708A (en) |
-
2023
- 2023-10-19 CN CN202311364422.2A patent/CN117573708A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10664497B2 (en) | Hybrid database table stored as both row and column store | |
| US10346383B2 (en) | Hybrid database table stored as both row and column store | |
| US8712972B2 (en) | Query optimization with awareness of limited resource usage | |
| US8768927B2 (en) | Hybrid database table stored as both row and column store | |
| CN105637506B (en) | Method for optimizing query execution on data store | |
| US8484220B2 (en) | Clustered index with differentiated subfields | |
| Polyzotis et al. | Meshing streaming updates with persistent data in an active data warehouse | |
| US7805410B2 (en) | Load estimating system and computer load estimating method | |
| US7890480B2 (en) | Processing of deterministic user-defined functions using multiple corresponding hash tables | |
| US20100198830A1 (en) | Dynamic data distribution aggregation | |
| WO2014210218A1 (en) | Incremental maintenance of range-partitioned statistics for query optimization | |
| CN102063449A (en) | Method and device for improving reliability of statistic information of data object in database | |
| US20220269653A1 (en) | Design and implementation of data access metrics for automated physical database design | |
| US11809468B2 (en) | Phrase indexing | |
| CN117271481B (en) | Automatic database optimization method and equipment | |
| CN112613271A (en) | Data paging method and device, computer equipment and storage medium | |
| CN111522870B (en) | Database access method, middleware and readable storage medium | |
| CN112783900A (en) | Database management method, device, equipment and storage medium | |
| CN117573708A (en) | Partitioned caching, storing and using method and system for rocket real-time test data | |
| CN117290352A (en) | Index establishing method, electronic equipment and computer storage equipment | |
| CN112506953A (en) | Query method, device and storage medium based on Structured Query Language (SQL) | |
| CN112818017A (en) | Event data processing method and device | |
| EP4141691A1 (en) | Automatic results caching for dynamically generated queries | |
| CN106681939A (en) | Reading method and device for disk page | |
| KR100333682B1 (en) | A Query Processing Method For Grouping And Aggregation Operations In Object-Relational Database Systems Using Reverse Pointers |
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 |