METHOD AND SYSTEM FOR PARTITIONING DATABASE

• US 20140114910A1
• Filed: 09/26/2013
• Published: 04/24/2014
• Est. Priority Date: 09/29/2012
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Cao, Yu, Chen, Jidong, Guo, Xiaoyan
• Granted Patent: US 10,031,962 B2
• Time in Patent Office: Days
• US Class Current: 707/607
• CPC Class Codes: G06F 16/278 Data partitioning, e.g. horizontal or vertical partitioning

Abstract

The present invention relates to a method and system for partitioning a database. The method for partitioning a database comprises: grouping a plurality of entries in the database into one or more entry groups, so that entries in the same entry group are always accessed together by one or more transactions; and dividing the one or more entry groups into a set number of partitions, so that a total number of transactions that access across more than one partition is minimized. By means of the present invention, it is possible to obtain an efficient, flexible and convenient method for partitioning a database, thereby greatly improving the system performance.

Claims

1-20. -20. (canceled)

21. A computer-executable method of managing a database on a data storage system, wherein the database includes one or more entries wherein each of the one or more entries interacts with one or more transactions, the computer-executable method comprising:

mapping the one or more entries of the database on the data storage system onto one or more nodes of the data storage system, wherein the mapping enables distribution of the one or more transactions among the one or more nodes of the data storage system; and

implementing the mapping of the one or more entries of the database on the data storage system.

22. The computer-executable method of claim 21, wherein the mapping comprises:

grouping each of the one or more entries into one or more entry groups; and

dividing the one or more entry groups into one or more partitions.

23. The computer-executable method of claim 22, wherein the each of the one or more entries are grouped such that the entries in the same entry are accessed together by the at least one of the one or more transactions.

24. The computer-executable method of claim 22, wherein the dividing comprises:

mapping the one or more entry groups to vertex(es);

mapping one or more transactions accessing entries contained in one or more entry groups represented by the vertex(es) to edge(s) associated with the vertex(es), creating a graph structure;

25. The computer-executable method of claim 24, wherein the graph structure is a hyper-graph.

26. The computer-executable method of claim 24, further comprising:

dividing the graph structure into two or more portions, so that the number of cut edges is minimal.

27. A system, comprising:

a data storage system including a database, wherein the database includes one or more entries, wherein each of the one or more entries interacts with one or more transactions; and

computer-executable logic encoded in memory of one or more computers in communication with the data storage system to manage the database on the data storage system, wherein the computer-executable program logic is configured for the execution of;

mapping the one or more entries of the database on the data storage system onto one or more nodes of the data storage system, wherein the mapping enables distribution of the one or more transactions among the one or more nodes of the data storage system; and

implementing the mapping of the one or more entries of the database on the data storage system.

28. The system of claim 27, wherein the mapping comprises:

grouping each of the one or more entries into one or more entry groups; and

dividing the one or more entry groups into one or more partitions.

29. The system of claim 28, wherein the each of the one or more entries are grouped such that the entries in the same entry are accessed together by the at least one of the one or more transactions.

30. The system of claim 28, wherein the dividing comprises:

mapping the one or more entry groups to vertex(es);

mapping one or more transactions accessing entries contained in one or more entry groups represented by the vertex(es) to edge(s) associated with the vertex(es), creating a graph structure;

31. The system of claim 30, wherein the graph structure is a hyper-graph.

32. The system of claim 30, wherein the computer-executable program logic is further configured for the execution of:

dividing the graph structure into two or more portions, so that the number of cut edges is minimal.

33. A computer program product for managing a database on a data storage system, wherein the database includes one or more entries wherein each of the one or more entries interacts with one or more transactions, the computer program product comprising:

a non-transitory computer readable medium encoded with computer-executable program code for using read signatures in replication, the code configured to enable the execution of;

mapping the one or more entries of the database on the data storage system onto one or more nodes of the data storage system, wherein the mapping enables distribution of the one or more transactions among the one or more nodes of the data storage system;

implementing the mapping of the one or more entries of the database on the data storage system.

34. The computer program product of claim 33, wherein the mapping comprises:

grouping each of the one or more entries into one or more entry groups; and

dividing the one or more entry groups into one or more partitions.

35. The computer program product of claim 34, wherein the each of the one or more entries are grouped such that the entries in the same entry are accessed together by the at least one of the one or more transactions.

36. The computer program product of claim 34, wherein the dividing comprises:

mapping the one or more entry groups to vertex(es);

mapping one or more transactions accessing entries contained in one or more entry groups represented by the vertex(es) to edge(s) associated with the vertex(es), creating a graph structure;

37. The computer program product of claim 36, wherein the graph structure is a hyper-graph.

38. The computer program product of claim 36, wherein the code is further configured to enable the execution of:

dividing the graph structure into two or more portions, so that the number of cut edges is minimal.