Patents by Inventor Berthold Reinwald

Berthold Reinwald 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: 20090192980
    Abstract: The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. The present invention provides synopses for DV estimation in the setting of a partitioned dataset, as well as corresponding DV estimators that exploit these synopses. Whenever an output compound data partition is created via a multiset operation on a pair of (possibly compound) input partitions, the synopsis for the output partition can be obtained by combining the synopses of the input partitions. If the input partitions are compound partitions, it is not necessary to access the synopses for all the base partitions that were used to construct the input partitions. Superior (in certain cases near-optimal) accuracy in DV estimates is maintained, especially when the synopsis size is small. The synopses can be created in parallel, and can also handle deletions of individual partition elements.
    Type: Application
    Filed: January 30, 2008
    Publication date: July 30, 2009
    Applicant: International Business Machines Corporation
    Inventors: Kevin Scott Beyer, Rainer Gemulla, Peter Jay Haas, Berthold Reinwald, John Sismanis
  • Publication number: 20090125805
    Abstract: The embodiments of the invention provide methods for obtaining improved text similarity measures. More specifically, a method of measuring similarity between at least two electronic documents begins by identifying similar terms between the electronic documents. This includes basing similarity between the similar terms on patterns, wherein the patterns can include word patterns, letter patterns, numeric patterns, and/or alphanumeric patterns. The identifying of the similar terms also includes identifying multiple pattern types between the electronic documents. Moreover, the basing of the similarity on patterns identifies terms within the electronic documents that are within a category of a hierarchy. Specifically, the identifying of the terms reviews a hierarchical data tree, wherein nodes of the tree represent terms within the electronic documents. Lower nodes of the tree have specific terms; and, wherein higher nodes of the tree have general terms.
    Type: Application
    Filed: November 9, 2007
    Publication date: May 14, 2009
    Inventors: Rema Ananthanarayanan, Sreeram V. Balakrishnan, Yuen Y. Lo, Berthold Reinwald
  • Publication number: 20090006331
    Abstract: A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.
    Type: Application
    Filed: June 29, 2007
    Publication date: January 1, 2009
    Inventors: Ariel Fuxman, Peter Jay Haas, Berthold Reinwald, Yannis Sismanis, Ling Wang
  • Publication number: 20090006349
    Abstract: A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.
    Type: Application
    Filed: June 5, 2008
    Publication date: January 1, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ariel Fuxman, Peter Jay Haas, Berthold Reinwald, Yannis Sismanis, Ling Wang
  • Publication number: 20080215580
    Abstract: A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
    Type: Application
    Filed: May 19, 2008
    Publication date: September 4, 2008
    Applicant: International Business Machines Corporation
    Inventors: MEHMET ALTINEL, Christof Bomhoevd, Chandasekaran Mohan, Mir Hamid Pirahesh, Berthold Reinwald, Saileshwar Krishnamurthy
  • Patent number: 7395258
    Abstract: A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
    Type: Grant
    Filed: July 30, 2004
    Date of Patent: July 1, 2008
    Assignee: International Business Machines Corporation
    Inventors: Mehmet Altinel, Christof Bornhoevd, Chandrasekaran Mohan, Mir Hamid Pirahesh, Berthold Reinwald, Saileshwar Krishnamurthy
  • Publication number: 20060026154
    Abstract: A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
    Type: Application
    Filed: July 30, 2004
    Publication date: February 2, 2006
    Inventors: Mehmet Altinel, Christof Bornhoevd, Chandrasekaran Mohan, Mir Pirahesh, Berthold Reinwald, Saileshwar Krishnamurthy
  • Publication number: 20040199636
    Abstract: The present invention provides a method, system and program product for automatically generating an invoking mechanism from a web service description, thereby enabling integration of a service external to a database into a database such that the service may be easily invoked from the database. Preferably, the service is a web service available over the internet The service may be invoked from any of a number of invoking mechanisms of the database. In a first specific embodiment, the mechanism comprises a user-defined function within an SQL statement. In a second specific embodiment, the mechanism comprises a virtual table. In a third specific embodiment, the mechanism comprises a stored procedure. In a fourth specific embodiment, the mechanism comprises a trigger. In a fifth specific embodiment, the mechanism comprises a federated table accessed via a nickname and implemented using a wrapper.
    Type: Application
    Filed: September 28, 2001
    Publication date: October 7, 2004
    Applicant: International Business Machines Corporation
    Inventors: Larry Brown, James C. Kleewein, Rong Qu, Berthold Reinwald, Peter M. Schwarz, Charles Daniel Wolfson
  • Patent number: 6725212
    Abstract: A method and system for graphically representing a plan for a query in a relational database management system is disclosed. The method includes receiving and processing an input query to form a plurality of plans, selecting at least one plan of the plurality of plans, and transforming the selected plan into a self-describing formatted file which is platform independent. The method further includes generating a graph representing the selected plan from the self-describing formatted file.
    Type: Grant
    Filed: August 31, 2001
    Date of Patent: April 20, 2004
    Assignee: International Business Machines Corporation
    Inventors: Tanya Couch, Stefan Bengt Edlund, George Lapis, Guy Maring Lohman, Berthold Reinwald
  • Publication number: 20030093410
    Abstract: A method and system for graphically representing a plan for a query in a relational database management system is disclosed. The method includes receiving and processing an input query to form a plurality of plans, selecting at least one plan of the plurality of plans, and transforming the selected plan into a self-describing formatted file which is platform independent. The method further includes generating a graph representing the selected plan from the self-describing formatted file.
    Type: Application
    Filed: August 31, 2001
    Publication date: May 15, 2003
    Inventors: Tanya Couch, Stefan Bengt Edlund, George Lapis, Guy Maring Lohman, Berthold Reinwald
  • Publication number: 20030093436
    Abstract: The present invention provides a method, system and program product for integrating a service external to a database into a database such that the service may be easily invoked from the database. Preferably, the service is a web service available over the internet The service may be invoked from any of a number of invoking mechanisms of the database. In a first specific embodiment, the mechanism comprises a user-defined function within an SQL statement. In a second specific embodiment, the mechanism comprises a virtual table. In a third specific embodiment, the mechanism comprises a stored procedure. In a fourth specific embodiment, the mechanism comprises a trigger. In a fifth specific embodiment, the mechanism comprises a federated table accessed via a nickname and implemented using a wrapper.
    Type: Application
    Filed: September 28, 2001
    Publication date: May 15, 2003
    Applicant: International Business Machines Corporation
    Inventors: Larry Brown, James C. Kleewein, Berthold Reinwald, Peter M. Schwarz, Charles Daniel Wolfson