Patents by Inventor Neal Sample

Neal Sample 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).

  • Encoding semi-structured data for efficient search and browsing
    Publication number: 20050033733
    Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way that facilitates efficient search and browsing.
    Type: Application
    Filed: September 1, 2004
    Publication date: February 10, 2005
    Applicant: Ori Software Development Ltd.
    Inventors: Moshe Shadmon, Neal Sample, Brian Cooper, Michael Franklin
  • Method and apparatus for ternary patricia trie blocks
    Publication number: 20050027679
    Abstract: An architecture and method for efficient termination of variable length keys in a PATRICIA trie is disclosed. By adding a null-labeled link, it is possible to terminate such variable length PATRICIA trie nodes, allowing to overcome the need for complex termination solutions. Specifically, a ternary PATRICIA block is introduced.
    Type: Application
    Filed: July 26, 2004
    Publication date: February 3, 2005
    Inventor: Neal Sample
  • Encoding semi-structured data for efficient search and browsing
    Patent number: 6804677
    Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way facilitates efficient search and browsing.
    Type: Grant
    Filed: February 26, 2001
    Date of Patent: October 12, 2004
    Assignee: Ori Software Development Ltd.
    Inventors: Moshe Shadmon, Neal Sample, Brian Cooper, Michael J. Franklin
  • Efficient traversals over hierarchical data and indexing semistructured data
    Publication number: 20030204515
    Abstract: A method for encoding hierarchical data stored in an index, partitioned into blocks, over keys representing the data. For every key K representing a record R in the index, the key of the children records of record R are prefixed with K. The method includes traversing to a first R record represented in the index, traversing from the record R to the next sequential R such that the path in the index from the position representing R to the position representing the next sequential R does not include information relating to the children of R. Next, repeating the latter operation for 0 or more R records, and for any 0 or more particular R records, traversing from the particular R to its children. The index constitutes a balanced structure of blocks.
    Type: Application
    Filed: March 5, 2003
    Publication date: October 30, 2003
    Applicant: ORI SOFTWARE DEVELOPMENT LTD.
    Inventors: Moshe Shadmon, Neal Sample
  • Encoding semi-structured data for efficient search and browse
    Publication number: 20020120598
    Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way facilitates efficient search and browsing.
    Type: Application
    Filed: February 26, 2001
    Publication date: August 29, 2002
    Applicant: ORI SOFTWARE DEVELOPMENT LTD.
    Inventors: Moshe Shadmon, Neal Sample, Brian Cooper, Michael J. Franklin