Global-results processing matrix for processing queries

• US 20040098372A1
• Filed: 11/14/2002
• Published: 05/20/2004
• Est. Priority Date: 11/14/2002
• Status: Active Grant

• Current Assignee: LexisNexis Risk Data Management, Inc. (RELX PLC)
• Original Assignee: LexisNexis Risk Data Management, Inc. (RELX PLC)
• Inventors: Bayliss, David, Smith, Jake, Hicks, Nigel, Halliday, Gavin, Poulsen, Ole, Chapman, Richard
• Granted Patent: US 7,945,581 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24532 of parallel queries

Abstract

A system and methods for parallel processing of queries to one or more databases are described herein. One or more databases may be distributed among a subset of slave nodes of a global-results processing matrix. A query to the database may be generated using a query-based high-level programming language. The query-based source code then may be converted to intermediary source code in a common programming language and then compiled into a dynamic link library (DLL) or other type of executable. The DLL is then distributed among the slave nodes of the processing matrix, whereupon the slave nodes execute related portions of the DLL substantially in parallel to generate initial query results. The initial query results may then be provided to master node of the global-results processing matrix for additional processing, whereby the master node is adapted to execute one or more associated portions of the DLL on the initial query results.

Claims

1. A system for processing at least one query to at least one database, the system comprising:

a query server for receiving a query and compiling at least one executable from query language based source code;

a master node being adapted to receive the at least one executable and comprising;

at least one storage device; and

a processor; and

a plurality of slave nodes operably connected to the master node and receiving at least a first portion of the at least one executable from the master node, each slave node comprising;

disk storage for receiving and storing a substantially distinct portion of the database; and

a processor for executing the first portion of the at least one executable on the stored database portion to generate a portion of initial query results;

wherein the plurality of slave nodes executes the first portion of the at least one executable substantially in parallel to generate a set of initial query results; and

wherein a second portion of the at least one executable is executed on the initial query results to generate resultant query results, which are stored at the master node.

2. The system of claim 1, wherein the query server generates intermediary source code from query source code, the query source code representing at least one database operation using the database and wherein the query source code is formatted based in part on a query-based programming language and compiles the intermediary source code to generate the at least one executable.

3. The system of claim 2, wherein the intermediary source code is one of a group consisting of:

C source code, C++ source code, Fortran source code; and

Pascal source code.

4. The system of claim 2, further comprising a query agent operably connected to the query server and the master node and being adapted to:

submit the at least one executable to the master node for execution; and

monitor an execution of the at least one executable.

5. The system of claim 4, further comprising a scheduling services module operably connected to the query agent and the query server and being adapted to:

schedule a time of execution of the at least one executable by the master node and slave nodes based on at least one characteristic of the at least one executable; and

direct the query agent to submit the executable to the master node at the scheduled time.

6. The system of claim 5, wherein the at least one characteristic of the at least one executable includes one of a group consisting of:

an expected execution time of the at least one executable;

a priority of the at least one executable;

a type of the at least one database operation represented by the at least one executable; and

a number of slave nodes expected to execute the at least one executable.

7. The system of claim 2, further comprising a work-unit reporting module operably connected to the query agent and being adapted to store at least a portion of the final query results.

8. The system of claim 2, further comprising a query builder module operably connected to the query server and being adapted to facilitate a client in generating the query source code using the query-based language.

9. The system of claim 8, wherein the query builder module includes a graphical user interface.

10. The system of claim 8, wherein the query builder module is further adapted to display at least a portion of the final query results to the client.

11. The system of claim 8, wherein the query builder module is further adapted to submit a representation of the query source code to the query server over a network.

12. The system of claim 1, further comprising a staging zone adapted to distribute the database among the slave nodes, each slave node receiving a different database portion.

13. The system of claim 12, wherein data of the database is distributed randomly among the slave nodes.

14. The system of claim 13, wherein the staging zone is further adapted to distribute the database using a hash function on a record field of each record of the database.

