Patents by Inventor Lars E. Martinsson

Lars E. Martinsson 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).

  • Hierarchy nodes derived based on parent/child foreign key and/or range values on parent node
    Patent number: 9400814
    Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.
    Type: Grant
    Filed: July 27, 2010
    Date of Patent: July 26, 2016
    Assignee: Oracle International Corporation
    Inventors: Lars E. Martinsson, Mikhail Dumay
  • Hierarchy Nodes Derived Based On Parent/Child Foreign Key And/Or Range Values On Parent Node
    Publication number: 20110022639
    Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.
    Type: Application
    Filed: July 27, 2010
    Publication date: January 27, 2011
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Lars E. Martinsson, Mikhail Dumay
  • Hierarchy nodes derived based on parent/child foreign key and/or range values on parent node
    Patent number: 7788305
    Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.
    Type: Grant
    Filed: November 13, 2007
    Date of Patent: August 31, 2010
    Assignee: Oracle International Corporation
    Inventors: Lars E. Martinsson, Mikhail Dumay
  • Hierarchy Nodes Derived Based on Parent/Child Foreign Key and/or Range Values on Parent Node
    Publication number: 20090125530
    Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.
    Type: Application
    Filed: November 13, 2007
    Publication date: May 14, 2009
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Lars E. Martinsson, Mikhail Dumay