CN113010523A - Data warehouse zipper table storage method, refreshing method and readable storage medium - Google Patents
Data warehouse zipper table storage method, refreshing method and readable storage medium Download PDFInfo
- Publication number
- CN113010523A CN113010523A CN202110308807.1A CN202110308807A CN113010523A CN 113010523 A CN113010523 A CN 113010523A CN 202110308807 A CN202110308807 A CN 202110308807A CN 113010523 A CN113010523 A CN 113010523A
- Authority
- CN
- China
- Prior art keywords
- data
- partition
- current
- date
- history
- 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
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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- 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/23—Updating
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method for storing and refreshing a linked list of a data warehouse, and a readable storage medium, wherein historical linked data is stored in a historical table, and the data in the historical table stores records of historical days in a partition mode according to a date range of an end time; storing current effective data in a current table, wherein the data in the current table stores records of corresponding effective start dates according to date range partitions of start times, and the historical table and the current table have the same structure and are combined into an integral pull-chain table. The current table is partitioned according to the starting time, the historical table is partitioned according to the ending time, the historical state of the appointed date recorded in the zipper table view is inquired, and only the partition before the appointed date of the current table of the zipper table and the partition after the appointed date of the historical table of the zipper table need to be scanned, so that the retrieval efficiency is improved.
Description
Technical Field
The invention belongs to the technical field of data warehouses, and particularly relates to a method for storing a linked list of a data warehouse and a method for refreshing the linked list of the data warehouse.
Background
A data warehouse is a theme-oriented, integrated, relatively stable collection of data that reflects historical changes. A linked list is a data model in a data warehouse for storing all the information of a change of an object from a starting point to a current state, and is a way to process slowly changing data. Only when the source service data changes, the pull chain table is changed correspondingly, so that the change information of the historical data is reserved, and the storage space is not wasted.
Each record of the data warehouse pull list contains two additional fields, a start time (dw _ start _ date) and an end time (dw _ end _ date), which represent the state of the record during the data warehouse lifecycle. The dw _ end _ date of the record up to the current valid is set to a larger future point in time (e.g., 3999-12-31) as an indication of "current state".
A typical data bin linked list is shown in table 1:
table 1 data warehouse pull list example
| Date of creation of order | Order numbering | Order status | dw_start_date | dw_end_date |
| 2020-06-20 | 1 | Creating an order | 2020-06-20 | 2020-06-20 |
| 2020-06-20 | 1 | Payment completion | 2020-06-21 | 3999-12-31 |
| 2020-06-20 | 2 | Creating an order | 2020-06-20 | 3999-12-31 |
| 2020-06-20 | 3 | Payment completion | 2020-06-20 | 2020-06-21 |
| 2020-06-20 | 3 | The goods having been delivered | 2020-06-22 | 3999-12-31 |
| 2020-06-21 | 4 | Creating an order | 2020-06-21 | 3999-12-31 |
| 2020-06-21 | 5 | Creating an order | 2020-06-21 | 2020-06-21 |
| 2020-06-21 | 5 | Payment completion | 2020-06-22 | 3999-12-31 |
| 2020-06-22 | 6 | Creating an order | 2020-06-22 | 3999-12-31 |
If the latest order state needs to be inquired from the zipper table in the upper table, dw _ end _ date =3999-12-31 needs to be defined; if the historical state of the order of 2020-06-20 days needs to be queried, dw _ start _ date < = 2020-06-20 and dw _ end _ date > = 2020-06-20 need to be defined.
The general approach to the refresh of the database linked list is as follows:
1. the source service system extracts new and change records of the previous day (recorded as ETLDATE day) according to the day and transmits the new and change records to the data warehouse (recorded as an increment table).
2. Records of dw _ end _ date =3999-12-31 in the pull chain table are associated with the increment table (according to unique identification of objects such as user ID and order ID), the associated records are records needing chain sealing, and dw _ end _ date is updated to be ETLDATE-1.
3. And inserting the record in the increment table into the pull chain table, setting dw _ start _ date to be ETLDATE, and setting dw _ end _ date to be 3999-12-31.
At present, the data warehouse pull chain table stores the current effective records in the 3999-12-31 day partition, but the 3999-12-31 partition stores the full amount of current effective records and is the partition with the largest data volume, the query and refresh time of the pull chain table is longer, and the computing resources are wasted.
Disclosure of Invention
The invention aims to solve the technical problem that the query and refresh time of the pull chain table is longer due to the storage mode of the current effective record of the pull chain table, and provides a storage method and a refresh method of a data warehouse pull chain table.
In order to achieve the technical purpose, the invention adopts the following technical scheme.
On one hand, the method for storing the pull chain table of the data warehouse comprises the following steps: storing history chain data in a history table, wherein the data in the history table stores records of history days in a partition mode according to a date range of an end time; storing current effective data in a current table, wherein the data in the current table stores records of corresponding effective start dates according to date range partitions of start times, and the historical table and the current table have the same structure and are combined into an integral pull-chain table.
Further, the data in the history table stores the records of the history days in a partition mode according to the date range of the ending time, specifically, the chain sealing data of each history day is stored as a partition mode.
Further, the data in the current table is partitioned according to the date range of the start time, and the record that the corresponding start date takes effect is stored, specifically, the effective data of each start date is stored as a partition.
In a second aspect, aiming at the technical problem that the refreshing efficiency of the current zipper list refreshing method is not high, the invention provides a data warehouse zipper list refreshing method, wherein the zipper list is stored by adopting the data warehouse zipper list storage method provided by any one of the possible embodiments of the technical scheme, the data warehouse zipper list refreshing method comprises the steps of creating a temporary list, the structure of the temporary list is the same as that of the zipper list, the temporary list comprises a current partition and a historical partition, the current partition is used for storing current effective data, and the historical partition is used for storing historical chain sealing data;
extracting current date increment data from a system and storing the current date increment data in an increment table, performing association matching on the current table of a linked list and the increment table to obtain associated data, setting the end time of the associated data as the previous day of the current date and inserting the end time into a history partition of a temporary table;
the end time of the unassociated data is still a future time and is inserted into the current partition of the temporary table, the start time recorded in the delta table is set to the current date, the end time is set to the future time, and is inserted into the current partition of the temporary table,
and inserting the records of the history partition of the temporary table into the latest partition of the history table of the zipper table according to the date range of the ending time, and covering all the records of the current partition of the temporary table into all the partitions of the current table of the zipper table according to the date range of the starting time.
Further, the data in the history partition of the temporary table stores records of history days in a date range partition of the ending time.
Further, the data in the current partition of the temporary table stores the record in which the corresponding start date is effective according to the date range partition of the start time.
Further, the data in the history partition stores the history date record according to the date range partition of the end time, specifically, the chain sealing data of each history date is stored as a partition.
Further, the data in the current partition stores the effective record of the corresponding start date according to the date range partition of the start time, specifically, the effective data of each start date is stored as a partition separately.
The invention also provides a computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the method as provided in any one of the possible embodiments of the above solution.
The invention has the following beneficial technical effects: the invention divides the zipper table into a current table and a history table, and forms a query view. The current table is partitioned according to the starting time, the historical table is partitioned according to the ending time, the historical state of the appointed date recorded in the zipper table view is inquired, and only the partition before the appointed date of the current table of the zipper table and the partition after the appointed date of the historical table of the zipper table need to be scanned, so that the retrieval efficiency is improved.
After the zipper table in the scheme is divided into two sub-tables of the history table and the current table, only the current table needs to be associated in the zipper table refreshing process, and the whole table association and the whole table scanning in the existing scheme are avoided. Therefore, the refresh efficiency of the pull-linked list in the proposal of the application is not slowed down along with the increase of the historical data in the pull-linked list.
Drawings
Fig. 1 is a schematic flow chart of a data warehouse zipper table refreshing method according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions and advantages of the present application more apparent, the following further detailed description of the exemplary embodiments of the present application with reference to the accompanying drawings makes it clear that the described embodiments are only a part of the embodiments of the present application, and not an exhaustive list of all embodiments. And the embodiments and features of the embodiments in the present description may be combined with each other without conflict.
The method aims to solve the technical problem that the query and refresh time of the pull chain table is long due to the storage mode of the current effective record of the pull chain table, and provides a method for refreshing and storing the pull chain table of the data warehouse.
Example 1: a method for storing a pull chain table of a data warehouse comprises the following steps: storing history chain data in a history table, wherein the data in the history table stores records of history days in a partition mode according to a date range of an end time; storing current effective data in a current table, wherein the data in the current table stores records of corresponding effective start dates according to date range partitions of start times, and the historical table and the current table have the same structure and are combined into an integral pull-chain table.
The invention splits the zipper table into two sub-tables of the current table and the history table, and forms the query view. The current table is partitioned according to the starting time, the historical table is partitioned according to the ending time, the historical state of the appointed date recorded in the zipper table view is inquired, and only the partition before the appointed date of the current table of the zipper table and the partition after the appointed date of the historical table of the zipper table need to be scanned, so that the retrieval efficiency is improved. In this embodiment, as shown in the zipper view table in fig. 1, the zipper table is split into two sub-tables (history table and current table) with the same table structure, and a zipper view is formed, including: 1. zipper watch history table: a history of the chain that has been closed is saved. Records in the table are partitioned by date range of the dw _ end _ date field, each partition holding a record of historical days, e.g. PE20200401 partition holding a history of dw _ end _ date = 2020-04-01.
2. Pull list current list: a record of the latest current state, dw _ end _ date =3999-12-31 (future time is denoted by 3999-12-31 in this embodiment) is kept. The records in the table are partitioned by a date range of the dw _ start _ date field, each partition holding a record for which the corresponding date is in effect, e.g., the PS20200401 partition holding a record for dw _ start _ date = 2020-04-01.
The implementation of the history table and the current table can be implemented by the prior art, and the invention is not described in detail. The data in the history table stores the records of the history date according to the date range partition of the ending time, and the data in the current table stores the records of the corresponding starting date in effect according to the date range partition of the starting time.
Example 2: a method for refreshing a data warehouse zipper list is characterized in that the zipper list is stored by adopting the method for storing the data warehouse zipper list provided by the technical scheme, the method for refreshing the data warehouse zipper list comprises the steps of creating a temporary list, wherein the structure of the temporary list is the same as that of the zipper list, the temporary list comprises a current partition and a historical partition, the current partition is used for storing current effective data, and the historical partition is used for historical chain sealing data;
extracting current date increment data from a system and storing the current date increment data in an increment table, performing association matching on the current table of a linked list and the increment table to obtain associated data, setting the end time of the associated data as the previous day of the current date and inserting the end time into a history partition of a temporary table;
the end time of the unassociated data is still a future time and is inserted into the current partition of the temporary table, the start time recorded in the delta table is set to the current date, the end time is set to the future time, and is inserted into the current partition of the temporary table,
and inserting the records of the history partition of the temporary table into the latest partition of the history table of the zipper table according to the date range of the ending time, and covering all the records of the current partition of the temporary table into all the partitions of the current table of the zipper table according to the date range of the starting time.
The refresh flow chart of the present embodiment is shown in fig. 1. Splitting the zipper table into two sub-tables (a history table and a current table) with the same table structure, and forming a zipper table view, wherein the zipper table view comprises the following steps: 1. zipper watch history table: a history of the chain that has been closed is saved. Records in the table are partitioned by date range of the dw _ end _ date field, each partition holding a record of historical days, e.g. PE20200401 partition holding a history of dw _ end _ date = 2020-04-01.
2. Pull list current list: the latest record of the current state, dw _ end _ date =3999-12-31, is saved. The records in the table are partitioned by a date range of the dw _ start _ date field, each partition holding a record for which the corresponding date is in effect, e.g., the PS20200401 partition holding a record for dw _ start _ date = 2020-04-01.
3. Temporary table: the table structure is consistent with a zipper table and comprises two partitions, wherein the current partition C stores the latest data, namely records of dw _ end _ date = 3999-12-31; the history partition H keeps a record of the data that needs to be chained, i.e. dw _ end _ date = ETLDATE-1.
4. Increment table: and storing the record of the new and changed (ETLDATE) extracted from the source service system.
After the table is partitioned, the logical table is still a complete table, only the data in the table is physically stored in a plurality of table spaces (physical files), and when the data is inquired, only the partition in the designated range is needed to be scanned according to the input inquiry date range, and the whole table is not needed to be scanned, so that the inquiry efficiency is improved.
The zipper table refreshing process of the technical scheme is as follows:
1. and extracting new and change records of the previous day (recorded as ETLDATE day) from the source end service system by day, transmitting the new and change records to a data warehouse, and storing the new and change records to an increment table.
2. The current table of the linked list is associated with the increment table, as shown in fig. 1, the record on the association is that the state changes, the chain needs to be sealed, dw _ end _ date is set as ETLDATE-1, and a history partition H of the temporary table is inserted; also included are 2.2 records on not associated as unchanged state, start time needs to be preserved for the current date, dw _ end _ date is still future time 3999-12-31, and insert into current partition C of the temporary table.
3. And setting records dw _ start _ date in the increment table to ETLDATE and dw _ end _ date to 3999-12-31, and inserting the current partition C of the temporary table.
As can be seen from fig. 1, the data sources in the temporary table are the data not associated in step 2.2 and the new or changed record in the increment table in step 3.
4. FIG. 1 includes 4.1. insert the record of temporary table history partition H into PD ETLDATE-1 partition of the zipper table history table;
4.2 inserting the record of the current partition C of the temporary table into each partition of the current table of the reconstructed zipper table according to dw _ start _ date coverage.
Optionally, the data in the history partition of the temporary table stores a record of the history date in a date range partition by end time.
Optionally, the data in the current partition of the temporary table stores the record for which the corresponding start date is in effect in a date range partition of start times.
Optionally, the data in the history partition stores the history date record according to the date range partition of the end time, specifically, the chain sealing data of each history date is separately stored as a partition.
Optionally, the data in the current partition is partitioned according to the date range of the start time, and the record in which the corresponding start date takes effect is stored, specifically, the effective data of each start date is stored as a partition.
The method comprises the steps that a zipper table is divided into two sub-tables (a history table and a current table) with the same table structure, a zipper table view is formed, and the history table is partitioned according to dw _ end _ date; the pull list is partitioned by dw _ start _ date from the current table. Looking up the history status of the specified date (V _ DAY) of the record, namely dw _ start _ date < = V _ DAY and dw _ end _ date > = V _ DAY, from the zipper table view, only the partition before the specified date of the current table and the partition after the specified date of the zipper table history table need to be scanned. Therefore, the query efficiency of the pull chain table in the proposal of the application is higher than that of the prior scheme.
After the zipper table in the scheme is divided into two sub-tables of the history table and the current table, only the current table needs to be associated in the zipper table refreshing process, and the whole table association and the whole table scanning in the existing scheme are avoided. Therefore, the refresh efficiency of the pull-linked list in the proposal of the application is not slowed down along with the increase of the historical data in the pull-linked list.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (9)
1. A method for storing a linked list of a data warehouse is characterized by comprising the following steps:
storing the history chain sealing data in a history table; storing chain sealing data of the historical days in the historical table according to the date range partitions of the end time;
storing the current valid data in a current table; storing the data with the corresponding valid starting time in the current table according to the date range partition of the starting time, wherein the historical table and the current table have the same structure;
and merging the history table and the current table into an integral pull-linked list.
2. The method for storing the pull-chain table of the data warehouse according to claim 1, wherein the chain sealing data of the historical days are stored in the historical table in a partition mode according to a date range of an ending time, specifically, the chain sealing data of each historical day is stored as a partition independently.
3. The method as claimed in claim 1, wherein the storing of the valid data of the corresponding start time in the current table by the date range of the start time is implemented by storing the valid data of each start time separately as a partition.
4. A method for refreshing a data warehouse zipper list, which is characterized in that the zipper list is stored by adopting the method for storing the data warehouse zipper list according to any one of claims 1 to 3, and the method for refreshing the data warehouse zipper list comprises the steps of,
creating a temporary table, wherein the structure of the temporary table is the same as that of the zipper table, the temporary table comprises a current partition and a history partition, the current partition is used for storing current effective data, and the history partition is used for storing history chain sealing data;
extracting current date increment data from the system and storing the current date increment data in an increment table;
performing association matching on a current table of the pull-chain table and the increment table to acquire associated data;
setting the end time of the associated data as the previous day of the current date and inserting the end time into the history partition of the temporary table; the end time of the non-associated data is still the future time and is inserted into the current partition of the temporary table; setting the starting time of the data in the increment table as the current date, setting the ending time as the future time, and inserting the data into the current partition of the temporary table;
and inserting the data of the history partition of the temporary table into the latest partition of the history table of the zipper table according to the date range of the ending time, and covering all the data of the current partition of the temporary table into all the partitions of the current table of the zipper table according to the date range of the starting time.
5. The method of claim 4, wherein the method further comprises,
and the historical partition of the temporary table stores the data of the historical days according to the date range partition of the ending time.
6. The method of claim 4, wherein the current partition of the temporary table stores data validated by the corresponding start time in a partition according to a date range of the start time.
7. The method for storing the pull-chain table of the data warehouse according to claim 5, characterized in that the data in the history partition is stored in the history date range partition according to the ending time, specifically, the chain sealing data of each history date is stored separately as a partition.
8. The method as claimed in claim 6, wherein the data validated by the corresponding start time is stored in the current partition according to the date range of the start time, and specifically, the valid data of each start time is stored as a partition.
9. A readable storage medium, in 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 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110308807.1A CN113010523A (en) | 2021-03-23 | 2021-03-23 | Data warehouse zipper table storage method, refreshing method and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110308807.1A CN113010523A (en) | 2021-03-23 | 2021-03-23 | Data warehouse zipper table storage method, refreshing method and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113010523A true CN113010523A (en) | 2021-06-22 |
Family
ID=76405425
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110308807.1A Pending CN113010523A (en) | 2021-03-23 | 2021-03-23 | Data warehouse zipper table storage method, refreshing method and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113010523A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113641676A (en) * | 2021-08-20 | 2021-11-12 | 烽火通信科技股份有限公司 | Time sequence processing method and device |
| CN116383228A (en) * | 2023-06-05 | 2023-07-04 | 建信金融科技有限责任公司 | Data processing method, device, computer equipment and storage medium |
| CN116719971A (en) * | 2023-05-08 | 2023-09-08 | 中银金融科技有限公司 | Pull chain table data loading method and device and electronic equipment |
| CN117251448A (en) * | 2023-09-18 | 2023-12-19 | 北京数方科技有限公司 | Method and device for processing data of wide-table zipper table |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102141963A (en) * | 2010-01-28 | 2011-08-03 | 阿里巴巴集团控股有限公司 | Method and equipment for analyzing data |
| CN107526733A (en) * | 2016-06-20 | 2017-12-29 | 咪咕互动娱乐有限公司 | A kind of slide fastener table date storage method and device |
| CN110442578A (en) * | 2019-07-30 | 2019-11-12 | 新华三大数据技术有限公司 | Zipper table updating method, device, server and computer readable storage medium |
-
2021
- 2021-03-23 CN CN202110308807.1A patent/CN113010523A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102141963A (en) * | 2010-01-28 | 2011-08-03 | 阿里巴巴集团控股有限公司 | Method and equipment for analyzing data |
| CN107526733A (en) * | 2016-06-20 | 2017-12-29 | 咪咕互动娱乐有限公司 | A kind of slide fastener table date storage method and device |
| CN110442578A (en) * | 2019-07-30 | 2019-11-12 | 新华三大数据技术有限公司 | Zipper table updating method, device, server and computer readable storage medium |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113641676A (en) * | 2021-08-20 | 2021-11-12 | 烽火通信科技股份有限公司 | Time sequence processing method and device |
| CN113641676B (en) * | 2021-08-20 | 2024-06-21 | 烽火通信科技股份有限公司 | Time sequence processing method and device |
| CN116719971A (en) * | 2023-05-08 | 2023-09-08 | 中银金融科技有限公司 | Pull chain table data loading method and device and electronic equipment |
| CN116719971B (en) * | 2023-05-08 | 2024-04-09 | 中银金融科技有限公司 | Pull chain table data loading method and device and electronic equipment |
| CN116383228A (en) * | 2023-06-05 | 2023-07-04 | 建信金融科技有限责任公司 | Data processing method, device, computer equipment and storage medium |
| CN116383228B (en) * | 2023-06-05 | 2023-08-25 | 建信金融科技有限责任公司 | Data processing method, device, computer equipment and storage medium |
| CN117251448A (en) * | 2023-09-18 | 2023-12-19 | 北京数方科技有限公司 | Method and device for processing data of wide-table zipper table |
| CN117251448B (en) * | 2023-09-18 | 2024-04-30 | 北京数方科技有限公司 | Method and device for processing data of wide-table zipper table |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113010523A (en) | Data warehouse zipper table storage method, refreshing method and readable storage medium | |
| CN109271450B (en) | Database synchronization method, device, server and storage medium | |
| US9870382B2 (en) | Data encoding and corresponding data structure | |
| CA2941074C (en) | Managing storage of individually accessible data units | |
| CN102750356B (en) | Construction and management method for secondary indexes of key value library | |
| US9047330B2 (en) | Index compression in databases | |
| CN104899295B (en) | A kind of heterogeneous data source data relation analysis method | |
| US20120310985A1 (en) | Systems and methods for replication replay in a relational database | |
| CN107526733A (en) | A kind of slide fastener table date storage method and device | |
| US20130080393A1 (en) | System and Method for Storing Stream Data in Distributed Relational Tables with Data Provenance | |
| CN109508355A (en) | A kind of data pick-up method, system and terminal device | |
| CN106933823B (en) | Data synchronization method and device | |
| EP2526479A1 (en) | Accessing large collection object tables in a database | |
| WO2014021978A4 (en) | Aggregating data in a mediation system | |
| CN110096509A (en) | Realize that historical data draws the system and method for storage of linked list modeling processing under big data environment | |
| CN104598519A (en) | Continuous-memory-based database index system and processing method | |
| CN110990402A (en) | Format conversion method from row storage to column storage, query method and device | |
| US20200159722A1 (en) | Presenting updated data using persisting views | |
| US20150379056A1 (en) | Transparent access to multi-temperature data | |
| US10055442B2 (en) | Efficient updates in non-clustered column stores | |
| CN103226610A (en) | Method and device for querying database table | |
| CN107145522B (en) | Database data content comparison method | |
| US9830323B2 (en) | Method and system for archiving data from a source database to a target database | |
| CN105512313A (en) | Incremental data processing method and device | |
| US20070239794A1 (en) | Method and system for updating logical information in databases |
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 |