15. The system of claim 1, wherein the at least one executable includes at least one dynamic link library (DLL).

16. The system of claim 15, wherein each processing node further includes a software agent being adapted to execute a portion of the at least one DLL, wherein a software agent at the master node is configured to execute a second portion of the DLL

17. The system of claim 1, wherein at least the slave nodes are substantially homogeneous.

18. The system of claim 17, wherein the processors of the master and slave nodes are of the type found in general purpose, single-user microcomputers.

19. The system of claim 1, wherein the at least one database operation represented by the first portion of the at least one executable includes one of a group consisting of:

linking, matching, filtering, scoring, sorting, counting, and joining.

20. The system of claim 1, wherein the at least one database operation represented by the second portion of the at least one executable includes one of a group consisting of:

sorting, linking, collating, filtering, counting, deduping, joining, appending, merging, purging, non-hierarchical linking, neural-net scoring, and formatting.

21. The system of claim 1, wherein the plurality of slave nodes includes between ten slave nodes and one thousand slave nodes.

22. The system of claim 1, wherein the plurality of slave nodes includes between fifty slave nodes and five hundred slave nodes.

23. The system of claim 1, wherein the plurality of slave nodes includes between 100 slave nodes and three hundred slave nodes.

24. The system of claim 1, wherein the plurality of slave nodes includes at least one thousand slave nodes.

25. The system of claim 1, wherein the first and second portions of the at least one executable are at least essentially the same.

26. A system for processing at least one query to at least one database, the system comprising:

a plurality of processing nodes interconnected via a network and being adapted to execute at least one executable compiled from a query to generate results, each processing node comprising a processor, memory operably connected to the processor, disk storage operably connected to the processor and a network interface operably connected to the processor and adapted to facilitate communication with other processing nodes over the network;

the plurality of processing nodes comprising;

a plurality of slave nodes, each slave node comprising;

disk storage for storing a substantially distinct portion of the database; and

a processor for executing a first portion of the at least one executable on the stored database portion to generate a portion of initial query results;

wherein the plurality of slave nodes executes the first portion of the at least one executable substantially in parallel to generate a set of initial query results; and

a master node being adapted to receive the at least one executable and operably connected to the plurality of slave nodes, the master node comprising;

at least one storage device storing the initial query results generated by the plurality of slave nodes; and

a processor adapted to execute a second portion of the at least one executable on the stored initial query results to generate resultant query results.

27. The system of claim 26, further comprising a query server operably connected to the master node and being adapted to:

generate intermediary source code from query source code, the query source code representing at least one database operation using the database and wherein the query source code is formatted based in part on a query-based programming language; and

compile the intermediary source code to generate the at least one executable.

28. The system of claim 27, wherein the intermediary source code is one of a group consisting of:

C source code, C++ source code, Fortran source code; and

Pascal source code.

29. The system of claim 27, further comprising a query agent operably connected to the query server and the master node and being adapted to:

submit the at least one executable to the master node for execution; and

monitor an execution of the at least one executable.

30. The system of claim 29, further comprising a scheduling services module operably connected to the query agent and the query server and being adapted to:

schedule a time of execution of the at least one executable by the master node and slave nodes based on at least one characteristic of the at least one executable; and

direct the query agent to submit the executable to the master node at the scheduled time.

31. The system of claim 27, further comprising a work-unit reporting module operably connected to the query agent and being adapted to store at least a portion of the final query results.

32. The system of claim 27, further comprising a query builder module operably connected to the query server and being adapted to facilitate a client in generating the query source code using the query-based language.

33. The system of claim 32, wherein the query builder module includes a graphical user interface.

34. The system of claim 32, wherein the query builder module is further adapted to display at least a portion of the final query results to the client.

35. The system of claim 32, wherein the query builder module is further adapted to submit a representation of the query source code to the query server over a network.

36. The system of claim 26, further comprising a staging zone adapted to distribute the database among the slave nodes, each slave node receiving a different database portion.

37. The system of claim 36, wherein data of the database is distributed randomly among the slave nodes.

