Patents by Inventor Richard K. Chapman

Richard K. Chapman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8266234
    Abstract: A database system for processing a query includes at least one master node that is operable to communicate a multicast signal over a plurality of communication channels. The multicast signal includes a request to perform an action associated with a pre-compiled query. In one particular embodiment, the at least one master node communicates the multicast signal over a first communication channel. The system also includes a plurality of slave nodes that are coupled to the at least one master node. Each of the plurality of slave nodes is operable to receive the multicast signal from the first communication channel. In this particular embodiment, at least one of the plurality of slave nodes provides access to at least one key part that is also accessible through another one of the plurality of slave nodes.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: September 11, 2012
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7917495
    Abstract: In certain embodiments, a database system for processing a query request comprises at least one master node operable to store a precompiled query that is capable of resolving a query request received by the database system. The at least on master node is further operable to receive a query request comprising one or more parameters and associated with the precompiled query, and to communicate a request to perform one or more activities associated with the precompiled query. The system further comprises a plurality of slave nodes coupled to the at least one master node, each of the slave nodes operable to store one or more key parts each comprising data capable of resolving a portion of the precompiled query. At least one of the slave nodes is operable to receive the request communicated by the at least one master node and to process the request communicated by the at least one master node.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: March 29, 2011
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7873650
    Abstract: A parallel-processing system that is capable of dynamically creating a distributed tree for distributing data. The system includes a plurality of first nodes. Each of the plurality of first nodes is capable of establishing a connection with at least one of the plurality of first nodes to form at least a portion of a dynamically created distribution tree. The system also includes a second node that is capable of receiving data for distribution within the parallel-processing system. The second node is also capable of establishing a connection with at least two of the plurality of first nodes. In this particular embodiment, the second node and the plurality of first nodes operate to form the dynamically created distribution tree. Moreover, the second node also operates to distribute the data to each of the plurality of first nodes through the dynamically created distribution tree.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: January 18, 2011
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7801911
    Abstract: A database system that is capable of using an activity ID for processing a query. The database system includes at least one master node that is operable to communicate a request to perform a remote action associated with a pre-compiled query. The request comprises an activity ID that identifies the remote action associated with the pre-compiled query. The system further includes at least one slave node that is coupled to the at least one master node. The at least one slave node is operable to receive the request to perform the remote action and to process the request to perform the remote action. In one particular embodiment, the activity ID operates to directs the at least one slave node to one or more executables for use in processing the request.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: September 21, 2010
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7797333
    Abstract: A database system for processing a query request comprises a master node that communicates a request to perform one or more activities associated with a precompiled query over at least one communication channel. A plurality of slave nodes are coupled to the master node. At least a particular one of the slave node receives the request communicated by the master node, performs at least a portion of the one or more activities associated with the request to obtain one or more results for the request, communicates a request-to-send message to the master node indicating that the one or more results are available for communication to the master node, and communicates at least a portion of the one or more results to the master node in response to receiving a permission-to-send message from the master node.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: September 14, 2010
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7778997
    Abstract: In certain embodiments, a database system for processing a query request comprises a first master node operable to receive a plurality of requests from a plurality of clients coupled to the database system. The first master node is capable of processing a first predetermined number of query requests substantially concurrently, each of the plurality of query requests comprising one or more parameters and being associated with at least one of a plurality of precompiled queries. The first master node is also operable to assign at least a first subset of the first predetermined number of query requests as being available to a first client, and to assign at least a second subset of the first predetermined number of query requests as being available to a second client.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: August 17, 2010
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7739287
    Abstract: A database system capable of dynamically creating one or more keys associated with one or more pre-compiled queries includes a plurality of slave nodes that are operable to execute one or more pre-compiled queries. Each of the plurality of slave nodes operates to store one or more usage statistics that relate to the execution of the one or more pre-compiled queries. The system also includes at least one master node that is coupled to each of the plurality of slave nodes. The at least one master node is operable to receive the one or more usage statistics from each of the plurality of slave nodes. Furthermore, the at least one master node is operable to identify, based at least in part on the one or more usage statistics, one or more keys to dynamically create. Moreover, each of the plurality of slave nodes dynamically creates the one or more keys for use in executing the one or more pre-compiled queries.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: June 15, 2010
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7693826
    Abstract: A parallel database system capable of deploying a pre-compiled query and pre-keying data associated with the pre-compiled query includes at least one master node. The at least one master node is operable to store and execute a pre-compiled query that is capable of resolving a data request received by the parallel database system. The system further includes a plurality of slave nodes coupled to the at least one master node. In this particular embodiment, each of the plurality of slave nodes is operable to store one or more key parts. The one or more key parts include data capable of resolving a portion of the pre-compiled query.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: April 6, 2010
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith
  • Patent number: 7406461
    Abstract: In certain embodiments, a database system for processing a query request comprises at least one master node operable to communicate a request over a communication channel, the request comprising a request to perform an activity associated with a precompiled query. The system further includes a first slave node and a second slave node each coupled to the at least one master node, each of the first and second slave nodes operable to receive the request on the communication channel. The first slave node is further operable to communicate a first notification over the communication channel indicating that the first slave node is handling the request, and the second slave node is operable to receive the first notification communicated over the communication channel indicating that the first slave node is handling the request.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: July 29, 2008
    Assignee: Seisint, Inc.
    Inventors: Richard K. Chapman, David A. Bayliss, Gavin C. Halliday, Nigel G. Hicks, Ole D. Poulsen, Jacob Cobbett-Smith