Composite hash and list partitioning of database tables

A method for partitioning during an online node add. The method includes providing a data storage cluster (110) with first and second nodes (114, 116), and storing a table (204) of data in the data storage cluster (110) with a first partition (222) storing a set of rows or data elements in the first...

Full description

Saved in:
Bibliographic Details
Main Authors ORELAND JONAS, ULIN TOMAS, CLEMENT FRAZER
Format Patent
LanguageChinese
English
Published 28.03.2012
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:A method for partitioning during an online node add. The method includes providing a data storage cluster (110) with first and second nodes (114, 116), and storing a table (204) of data in the data storage cluster (110) with a first partition (222) storing a set of rows or data elements in the first node and a second partition (320) storing a set of rows or data elements in the second node. The method includes adding a third node (118) to the cluster and adding a third partition to the table using a partitioning mechanism (140, 234) to create a distribution mapping (152) for data elements in the first, second, and third partitions.; The distribution mapping (152) provides substantially uniform distribution of the data elements over the first, second, and third partitions by the partitioning mechanism (140, 234) using modulo hash partitioning as a function of data elements or by combining hash and list partitioning (144, 148) such that data is retained on the original partitions.
Bibliography:Application Number: CN201080011589