US6490585B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cellular multiprocessor data warehouse
Assignee: Google LLC
•
Filing: 1999-11-12
•
Granted: 2002-12-03
•
Expires: 2019-11-12
Abstract
Abstract A number of partitions of a cellular multiprocessor (CMP) are connected to respective databases and form respective nodes of a data warehouse. Heterogeneous data stored across the nodes is accessed automatically in parallel at high speed from a user site using a simple script request containing a data source object name wherein the heterogeneous data is treated as a single data source object, the script further containing at least one method to be performed on the data source object. Respective agent processes are stored in memory dedicated to each partition and automatically generate descriptor files containing metadata corresponding to the data source object from a repository available to each partition. A messenger process transmits the new scripts to the appropriate nodes via memory-based messaging using a shared portion of the CMP memory. Respective agent processes at each node respond to automatically access the appropriate data and execute specified methods upon it.
Inventors
- 👤 Charles Albin Hanson
- 👤 Thomas Winston Johnson
- 👤 Carol Jean O'Hara
- 👤 Koon-yui Poon
- 👤 Roger Anthony Redding
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 12:37
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2458; G06F16/2471
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
194 words
A method of accessing and operating upon heterogeneous data at a plurality of nodes comprising the steps of: (1) storing a plurality of messenger processes and a plurality of agent processes in a memory of a cellular multiprocessor wherein said cellular multiprocessor is partitioned into a plurality of groups of microprocessors, each partition corresponding to one of said nodes and being connected to control a database or databases located at each node; (2) propounding a request containing a data source object name wherein the heterogeneous data is treated as a single data source object, said request further containing at least one method to be performed on the data source object; (3) employing a first of said agent processes to determine whether the data source object is distributed across a plurality of nodes; (4) if the data source object is determined to be distributed, employing said first agent process to break the request into a plurality of new requests, each of said new requests having a format appropriate to one of the respective nodes; and (5) transmitting each of the new requests to its respective corresponding node via memory-based messaging provided by said cellular multiprocessor.
Claim 2
Independent Claim
194 words
A method of accessing and operating upon heterogeneous data at a plurality of nodes comprising the steps of: (1) storing a plurality of messenger processes and a plurality of agent processes in a memory of a cellular multiprocessor wherein said cellular multiprocessor is partitioned into a plurality of groups of microprocessors, each partition corresponding to one of said nodes and being connected to control a database or databases located at each node; (2) propounding a request containing a data source object name wherein the heterogeneous data is treated as a single data source object, said request further containing at least one method to be performed on the data source object; (3) employing a first of said agent processes to determine whether the data source object is distributed across a plurality of nodes; (4) if the data source object is determined to be distributed, employing said first agent process to break the request into a plurality of new requests, each of said new requests having a format appropriate to one of the respective nodes; and (5) transmitting each of the new requests to its respective corresponding node via memory-based messaging provided by said cellular multiprocessor.
Claim 3
Dependent Claim
24 words
The method of claim 1 further comprising the step of executing the new requests concurrently on the data source object at the corresponding nodes.
Claim 4
Dependent Claim
25 words
The method of claim 1 further comprising the step of determining whether the data source object is stored locally or is non-distributed but stored remotely.
Claim 5
Dependent Claim
22 words
The method of claim 1 wherein a first agent process performs the step of determining whether the data source object is distributed.
Claim 6
Dependent Claim
34 words
The method of claim 4 wherein, in performing the step of determining, the first agent process consults a data source descriptor file containing a subset of data contained in a first repository of metadata.
Claim 7
Dependent Claim
22 words
The method of claim 5 wherein said first repository of metadata and said first agent process are located at a common node.
Claim 8
Dependent Claim
18 words
The method of claim 6 wherein the data source descriptor file is created from the repository at run-time.
Claim 9
Dependent Claim
26 words
The method of claim 4 wherein a first messenger process cooperates with said first agent process to transmit each said new request to its respective node.
Claim 10
Dependent Claim
30 words
The method of claim 8 wherein said request is in the form of a script and each said new request is in the form of a script having said format.
Claim 11
Dependent Claim
21 words
The method of claim 9 wherein said script and said new scripts are each in the form of a Java script.
Claim 12
Dependent Claim
49 words
The method of claim 8 wherein each of said nodes has associated therewith a respective database, and a respective agent process, each respective agent process comprising code selected to execute the respective new script with respect to the data source object as it is contained in the respective database.
Claim 13
Dependent Claim
17 words
The method of claim 11 wherein each of said databases is different from the remaining respective databases.
Claim 14
Dependent Claim
27 words
The method of claim 12 wherein the respective databases comprise at least two databases, each selected from the following group: Oracle database, NT database and SQL Server.
Claim 15
Dependent Claim
29 words
The method of claim 11 wherein each respective agent process accesses metadata located at the respective node in the course of executing the respective new script at that node.
Claim 16
Dependent Claim
46 words
The method of claim 14 wherein a data source descriptor file is created from the metadata at each respective node for use by the respective agent process, and wherein the descriptor file contents are stored in the dedicated memory of the partition of each respective node.
Claim 17
Dependent Claim
44 words
The method of claim 15 wherein the metadata comprises a collection of data source objects which reflect treatment of data stored in each respective database as a single object and wherein each of said data source objects is broken down into successive class levels.
Claim 18
Dependent Claim
26 words
The method of claim 16 wherein said class levels include a class comprising a System Node, System Server, Data Source Object, Field Desc and System Script.
Claim 19
Independent Claim
86 words
The apparatus comprising: a plurality of databases, each located at a different node, each node comprising a partition of a cellular multiprocessor, and an agent code module associated with each node, each agent code module being constructed to determine whether a data source object presented in a script is distributed across a plurality of said nodes, and if said object is distributed, to break the script into a plurality of new scripts, each new script being suitable for execution at a respective one of said nodes.
Claim 20
Independent Claim
86 words
The apparatus comprising: a plurality of databases, each located at a different node, each node comprising a partition of a cellular multiprocessor, and an agent code module associated with each node, each agent code module being constructed to determine whether a data source object presented in a script is distributed across a plurality of said nodes, and if said object is distributed, to break the script into a plurality of new scripts, each new script being suitable for execution at a respective one of said nodes.
Claim 21
Dependent Claim
27 words
The apparatus of claim 18 further including a messenger code module at each node for facilitating transmission of each of said new scripts to its respective node.
Claim 22
Dependent Claim
38 words
The apparatus of claim 18 where each said agent code module is operable to extract the data corresponding to said data source object from said database and to execute a method contained in said script on said data.
Claim 23
Dependent Claim
35 words
The apparatus of claim 20 further including a repository of metadata stored in a memory of said cellular multiprocessor, said metadata describing the contents of the data source objects available at each of said nodes.
Claim 24
Dependent Claim
34 words
The apparatus of claim 20 further including a repository application at each node for creating a data source descriptor file for use by the agent in extracting data from the database at that node.
Claim 25
Dependent Claim
25 words
The apparatus of claim 19 wherein each agent and messenger code module is stored in an area of memory accessible only to its associated partition.
Claim 26
Dependent Claim
18 words
The apparatus of claim 18 wherein said new scripts are transmitted by memory-based messaging to their respective nodes.
Claim 27
Dependent Claim
174 words
An article of manufacture comprising: a computer usable medium having computer readable program code means embodied in said medium for accessing and executing methods on data at each of a plurality of nodes, each of said nodes comprising a partition of cellular multiprocessor, said data being treated as a single data source object, the computer readable code means being stored in a memory of said cellular multiprocessor and comprising: means for receiving a request containing a data source object name wherein heterogeneous data is treated as a single data source object, said request further containing at least one method to be performed on the data source object; means for determining whether the data source object is distributed across a plurality of said nodes, and if the data source object is determined to be distributed, breaking the request into a plurality of new requests, each of said new requests having a format appropriate to one of the respective nodes; and means for transmitting each of the new requests in parallel to its respective corresponding node.
Claim 28
Dependent Claim
174 words
An article of manufacture comprising: a computer usable medium having computer readable program code means embodied in said medium for accessing and executing methods on data at each of a plurality of nodes, each of said nodes comprising a partition of cellular multiprocessor, said data being treated as a single data source object, the computer readable code means being stored in a memory of said cellular multiprocessor and comprising: means for receiving a request containing a data source object name wherein heterogeneous data is treated as a single data source object, said request further containing at least one method to be performed on the data source object; means for determining whether the data source object is distributed across a plurality of said nodes, and if the data source object is determined to be distributed, breaking the request into a plurality of new requests, each of said new requests having a format appropriate to one of the respective nodes; and means for transmitting each of the new requests in parallel to its respective corresponding node.
Claim 29
Dependent Claim
29 words
The article of claim 25 where said computer readable code means further comprises means of executing the new requests concurrently on the data source object at the corresponding nodes.
Claim 30
Dependent Claim
39 words
The method of claim 26 where the computer readable code means further comprise means for determining whether the data source object is stored locally in the partition containing the agent making the determination or is non-distributed but stored remotely.
Claim 31
Dependent Claim
60 words
The method of claim 27 wherein said means for determining comprises a first agent process, said first agent process including means for consulting a data source descriptor file containing a subset of data contained in a first repository of metadata, said repository being stored in the memory of said cellular multiprocessor and accessible to each partition of said cellular multiprocessor.
References Cited (Backward Citations)
US5590319A
Cited
US5664182A
Cited
US5913214A
Cited
US5884312A
Cited
US5899990A
Cited
US6108646A
Cited
US6314501B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-12-02 | 2006-06-03 | 2006-12-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-12-02 | 2010-06-03 | 2010-12-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-12-02 | 2014-06-03 | 2014-12-03 | $7700.00 | Window Closed / Lapsed |