Unlock instant, AI-driven research and patent intelligence for your innovation.

Index splitting in distributed databases

A database, distributed technology, applied in the field of distributed databases, can solve problems such as increasing waiting time, locking the database is not scalable, etc.

Pending Publication Date: 2020-05-29
NUODB
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, locking the database during an index split is not a scalable approach
Locking can also increase the latency associated with adding information to the database

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Index splitting in distributed databases
  • Index splitting in distributed databases
  • Index splitting in distributed databases

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] Embodiments described herein relate generally to distributed databases, and more specifically to splitting indexes in distributed databases. The systems and processes disclosed herein use a two-stage index splitting process to address the problems associated with maintaining multiple index splits for the same index in a distributed database without locking the distributed database during the splitting process. Correctness at the time of the copy. During the first phase of the index splitting process, nodes in the distributed database with index atoms split the index atoms into source atoms and target atoms. Also, during the second phase of the index splitting process, the node with the index flushes the messages forwarded from the source atom to the target atom. This two-phase split process makes it easier to maintain correctness, concurrency, and consistency across distributed databases if data is inserted while index atoms are being split.

[0024] Distributed datab...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

In a distributed database, many nodes can store copies, or instances, of the same record. If the record is split on one node, it should be split on the other nodes to maintain consistency, concurrency, and correctness of the data in the distributed database. In some distributed databases, the records are locked during the update process to ensure data integrity. Unfortunately, locking the recordscan increase latency, especially for larger databases. But if the records aren't locked and a node fails as a record is being split and updated simultaneously, the split and update may not propagate throughout the distributed database, leading to a loss of data integrity. Exchanging messages about the status of record splitting and forwarding updates internally reduces the likelihood of a loss ofdata integrity due to a node failure.

Description

[0001] Cross References to Related Applications [0002] This application claims priority under 35 U.S.C. §119(e) to U.S. Application Serial No. 62 / 545,791, filed August 15, 2017, entitled "Index Splitting in Distributed Databases" rights and interests, said U.S. application is incorporated herein by reference in its entirety. Background technique [0003] Databases are often indexed to enable efficient retrieval of certain information. The B-tree data structure is a popular index structure that is optimized for reading and writing in databases of large data blocks and enables efficient database searches. A B-tree data structure contains a root and a number of leaves. The root uses a different key value to identify each leaf. Each leaf points to a record containing a key value. Sort key-values ​​to form a sorted list. Specifically, a given leaf contains a "left sibling" (next leaf to the left) and a "sibling right" (next leaf to the right) in sorted order. The first or ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/27G06F16/22
CPCG06F16/2315G06F16/2272G06F16/2228H04L9/085G06F16/182H04L67/1097G06F16/24554
Inventor Y·达舍夫斯基
Owner NUODB