Patents by Inventor Hovey Strong

Hovey Strong 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: 20060288032
    Abstract: According to a preferred embodiment of the present invention, a bridging system (100) and method provides a way of linking two independent data systems by receiving a dataset from a source data system. The bridging system (100) translates the dataset from a source schema to a target schema according to a set of mapping rules, and queues the translated data in persistent storage, and then sends the translated dataset to a destination data system. The system (100) includes an XML bridge (114), multiple application specific gateways (116,118), and a web admin interface (210), all in communication via a wide area network.
    Type: Application
    Filed: August 25, 2006
    Publication date: December 21, 2006
    Applicant: International Business Machines Corporation
    Inventors: Clifford Harris, Jeffrey Kreulen, Vikas Krishna, Kevin McCurley, Sami Rollins, Hovey Strong, Neelakantan Sundaresan
  • Publication number: 20060026505
    Abstract: Transforming a user-supplied DTD satisfying a first XML grammar into a PDTD satisfying a second XML grammar, including converting DTD declarations of alternate content to sequences, converting DTD declarations of optional content to mandatory content, converting DTD declarations of imbedded sequences to subsequences, and demoting attribute definitions of DTD elements having attributes to children of the DTD elements having attributes. Embodiments include converting recursions into repetitions, demoting imbedded compound repetitions from element declarations having imbedded compound repetitions, and demoting imbedded leaves from elements having imbedded leaves.
    Type: Application
    Filed: October 4, 2005
    Publication date: February 2, 2006
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Sharma, Hovey Strong
  • Publication number: 20050097128
    Abstract: Disclosed is a method of transferring data from a hierarchical file (having a hierarchical structure, e.g., a markup language file) to a relational database structure (made up of columns and rows. Before processing the actual data, the invention first partitions the hierarchical structure into sections, where each section is dedicated to at least one node of the hierarchical structure. The partitioning process is based on the document type definition file, which is separate from, and different than the hierarchical file. After completing the partitioning, the invention then parses the actual data contained in the hierarchical data file to produce a stream of data pairs and end of section indicators. During the data parsing process, the invention loads the data pairs into corresponding “sections” (created prior to the parsing process) as the data pairs are output from the parsing process.
    Type: Application
    Filed: October 31, 2003
    Publication date: May 5, 2005
    Inventors: Joseph Ryan, Hovey Strong, Chung-Hao Tan