38. The system of claim 37, wherein the staging zone is further adapted to distribute the database using a hash function on a record field of each record of the database.

39. The system of claim 26, wherein the at least one executable includes at least one dynamic link library (DLL).

40. The system of claim 39, wherein each processing node further includes a software agent being adapted to execute a portion of the at least one DLL, wherein a software agent at the master node is configured to execute a second portion of the DLL

41. The system of claim 26, wherein at least the slave nodes are substantially homogeneous.

42. The system of claim 41, wherein the processors of the master and slave nodes are of the type found in general purpose, single-user microcomputers.

43. The system of claim 26, wherein the first and second portions of the at least one executable are at least essentially the same.

44. A system for processing at least one query to a database, the system comprising:

a query server being adapted to;

generate intermediary source code from query source code, the query source code representing at least one database operation performed on the database and wherein the query source code is formatted based in part on a query-based programming language; and

compile the intermediary source code to generate at least one executable; and

a global-results processing matrix including;

a plurality of slave nodes, each slave node storing on disk storage a different portion of the database and being adapted to execute a first portion of the at least one executable using the stored database portion to generate a portion of initial query results, the first portion of the at least one executable representing at least one database operation on the stored database portion, the plurality of slave nodes executing the first portion of the at least one executable substantially in parallel to generate a set of initial query results; and

a master node operably connected to the plurality of slave nodes and being adapted to;

store the initial query results on the disk storage of the master node; and

execute a second portion of the at least one executable on the stored initial query results to generate resultant query results, the second portion of the at least one executable representing at least one database operation on the initial query results.

45. The system of claim 44, wherein the intermediary source code is one of a group consisting of:

C source code, C++ source code, Fortran source code; and

Pascal source code

46. The system of claim 44, further comprising a query agent operably connected to the query server and the master node and being adapted to:

submit the at least one executable to the master node for execution; and

monitor an execution of the at least one executable by the master node and the plurality of slave nodes.

47. The system of claim 46, further comprising a scheduling service module operably connected to the query agent and the query server and being adapted to:

schedule a time of execution of the at least one executable by the master node and slave nodes based on at least one characteristic of the at least one executable; and

direct the query agent to submit the executable to the master node at the scheduled time.

48. The system of claim 47, wherein the at least one characteristic of the at least one executable includes one of a group consisting of:

an expected execution time of the at least one executable;

a priority of the at least one executable;

a type of the at least one database operation represented by the at least one executable; and

a number of slave nodes expected to execute the at least one executable.

49. The system of claim 44, further comprising a work-unit reporting module operably connected to the query agent and being adapted to store at least a portion of the final query results.

50. The system of claim 44, further comprising a query builder module operably connected to the query server and being adapted to facilitate a client in generating the query source code using the query-based language.

51. The system of claim 50, wherein the query builder module includes a graphical user interface.

52. The system of claim 50, wherein the query builder module is further adapted to display at least a portion of the final query results to the client.

53. The system of claim 50, wherein the query builder module is further adapted to submit a representation of the query source code to the query server over a network.

54. The system of claim 44, further comprising a staging zone adapted to distribute the database among the slave nodes, each slave node receiving a different database portion.

55. The system of claim 54, wherein the staging zone is further adapted to distribute the database using a hash function on a record field of each record of the database.

56. The system of claim 44, wherein the at least one executable includes at least one dynamic link library (DLL).

57. The system of claim 56, wherein each processing node further includes a software agent being adapted to execute a portion of the at least one DLL, wherein a software agent at the master node is configured to execute a second portion of the DLL

58. The system of claim 44, wherein the processing nodes are substantially homogeneous.

59. The system of claim 44, wherein the at least one database operation represented by the first portion of the at least one executable includes one of a group consisting of:

linking, matching, filtering, scoring, sorting, counting, and joining.

60. The system of claim 44, wherein the at least one database operation represented by the second portion of the at least one executable includes one of a group consisting of:

