Composite hash and list partitioning of database tables
AssigneeOracle America, Inc.
InventorsJonas Oreland, Frazer Clement, Tomas Ulin
Life of this patent
Estimating the term…
Loading patent…
AssigneeOracle America, Inc.
InventorsJonas Oreland, Frazer Clement, Tomas Ulin
Estimating the term…
A method for partitioning during an online node add. The method includes providing a data storage cluster with first and second nodes, and storing a table of data in the data storage cluster with a first partition storing a set of rows or data elements in the first node and a second partition storing a set of rows or data elements in the second node. The method includes adding a third node to the cluster and adding a third partition to the table using a partitioning mechanism to create a distribution mapping for data elements in the first, second, and third partitions. The distribution mapping provides substantially uniform distribution of the data elements over the first, second, and third partitions by the partitioning mechanism using modulo hash partitioning as a function of data elements or by combining hash and list partitioning such that data is retained on the original partitions.
A method for reorganizing a table of a database, comprising:
A data storage system for storing rows of data in a data table, comprising:
A data storage system for storing rows of data in a table, comprising:
A computer program product including a computer useable medium with computer readable code embodied on the computer useable medium, the computer readable code comprising:
A computer program product including a computer useable medium with computer readable code embodied on the computer useable medium, the computer readable code comprising:
A computer program product including a computer useable medium with computer readable code embodied on the computer useable medium, the computer readable code comprising:
Dependencies are inferred from the claim text.