Patents by Inventor Patrick Dantressangle

Patrick Dantressangle 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).

  • Publication number: 20120303609
    Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
    Type: Application
    Filed: July 30, 2012
    Publication date: November 29, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Publication number: 20120290608
    Abstract: At least one user table in a relational database management system (RDBMS) using a first operator within a structured query language (SQL) command is identified. The first operator within the SQL command is utilized to transfer one or more data items from the at least one user table to a data array within the RDBMS. The data array is processed within the RDBMS, and one or more output values are generated based on the processing.
    Type: Application
    Filed: April 11, 2012
    Publication date: November 15, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Patrick Dantressangle, Eberhard Hechler, Martin Oberhofer, Michael Wurst
  • Patent number: 8285710
    Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
    Type: Grant
    Filed: October 9, 2008
    Date of Patent: October 9, 2012
    Assignee: International Business Machines Corporation
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Patent number: 8250140
    Abstract: An apparatus for enabling connections for use with a network comprising at least one vertex, the apparatus comprising: a receiver, for receiving a first message associated with the first vertex, wherein the first message comprises an indication that the first vertex wishes to join the network; a generator, responsive to receipt of the first message, for generating a second message associated with the at least one vertex, wherein the second message comprising an indication that the at least one vertex is operable to connect to the first vertex; and a probabilistic component for determining a first time value associated with transmission of the second message to the first vertex in accordance with probabilistic data.
    Type: Grant
    Filed: April 11, 2008
    Date of Patent: August 21, 2012
    Assignee: International Business Machines Corporation
    Inventors: Graham A Bent, Flavio A Bergamaschi, Patrick Dantressangle, Christopher Gibson
  • Publication number: 20120155290
    Abstract: The invention relates to a method for carrying out predictive analysis relating to nodes of a communication network. The method comprises the steps of providing communication event information for a first set of nodes and a second set of nodes of the communication network, providing a set of attributes for the nodes of the first set, using said attributes and said communication event information for determining a set of groups among the first set of nodes, assigning each node of the second set to at least one group of the set of groups based at least on the communication event information available for the second group, the assigning resulting in membership information of the nodes of the second set as well as deriving or applying a prediction model for the second set of nodes based on the communication event information for the second set and the membership information.
    Type: Application
    Filed: August 26, 2011
    Publication date: June 21, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Patrick DANTRESSANGLE, Eberhard HECHLER, Martin OBERHOFER, Michael WURST
  • Publication number: 20120136898
    Abstract: A logical table definition is received as part of a database query within a distributed database system. A determination is made as to whether the received logical table definition matches a local logical table definition. The query is processed in response to determining that the received logical table definition matches the local logical table definition. The query is forwarded to at least one other distributed database node.
    Type: Application
    Filed: February 2, 2012
    Publication date: May 31, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Patent number: 8145652
    Abstract: A logical table definition is received in association with a database query within a distributed database system. A determination is made as to whether the received logical table definition matches a local logical table definition. The query is processed in response to determining that the received logical table definition matches the local logical table definition. The query is forwarded to at least one other distributed database node. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
    Type: Grant
    Filed: October 9, 2008
    Date of Patent: March 27, 2012
    Assignee: International Business Machines Corporation
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Publication number: 20110173219
    Abstract: A database query is received including a logical table identifier at a distributed database node within a distributed network of databases. The logical table identifier includes a dynamically-updatable constant column identifier. Local logical table definitions are filtered based upon the logical table identifier and the dynamically-updatable constant column identifier to identify a local logical table associated with the logical table identifier and the dynamically-updatable constant column identifier. A local query response is formed including data retrieved from a local physical database table mapped by the local logical table in response to identifying the local logical table associated with the logical table identifier and the dynamically-updatable constant column identifier. The database query is responded to, in response to forming the local query response, with at least the local query response.
    Type: Application
    Filed: October 9, 2008
    Publication date: July 14, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Publication number: 20110131242
    Abstract: Methods and systems are provided, for persistent querying in a federated database system. A federated database system has a plurality of connectable database management system nodes, each database node having at least one database. Persistent querying includes: receiving a query at a first database node and propagating the query from the first database node to other database nodes in the federated database system. A responding database node satisfying the query: obtains a query results set; defines a topic identifier for the query; and publishes subsequent messages relating to the topic identifier when data updates are available. The first database node receives query results sets from one or more responding nodes and the first database node subscribes to topic identifiers for publications of subsequent messages from the responding database nodes. Subsequent messages are published relating to the query along the connection through which the query is returned.
    Type: Application
    Filed: November 23, 2010
    Publication date: June 2, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham Bent, Patrick Dantressangle, Christopher R. Gibson, David R. Vyvyan
  • Publication number: 20100094851
    Abstract: A database query is received that includes a logical query indicator at a distributed database node within a distributed network of databases. The logical query indicator includes at least one physical database query and at least one database node identifier that allows at least one distributed database node to identify at least one physical database to execute the physical database query against. It is determined that the at least one database node identifier matches a local node identifier. The at least one physical database query is executed against at least one local physical database table. A local query response is formed including data retrieved from the at least one local physical database table. The database query is responded to with at least the local query response. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
    Type: Application
    Filed: October 9, 2008
    Publication date: April 15, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Publication number: 20100094892
    Abstract: A logical table definition is received in association with a database query within a distributed database system. A determination is made as to whether the received logical table definition matches a local logical table definition. The query is processed in response to determining that the received logical table definition matches the local logical table definition. The query is forwarded to at least one other distributed database node. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
    Type: Application
    Filed: October 9, 2008
    Publication date: April 15, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Publication number: 20100094862
    Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
    Type: Application
    Filed: October 9, 2008
    Publication date: April 15, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
  • Patent number: 7668805
    Abstract: A system, computer usable medium and computer-based method for supporting named memory variables in an information retrieval system including a relational database. PUBLIC and PRIVATE named memory variables can be created, referenced, modified or deleted using SQL statements. The information retrieval system allocates a memory area as a named variable storage space for storing named memory variables. System catalogs may be used for storing information about PUBLIC, SECURE PUBLIC, PRIVATE, SECURE PRIVATE and pre-defined named memory variables. PUBLIC and PRIVATE named memory variables can be used for transferring information between SQL statements of one or more sessions or for retrieving system information from the relational database. Both PUBLIC and PRIVATE types can be defined as SECURE named memory variables requiring specific authorization privileges to read or write to the variable.
    Type: Grant
    Filed: September 1, 2004
    Date of Patent: February 23, 2010
    Assignee: International Business Machines Corporation
    Inventors: Paul Miller Bird, Curt Lee Cotner, Patrick Dantressangle
  • Publication number: 20090083379
    Abstract: An apparatus for enabling connections for use with a network comprising at least one vertex, the apparatus comprising: a receiver, for receiving a first message associated with the first vertex, wherein the first message comprises an indication that the first vertex wishes to join the network; a generator, responsive to receipt of the first message, for generating a second message associated with the at least one vertex, wherein the second message comprising an indication that the at least one vertex is operable to connect to the first vertex; and a probabilistic component for determining a first time value associated with transmission of the second message to the first vertex in accordance with probabilistic data.
    Type: Application
    Filed: April 11, 2008
    Publication date: March 26, 2009
    Inventors: Graham A Bent, Flavio A Bergamaschi, Patrick Dantressangle, Christopher Gibson
  • Publication number: 20090077036
    Abstract: A method for propagating a query in a system made up of a number connectable database management system nodes, where each node is associated at least one database, includes: selecting a first node from the number of nodes; generating at least one connection operable to propagate a query from the first node to a first subset of the number of nodes; generating at least one connection operable to propagate a query from a second node in the first subset to a second subset of the plurality of nodes; where at least one node in the second subset is different from nodes in the first subset.
    Type: Application
    Filed: September 3, 2008
    Publication date: March 19, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle, John B. Ibbotson
  • Publication number: 20090077075
    Abstract: A method for managing a logical statement within a distributed database includes checking, responsive to receipt of a first logical statement for by first database management system node, whether the first logical statement is stored within a segment of the distributed database; and storing, responsive to a determination that the first logical statement is not stored within a segment of the distributed database, storing the first logical statement in at least one of non-unique fact table and unique fact table.
    Type: Application
    Filed: September 3, 2008
    Publication date: March 19, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Graham A. Bent, Patrick Dantressangle
  • Publication number: 20050097090
    Abstract: A system, computer usable medium and computer-based method for supporting named memory variables in an information retrieval system including a relational database. PUBLIC and PRIVATE named memory variables can be created, referenced, modified or deleted using SQL statements. The information retrieval system allocates a memory area as a named variable storage space for storing named memory variables. System catalogs may be used for storing information about PUBLIC, SECURE PUBLIC, PRIVATE, SECURE PRIVATE and pre-defined named memory variables. PUBLIC and PRIVATE named memory variables can be used for transferring information between SQL statements of one or more sessions or for retrieving system information from the relational database. Both PUBLIC and PRIVATE types can be defined as SECURE named memory variables requiring specific authorization privileges to read or write to the variable.
    Type: Application
    Filed: September 1, 2004
    Publication date: May 5, 2005
    Applicant: International Business Machines Corporation
    Inventors: Paul Bird, Curt Cotner, Patrick Dantressangle
  • Patent number: 6446120
    Abstract: A method, apparatus, and article of manufacture for a computer implemented configurable stresser for testing a server computer. A server computer is tested by transmitting commands to the server computer from a client computer which is connected via a network. Each command is performed by the server computer to access data from a data source stored on a data storage device connected to the server computer. In particular, at the client computer, one or more virtual browsers are created for transmitting commands to the server computer. Compared test results are received from each virtual browser indicating a response to each transmitted command received from the server computer. The received test results are consolidated into a report of compared test results.
    Type: Grant
    Filed: November 26, 1997
    Date of Patent: September 3, 2002
    Assignee: International Business Machines Corporation
    Inventor: Patrick Dantressangle