Patents by Inventor Mark Gaponoff

Mark Gaponoff 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).

  • Efficient indexing of hierarchical relational database records
    Patent number: 7412444
    Abstract: According to various embodiments, systems, and methods, a sorting construct (TREE_SORT) is generated to efficiently traverse hierarchical data structures in relational databases. A TREE_SORT construct is generated by transforming a value that represents the sequential order of a given node relative to its siblings (Peer_Sequence) to a left-justified string of a given width. A TREE_SORT value for the parent of a given node is prepended to the left of the generated substring of the transformed Peer_Sequence value. As a result, a sorting construct of the parent node sorts before sorting constructs of child nodes.
    Type: Grant
    Filed: February 10, 2005
    Date of Patent: August 12, 2008
    Assignee: IDX Systems Corporation
    Inventor: Mark Gaponoff
  • Efficient indexing of hierarchical relational database records
    Publication number: 20050198017
    Abstract: According to various embodiments, systems, and methods, a sorting construct (TREE_SORT) is generated to efficiently traverse hierarchical data structures in relational databases. A TREE_SORT construct is generated by transforming a value that represents the sequential order of a given node relative to its siblings (Peer_Sequence) to a left-justified string of a given width. A TREE_SORT value for the parent of a given node is prepended to the left of the generated substring of the transformed Peer_Sequence value. As a result, a sorting construct of the parent node sorts before sorting constructs of child nodes.
    Type: Application
    Filed: February 10, 2005
    Publication date: September 8, 2005
    Inventor: Mark Gaponoff