CN116467310A - Lock-free marking method for invalid index, storage medium and computer equipment - Google Patents
Lock-free marking method for invalid index, storage medium and computer equipment Download PDFInfo
- Publication number
- CN116467310A CN116467310A CN202310381230.6A CN202310381230A CN116467310A CN 116467310 A CN116467310 A CN 116467310A CN 202310381230 A CN202310381230 A CN 202310381230A CN 116467310 A CN116467310 A CN 116467310A
- Authority
- CN
- China
- Prior art keywords
- index
- invalid
- page
- sequence number
- index page
- 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
- 238000000034 method Methods 0.000 title claims abstract description 41
- 230000004048 modification Effects 0.000 claims abstract description 104
- 238000012986 modification Methods 0.000 claims abstract description 104
- 238000010586 diagram Methods 0.000 description 9
- 230000008520 organization Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 230000008859 change Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 238000012546 transfer 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2272—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/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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (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 provides a lock-free marking method of invalid indexes, a storage medium and computer equipment. The method includes prohibiting access to and physical modification of the index page; searching an invalid index item on an index page, and recording a first modification sequence number of the index page; when the search of the invalid index item on the index page is completed, allowing access and physical modification to the index page; recording an invalid index item searched on an index page; prohibiting access to and physical modification of the index page; recording a second modification sequence number of the index page; determining whether the invalid index item of the recorded index page is a final invalid index item according to the first modification sequence number and the second modification sequence number; if yes, marking the final invalid index item as invalid; access to the index page and physical modification are allowed. During the period of prohibiting access to and physical modification of the index page and allowing access to and physical modification of the index page, the accuracy of the marking of the invalid index item can be ensured.
Description
Technical Field
The present invention relates to database technology, and in particular, to a lock-free marking method for invalid indexes, a storage medium and a computer device.
Background
At present, the data organization mode in the relational database can be as follows: the table data is stored in a pile table form; the index data is stored separately, and the physical locations of the table data rows are stored in the index entries of the index leaf nodes to associate the index with the corresponding data. In order to improve efficiency of query and the like, when the table data acquired through the index items are invalid, the invalid index items can be recorded and marked, so that subsequent scanning can skip the marked index items to avoid acquiring the table data through the invalid index items. However, if other operations affect the physical organization of the index page in the above process, the position of the marked invalid index item is changed, which results in inaccurate marking of the invalid index item, and if the whole process is forbidden to access and physically modify the index page, the operations that need to change the physical organization of the index page are blocked, the concurrency is reduced, and the throughput of the database system is affected.
Disclosure of Invention
It is an object of the present invention to inhibit access to and physical modification of index pages in part of the process of marking an invalid index, thereby avoiding excessive reduction in concurrency while ensuring the accuracy of marking an invalid index entry.
In particular, the present invention provides a lock-free marking method of invalid index, comprising:
prohibiting access to and physical modification of an index page, wherein the index page has a plurality of index entries thereon;
searching an invalid index item on the index page, and recording a first modification sequence number of the index page;
allowing access and physical modification to the index page when the search of the invalid index item on the index page is completed;
recording an invalid index item searched on the index page;
recording a second modification sequence number of the index page;
determining whether the invalid index item of the index page recorded is a final invalid index item according to the first modification sequence number and the second modification sequence number;
if yes, marking the final invalid index item as invalid.
Optionally, the determining whether the invalid index item of the index page of the record is a final invalid index item according to the first modification sequence number and the second modification sequence number includes:
and judging whether the first modification sequence number is the same as the second modification sequence number.
Optionally, after said marking the final invalid index entry as invalid, further comprising:
the final invalid index entry marked invalid is cleaned up.
Optionally, after said marking the final invalid index entry as invalid, further comprising:
and modifying the second modification sequence number of the index page.
Optionally, the searching for the invalid index item on the index page includes:
and searching invalid index items on the index page in a mode of scanning and traversing the index page.
Optionally, the searching for the invalid index item on the index page by scanning through the index page includes:
scanning and traversing index items of the index page, acquiring table data of the index items, and recording the index items corresponding to invalid table data in the table data as invalid index items.
Optionally, the marking the final invalid index item as invalid includes:
and marking the final invalid index item as invalid in batches.
Optionally, if the first modification sequence number is different from the second modification sequence number, the step of marking the final invalid index item as invalid is abandoned.
According to another aspect of the present invention, there is also provided a machine-readable storage medium having stored thereon a machine-executable program which, when executed by a processor, implements the lock-free marking method of the invalid index of any one of the above.
According to yet another aspect of the present invention, there is also provided a computer device including a memory, a processor, and a machine executable program stored on the memory and running on the processor, and the processor implementing a lock-free marking method of an invalid index of any of the above when executing the machine executable program.
The lock-free marking method of the invalid index of the invention forbids the access and physical modification to the index page, searches the invalid index item on the index page, records the first modification sequence number of the index page, allows the access and physical modification to the index page when the search to the invalid index item on the index page is completed, avoids the access and physical modification to the index page during the period, and avoids or reduces the position change of the invalid index item, thereby ensuring the marking accuracy of the invalid index item. When the search of the invalid index item on the index page is completed, taking into consideration that some subsequent steps may take longer time, for example, recording the searched invalid index item on the index page, thus allowing access and physical modification to the index page, reducing concurrency of the database, avoiding influencing throughput of the database system, and relatively improving concurrency of the database and ensuring throughput of the database system compared with the scheme that access and physical modification to the index page are forbidden in the whole process. And after the invalid index item searched on the index page is recorded, the access and physical modification to the index page are forbidden again, so that the accuracy of judging the invalid index can be further ensured. The embodiment has excellent balance between ensuring the accuracy of the marking of the invalid index item and ensuring the concurrency of the database, and has outstanding substantive characteristics and remarkable progress.
The above, as well as additional objectives, advantages, and features of the present invention will become apparent to those skilled in the art from the following detailed description of a specific embodiment of the present invention when read in conjunction with the accompanying drawings.
Drawings
Some specific embodiments of the invention will be described in detail hereinafter by way of example and not by way of limitation with reference to the accompanying drawings. The same reference numbers will be used throughout the drawings to refer to the same or like parts or portions. It will be appreciated by those skilled in the art that the drawings are not necessarily drawn to scale. In the accompanying drawings:
FIG. 1 is a schematic flow diagram of a lock-free marking method of invalid indexes according to one embodiment of the present invention;
FIG. 2 is a schematic diagram of marking invalid index entries according to another embodiment of the present invention;
FIG. 3 is a schematic flow chart of a lock-free marking method of invalid indexes according to another embodiment of the present invention;
FIG. 4 is a schematic diagram of a machine-readable storage medium according to one embodiment of the invention;
FIG. 5 is a schematic diagram of a computer device according to one embodiment of the invention.
Detailed Description
FIG. 1 is a schematic flow diagram of a lock-free marking method of invalid indexes according to one embodiment of the present invention. The lock-free marking method of invalid indexes may generally include:
step S102: access to and physical modification of an index page is prohibited, wherein the index page has a plurality of index entries thereon. This step can also be understood as controlling the physical modification of the index page.
Step S104: searching an invalid index item on the index page, and recording a first modification sequence number of the index page. Modifications involving changes in the physical organization of the index page will result in a unique identifier for the whole database system, typically by modifying the location in the log or modifying the serial number of the database system to which the modification belongs, which identifier will be recorded on the index page at the same time as the index page is modified, where the identifier is the serial number. The first modified sequence number is a sequence number which does not change the physical organization of the index page after the access to the index page is forbidden and the physical modification is performed.
Step S106: when the lookup of the invalid index entry on the index page is completed, access and physical modification to the index page is allowed.
Step S108: and recording the invalid index item searched on the index page. This step may involve random I/O and thus take a long time.
Step S110: access to the index page and physical modification are prohibited.
Step S112: the second modified sequence number of the index page is recorded.
Step S114: and determining whether the invalid index item of the recorded index page is a final invalid index item according to the first modification sequence number and the second modification sequence number.
If yes, go to step S116: the final invalid index entry is marked as invalid.
Step S118: allowing access to and physical modification of the index page.
In this embodiment, access to and physical modification of the index page are prohibited, an invalid index item on the index page is searched, and a first modification sequence number of the index page is recorded, when the search of the invalid index item on the index page is completed, access to and physical modification of the index page are allowed, during which access to and physical modification of the index page are avoided, and the position of the invalid index item is prevented or reduced from being changed, so that the accuracy of marking of the invalid index item can be ensured. When the search for the invalid index item on the index page is completed, considering that some subsequent steps may take longer time, for example, step S108 records the invalid index item found on the index page, thus allowing access and physical modification to the index page, reducing concurrency of the database can be avoided, throughput of the database system is avoided to be influenced, and compared with the scheme that access and physical modification to the index page are forbidden in the whole process, the method relatively improves concurrency of the database and ensures throughput of the database system. And, after the invalid index item found on the index page is recorded in step S108, access and physical modification to the index page are prohibited again, so that the accuracy of invalid index judgment can be further ensured. The embodiment has excellent balance between ensuring the accuracy of the marking of the invalid index item and ensuring the concurrency of the database, and has outstanding substantive characteristics and remarkable progress.
In one embodiment of the present invention, determining whether the invalid index item of the recorded index page is the final invalid index item according to the first modification sequence number and the second modification sequence number may include:
and judging whether the first modification sequence number is the same as the second modification sequence number.
In this embodiment, if other operations affect the physical organization of the index page between step S104 and step S112, the position of the marked invalid index item is changed, that is, the first modification sequence number is changed, so as to obtain a different second modification sequence number, and the marking of the invalid index item is not accurate enough, so that it is determined whether the first modification sequence number is the same as the second modification sequence number, and it can be accurately determined whether the marked invalid index item of the index page is the final invalid index item. Specifically, for example, FIG. 2 is a schematic diagram of marking invalid index entries according to another embodiment of the present invention; assuming that index item 1 is included in the index page, the first modification sequence number is 1 (i.e., value 1); index item 2, first modification sequence number 1 (i.e., value 1). Index 2, the table data corresponding to the first modification sequence number 1 (i.e., value 1) is row 2, the first modification sequence number 1 (i.e., value a 1), the second modification sequence number 3 (i.e., value B3), and the first modification sequence number is different from the second modification sequence number, so index 2 is valid. The index item 1, the table data corresponding to the first modification sequence number 1 (i.e. the value 1) is row 1, the first modification sequence number 1 (i.e. the value 1 a), the second modification sequence number 1 (i.e. the value 1B), and the first modification sequence number is identical to the second modification sequence number, so that the index item 1 is invalid.
In one embodiment of the present invention, after marking the final invalid index entry as invalid, it may further include:
the final invalid index entry marked invalid is cleaned up.
In this embodiment, after the final invalid index item is marked as invalid, the final invalid index item marked as invalid is cleaned, which can reduce the space occupied by the final invalid index item, and is beneficial to improving the performance of the database.
In one embodiment of the present invention, after marking the final invalid index entry as invalid, it may further include:
and modifying the second modification sequence number of the index page.
In this embodiment, after the final invalid index item is marked as invalid, the second modification sequence number of the index page is modified to indicate that the index page has completed marking the final invalid index item, so that the index page is prevented from being repeatedly marked again, and thus repetitive work can be avoided.
In one embodiment of the invention, finding invalid index entries on an index page may include:
and searching invalid index items on the index page in a mode of scanning and traversing the index page.
In the embodiment, the invalid index item on the index page is searched in a mode of scanning and traversing the index page, so that the invalid index item on the index page can be searched more efficiently, and time is saved.
In one embodiment of the present invention, searching for invalid index entries on an index page by scanning through the index page may include:
scanning and traversing index items of the index page, acquiring table data of the index items, and recording the index items corresponding to invalid table data in the table data as invalid index items.
In this embodiment, when table data uses multi-version concurrency control and multiple version data are stored in a mixed mode, some table data failure problems may occur, for example, multiple version data in the same row also have multiple index entries corresponding to each other, and when an old version of table data fails, the corresponding index entries are also logically invalid, so that the accuracy of the obtained invalid index entries can be ensured by recording the index entries corresponding to the invalid table data in the table data as invalid index entries.
In one embodiment of the present invention, marking the final invalid index entry as invalid may include:
the final invalid index entry is marked as invalid in batches.
In the embodiment, the final invalid index item is marked as invalid in batches, so that batch marking is realized, the marking efficiency is high, and the method is very simple and convenient.
In one embodiment of the present invention, if the first modified sequence number is different from the second modified sequence number, the step of marking the final invalid index entry as invalid is abandoned.
In this embodiment, if the first modification sequence number is different from the second modification sequence number, the invalid index item is changed, and if the result of the marking is still accurate, the step of marking the final invalid index item as invalid is abandoned.
FIG. 3 is a schematic flow chart of a lock-free marking method of invalid indexes according to another embodiment of the present invention, which can include:
step S202: access to and physical modification of an index page is prohibited, wherein the index page has a plurality of index entries thereon.
Step S204: scanning and traversing index items of an index page, acquiring table data of the index items, recording the index items corresponding to invalid table data in the table data as invalid index items, and recording a first modification sequence number of the index page.
Step S206: when the lookup of the invalid index entry on the index page is completed, access and physical modification to the index page is allowed.
Step S208: and recording the invalid index item searched on the index page.
Step S210: access to the index page and physical modification are prohibited.
Step S212: the second modified sequence number of the index page is recorded.
Step S214: and judging whether the first modification sequence number is the same as the second modification sequence number.
If yes, step S216 is executed, and step S220 is executed.
Step S216: the final invalid index entry is marked as invalid.
Step S218: and modifying the second modification sequence number of the index page.
Step S220: allowing access to and physical modification of the index page.
Step S222: the marking of the final invalid index entry as invalid is abandoned.
The above embodiments may be combined arbitrarily, and according to any one of the above preferred embodiments or a combination of a plurality of preferred embodiments, the following beneficial effects can be achieved according to the embodiments of the present invention:
the lock-free marking method of the invalid index of the invention forbids the access and physical modification to the index page, searches the invalid index item on the index page, records the first modification sequence number of the index page, allows the access and physical modification to the index page when the search to the invalid index item on the index page is completed, avoids the access and physical modification to the index page during the period, and avoids or reduces the position change of the invalid index item, thereby ensuring the marking accuracy of the invalid index item. When the search of the invalid index item on the index page is completed, taking into consideration that some subsequent steps may take longer time, for example, the steps record the invalid index item searched on the index page, thus allowing access and physical modification to the index page, avoiding reducing concurrency of the database, avoiding influencing throughput of the database system, and relatively improving concurrency of the database and ensuring throughput of the database system compared with the scheme that access and physical modification to the index page are forbidden in the whole process. The embodiment has excellent balance between ensuring the accuracy of the marking of the invalid index item and ensuring the concurrency of the database, and has outstanding substantive characteristics and remarkable progress.
The present embodiment also provides a machine-readable storage medium and a computer device. FIG. 4 is a schematic diagram of a machine-readable storage medium 830 according to one embodiment of the invention; fig. 5 is a schematic diagram of a computer device 900 according to one embodiment of the invention. The machine-readable storage medium 830 has stored thereon a machine-executable program 840, which when executed by a processor implements the lock-less marking method of the invalid index of any of the embodiments described above.
Computer device 900 may include a memory 920, a processor 910, and a machine executable 840 stored on memory 920 and running on processor 910, and processor 910 implements the lock-free marking method of the invalid index of any of the embodiments described above when executing machine executable 840.
It should be noted that the logic and/or steps represented in the flow diagrams or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any machine-readable storage medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions.
For the purposes of this description of the embodiment, a machine-readable storage medium 830 can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer-readable medium 40 may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
It is to be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system.
The computer device 900 may be, for example, a server, a desktop computer, a notebook computer, a tablet computer, or a smartphone. In some examples, computer device 900 may be a cloud computing node. Computer device 900 may be described in the general context of computer-system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer device 900 may be implemented in a distributed cloud computing environment where remote processing devices coupled via a communications network perform tasks. In a distributed cloud computing environment, program modules may be located in both local and remote computing system storage media including memory storage devices.
Computer device 900 may include a processor 910 adapted to execute stored instructions, a memory 920 providing temporary storage for the operation of the instructions during operation. Processor 910 may be a single core processor, a multi-core processor, a computing cluster, or any number of other configurations. Memory 920 may include Random Access Memory (RAM), read only memory, flash memory, or any other suitable storage system.
Processor 910 may be connected by a system interconnect (e.g., PCI-Express, etc.) to an I/O interface (input/output interface) adapted to connect computer device 900 to one or more I/O devices (input/output devices). The I/O devices may include, for example, a keyboard and a pointing device, which may include a touch pad or touch screen, among others. The I/O device may be a built-in component of the computer device 900 or may be a device externally connected to the computing device.
The processor 910 may also be linked by a system interconnect to a display interface suitable for connecting the computer device 900 to a display device. The display device may include a display screen as a built-in component of the computer device 900. The display device may also include a computer monitor, television, projector, or the like, that is externally connected to the computer device 900. Further, a network interface controller (network interface controller, NIC) may be adapted to connect the computer device 900 to a network through a system interconnect. In some embodiments, the NIC may use any suitable interface or protocol (such as an internet small computer system interface, etc.) to transfer data. The network may be a cellular network, a radio network, a Wide Area Network (WAN), a Local Area Network (LAN), or the internet, among others. The remote device may be connected to the computing device through a network.
The flowcharts provided by this embodiment are not intended to indicate that the operations of the method are to be performed in any particular order, or that all of the operations of the method are included in all of each case. Furthermore, the method may include additional operations. Additional variations may be made to the above-described methods within the scope of the technical ideas provided by the methods of the present embodiments.
By now it should be appreciated by those skilled in the art that while a number of exemplary embodiments of the invention have been shown and described herein in detail, many other variations or modifications of the invention consistent with the principles of the invention may be directly ascertained or inferred from the present disclosure without departing from the spirit and scope of the invention. Accordingly, the scope of the present invention should be understood and deemed to cover all such other variations or modifications.
Claims (10)
1. A lock-free marking method of an invalid index, comprising:
prohibiting access to and physical modification of an index page, wherein the index page has a plurality of index entries thereon;
searching an invalid index item on the index page, and recording a first modification sequence number of the index page;
allowing access and physical modification to the index page when the search of the invalid index item on the index page is completed;
recording an invalid index item searched on the index page;
prohibiting access to and physical modification of the index page;
recording a second modification sequence number of the index page;
determining whether the invalid index item of the index page recorded is a final invalid index item according to the first modification sequence number and the second modification sequence number;
if yes, marking the final invalid index item as invalid;
access to the index page and physical modification are allowed.
2. The lock-free marking method of invalid index according to claim 1, wherein,
the determining whether the invalid index item of the index page of the record is a final invalid index item according to the first modification sequence number and the second modification sequence number comprises:
and judging whether the first modification sequence number is the same as the second modification sequence number.
3. The lock-free marking method of invalid index according to claim 1, wherein,
after said marking said final invalid index entry as invalid, further comprising:
the final invalid index entry marked invalid is cleaned up.
4. The lock-free marking method of invalid index according to claim 1, wherein,
after said marking said final invalid index entry as invalid, further comprising:
and modifying the second modification sequence number of the index page.
5. The lock-free marking method of invalid index according to claim 1, wherein,
the searching for the invalid index item on the index page comprises:
and searching invalid index items on the index page in a mode of scanning and traversing the index page.
6. The lock-less marking method of invalid indexes according to claim 5, wherein,
the searching for the invalid index item on the index page by scanning through the index page comprises the following steps:
scanning and traversing index items of the index page, acquiring table data of the index items, and recording the index items corresponding to invalid table data in the table data as invalid index items.
7. The lock-free marking method of invalid index according to claim 1, wherein,
the marking the final invalidation index entry as invalid includes:
and marking the final invalid index item as invalid in batches.
8. The lock-free marking method of invalid index according to claim 1, wherein,
and if the first modification sequence number is different from the second modification sequence number, discarding the step of marking the final invalid index item as invalid.
9. A machine readable storage medium having stored thereon a machine executable program which when executed by a processor implements the lock-less marking method of invalid indexes according to any of claims 1 to 8.
10. A computer device comprising a memory, a processor and a machine executable program stored on the memory and running on the processor, and the processor implementing a lock-less marking method of an invalid index according to any one of claims 1 to 8 when executing the machine executable program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310381230.6A CN116467310A (en) | 2023-04-11 | 2023-04-11 | Lock-free marking method for invalid index, storage medium and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310381230.6A CN116467310A (en) | 2023-04-11 | 2023-04-11 | Lock-free marking method for invalid index, storage medium and computer equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116467310A true CN116467310A (en) | 2023-07-21 |
Family
ID=87180099
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310381230.6A Pending CN116467310A (en) | 2023-04-11 | 2023-04-11 | Lock-free marking method for invalid index, storage medium and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116467310A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117076440A (en) * | 2023-10-16 | 2023-11-17 | 北京人大金仓信息技术股份有限公司 | Asynchronous cleaning method for global index on interval partition table, storage medium and equipment |
-
2023
- 2023-04-11 CN CN202310381230.6A patent/CN116467310A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117076440A (en) * | 2023-10-16 | 2023-11-17 | 北京人大金仓信息技术股份有限公司 | Asynchronous cleaning method for global index on interval partition table, storage medium and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10664497B2 (en) | Hybrid database table stored as both row and column store | |
| US20190272265A1 (en) | Hybrid Database Table Stored As Both Row and Column Store | |
| EP2605158B1 (en) | Mixed join of row and column database tables in native orientation | |
| US7533136B2 (en) | Efficient implementation of multiple work areas in a file system like repository that supports file versioning | |
| US8868595B2 (en) | Enhanced control to users to populate a cache in a database system | |
| US20130166553A1 (en) | Hybrid Database Table Stored as Both Row and Column Store | |
| CN113553339B (en) | Data query method, middleware, electronic device and storage medium | |
| CN116467310A (en) | Lock-free marking method for invalid index, storage medium and computer equipment | |
| EP4430482A1 (en) | Columnar cache query using hybrid query execution plan | |
| WO2021031583A1 (en) | Method and apparatus for executing statements, server and storage medium | |
| CN116662355A (en) | Marking method for invalid index, storage medium and computer device | |
| CN112612818B (en) | Data processing method and device, computing equipment and storage medium | |
| CN117076491A (en) | Data processing method, storage medium and equipment | |
| CN116610697A (en) | Query method, storage medium and device for database query statement | |
| CN115934760A (en) | Database query statement optimization method, storage medium and computer device | |
| CN116483845A (en) | Marking method, storage medium and apparatus for optimizing invalid index of concurrent conflict | |
| CN115391346A (en) | Database aggregation index generation method, storage medium and computer equipment | |
| CN115374121A (en) | Database index generation method, machine-readable storage medium and computer equipment | |
| CN115391424A (en) | Database query processing method, storage medium and computer equipment | |
| CN110333883B (en) | Method and device for updating persistent data | |
| CN116483846A (en) | Conflict processing method for invalid index item marker, storage medium and computer device | |
| CN117149821B (en) | Query optimization method, storage medium and computer equipment | |
| CN114791913B (en) | Shared memory buffer pool processing method, storage medium and equipment for database | |
| CN113918586A (en) | Data updating method, device, equipment and storage medium | |
| CN115470220A (en) | Database index updating method, storage medium and computer equipment |
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 | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: 100102 201, 2 / F, 101, No. 5 building, No. 7 Rongda Road, Chaoyang District, Beijing Applicant after: China Electronics Technology Group Jincang (Beijing) Technology Co.,Ltd. Address before: 100102 201, 2 / F, 101, No. 5 building, No. 7 Rongda Road, Chaoyang District, Beijing Applicant before: BEIJING KINGBASE INFORMATION TECHNOLOGIES Inc. Country or region before: China |