sorting, linking, collating, filtering, counting, deduping, joining, appending, merging, purging, non-hierarchical linking, neural-net scoring, and formatting.

61. The system of claim 44, wherein the first and second portions of the at least one executable are at least essentially the same.

62. A method for processing at least one query to a database distributed among a plurality of slave nodes of a global-results processing matrix, each slave node storing a separate database portion on disk storage, the method comprising the steps of:

receiving a query in a query-based language source code and compiling at least one executable from the query source code;

executing, at each slave node, a first portion of at least one executable using the stored database portion to generate a portion of initial query results, the first portion of the at least one executable representing at least one database operation on the stored database portion, the first portion being executed by the slave node substantially in parallel with an execution of the first portion by other slave nodes;

storing the initial query results to disk storage of a master node of the global-results processing matrix; and

executing, at the master node, a second portion of the at least one executable using the stored initial query results to generate final query results, the second portion of the at least one executable representing at least one database operation on the initial query results.

63. The method of claim 62, further comprising the steps of:

generating intermediary source code from query source code, the query source code representing least one database operation using the database and wherein the query source code is formatted based in part on a query-based programming language; and

compiling the intermediary source code to generate the at least one executable.

64. The method of claim 62, further comprising the step of distributing the database among the slave nodes.

65. The method of claim 64, wherein data of the database is randomly distributed among the slave nodes.

66. The method of claim 63, wherein the at least one executable includes at least one dynamic link library (DLL).

67. The method of claim 62, wherein the processing nodes are substantially homogeneous.

68. The method of claim 62, wherein the at least one database operation represented by the first portion of the at least one executable includes one of a group consisting of:

linking, matching, filtering, scoring, sorting, counting, and joining.

69. The method of claim 62, wherein the at least one database operation represented by the second portion of the at least one executable includes one of a group consisting of:

sorting, linking, collating, filtering, counting, deduping, joining, appending, merging, purging, non-hierarchical linking, neural-net scoring, and formatting.

70. The method of claim 62, wherein the plurality of slave nodes includes between ten slave nodes and one thousand slave nodes.

71. The method of claim 62, wherein the plurality of slave nodes includes between fifty slave nodes and five hundred slave nodes.

72. The method of claim 62, wherein the plurality of slave nodes includes between 100 slave nodes and three hundred slave nodes.

73. The method of claim 62, wherein the plurality of slave nodes includes at least one thousand slave nodes.

74. In a global-results processing matrix including a master node and a plurality of slave nodes, each of the master node and slave nodes including a processor and disk storage, a computer readable medium, the computer readable medium comprising:

a first set of executable instructions being adapted to manipulate the processor of each slave node to execute a first portion of the at least one executable using the a portion of a database stored at the disk storage of the slave node to generate a portion of initial query results, the first portion of the at least one executable representing at least one database operation on the stored database portion, the first portion being executed by the slave node substantially in parallel with an execution of the first portion by other slave nodes; and

a second set of executable instructions being adapted to manipulate the processor of the master node to execute a second portion of the at least one executable using the initial query results to generate final query results, the second portion of the at least one executable representing at least one database operation using the initial query results.

75. The computer readable medium of claim 74, further comprising a third set of executable instructions being adapted to manipulate a processor to:

generate intermediary source code from query source code, the query source code representing least one database operation using the database and wherein the query source code is formatted based in part on a query-based programming language;

compile the intermediary source code to generate the at least one executable; and

provide the at least one executable to the master node.

76. The computer readable medium of claim 74, wherein the at least one executable includes at least one dynamic link library (DLL).

77. The computer readable medium of claim 74, wherein the at least one database operation represented by the first portion of the at least one executable includes one of a group consisting of:

linking, matching, filtering, scoring, sorting, counting, and joining.

78. The computer readable medium of claim 74, wherein the at least one database operation represented by the second portion of the at least one executable includes one of a group consisting of:

sorting, linking, collating, filtering, counting, deduping, joining, appending, merging, purging, non-hierarchical linking, neural-net scoring, and formatting.