Patents by Inventor Namik Hrle

Namik Hrle 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: 20190220467
    Abstract: A computer-implemented method for operating a database management system which includes a source database and a target database. A database management system is configured for asynchronously replicating data changes of the source database to the target database. The database management system receiving a request to perform a database statement. The method can identify the most recently committed one of a plurality of transactions having been committed in the source database before the receiving of the request. Identifying repeatedly the one of the plurality of transactions having been replicated most recently to the target database. Execution of the requested statement in the target database is delayed until an evaluation of the repeatedly identified most recently replicated transaction returns that the identified most recently committed transaction has been replicated to the target database. After the delaying execution, the method executes the requested statement in the target database.
    Type: Application
    Filed: March 26, 2019
    Publication date: July 18, 2019
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, James D. Spyker, Yongfeng Yao
  • Publication number: 20190220468
    Abstract: A computer-implemented method for operating a database management system which includes a source database and a target database. A database management system is configured for asynchronously replicating data changes of the source database to the target database. The database management system receiving a request to perform a database statement. The method can identify the most recently committed one of a plurality of transactions having been committed in the source database before the receiving of the request. Identifying repeatedly the one of the plurality of transactions having been replicated most recently to the target database. Execution of the requested statement in the target database is delayed until an evaluation of the repeatedly identified most recently replicated transaction returns that the identified most recently committed transaction has been replicated to the target database. After the delaying execution, the method executes the requested statement in the target database.
    Type: Application
    Filed: March 26, 2019
    Publication date: July 18, 2019
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, James D. Spyker, Yongfeng Yao
  • Publication number: 20190156051
    Abstract: Aspects of the invention include processing queries in a database system having a first database engine and a second database engine. A first instance of a first table is stored in the first database engine in plaintext. At one predefined column of the first table is encrypted, resulting in a set of encrypted columns, using a cascade encryption scheme that includes a set of ordered encryption methods. A subset of the set of columns is stored in a second instance of the first table in the second database engine. An encryption method of the cascade encryption scheme that allows a query operation of a received query on data encrypted with the identified encryption method is identified. The identified encryption method is used to rewrite the query, and the rewritten query is executed using the second instance of the first table.
    Type: Application
    Filed: November 21, 2017
    Publication date: May 23, 2019
    Inventors: Felix Beier, Peter Bendel, Nicole Finnie, Namik Hrle
  • Patent number: 10282363
    Abstract: A computer-implemented method for operating a database management system which includes a source database and a target database. A database management system is configured for asynchronously replicating data changes of the source database to the target database. The database management system receiving a request to perform a database statement. The method can identify the most recently committed one of a plurality of transactions having been committed in the source database before the receiving of the request. Identifying repeatedly the one of the plurality of transactions having been replicated most recently to the target database. Execution of the requested statement in the target database is delayed until an evaluation of the repeatedly identified most recently replicated transaction returns that the identified most recently committed transaction has been replicated to the target database. After the delaying execution, the method executes the requested statement in the target database.
    Type: Grant
    Filed: September 18, 2015
    Date of Patent: May 7, 2019
    Assignee: International Business Machines Corporation
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, James D. Spyker, Yongfeng Yao
  • Patent number: 10275507
    Abstract: Embodiments are provided for replicating a relational source database associated with a transaction log of the relational source database. In operation, embodiments may perform receiving a request for replicating data of the relational source database to a relational target database and identifying a first start position within the transaction log. Upon having identified the first start position, embodiments may further perform waiting at least a time period for ensuring that each transaction currently executing on the relational source database at a moment of receiving said request has terminated at an end of said time period. After having waited said time period, embodiments may perform an asynchronously creating of a copy of data of the relational source database to produce a created copy. In turn, embodiments may perform writing the created copy to the relational target database and identifying a repair start position within the transaction log.
    Type: Grant
    Filed: March 23, 2015
    Date of Patent: April 30, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Namik Hrle, Daniel Martin, Jens P. Mueller, Knut Stolze
  • Publication number: 20190121887
    Abstract: The present disclosure relates to a method for processing data in a database engine. The method includes storing a first instance of a first table in the database engine in plaintext. Encryption information about encryption methods and encryption keys of at least one predefined column of the first table may be maintained. In response to data changes in the column, first log entries for the data changes may be written in plaintext. The data changes may be encrypted by an encryption component using the encryption information. This results in encrypted data changes. Second log entries for the encrypted data changes may be written and applied to a second instance of the first table. The second instance of the first table is stored at a further database engine.
    Type: Application
    Filed: October 25, 2017
    Publication date: April 25, 2019
    Inventors: Felix Beier, Nicole Finnie, Namik Hrle, Einar Lueck
  • Publication number: 20190121892
    Abstract: The present disclosure relates to a method for processing queries in a database system having a first database engine and a second database engine. The method includes: storing a first instance of a first table in the first database engine in plaintext; encrypting at least one predefined column of the first table, resulting in a second instance of the first table containing at least part of the data of the first table in encrypted format. The second instance of the first table in the second database engine is stored in the second database engine. It may be determined whether to execute a received query in the first database engine on the first table or in the second database engine on the second instance of the first table, where the determination involves a comparison of the query with encryption information.
    Type: Application
    Filed: October 25, 2017
    Publication date: April 25, 2019
    Inventors: Felix Beier, Nicole Finnie, Namik Hrle, Jens Mueller
  • Patent number: 10261862
    Abstract: According to an aspect, a database management system (DBMS) is operated to perform data replication. The DBMS includes a source database and a target database. The source database includes a plurality of first tables respectively comprising one or more first columns, and the target database includes a plurality of second tables respectively comprising one or more second columns. Each of multiple ones of the first columns is mapped to one of the second columns, and each one of the second columns is adapted to store replicated data changes of the first column mapped to the second column. Each of the second columns has an assigned update time, the update time being a moment in time when the second column most recently received incremental data changes from its mapped first column. The DBMS operates to process requested database statements while providing data replication.
    Type: Grant
    Filed: November 22, 2017
    Date of Patent: April 16, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
  • Patent number: 10242057
    Abstract: A distributed database system (or federated database system) where a catalog is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalog.
    Type: Grant
    Filed: January 20, 2016
    Date of Patent: March 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Peter Bendel, Oliver Benke, Oliver Draese, Namik Hrle, Ruiping Li, Roland Seiffert, Knut Stolze, Maryela E. Weihrauch
  • Publication number: 20190057141
    Abstract: A method, system and computer program product for providing consolidated access to data of a plurality of source databases. Tables of each of the source databases are replicated to a shared accelerator. The source DBMSs are configured to dispatch queries to the accelerator for accelerating query execution. The accelerator is configured such that the replicated tables can only be accessed by the source DBMS having provided said tables for executing a dispatched query. A user can select one of the source DBMSs to act as a consolidated DBMS—C-DBMS. The C-DBMS provides the consolidated access. The user is enabled to select tables managed by another one of the DBMSs. In response to receiving the selection of the tables, the accelerator is re-configuring such that the C-DBMS is granted access also to the copies of the selected tables in the accelerator.
    Type: Application
    Filed: October 23, 2018
    Publication date: February 21, 2019
    Inventors: Peter Bendel, Oliver Benke, Namik Hrle, Ruiping Li, Daniel Martin, Maryela E. Weihrauch
  • Publication number: 20190018880
    Abstract: A distributed database system (or federated database system) where a catalogue is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalogue.
    Type: Application
    Filed: September 10, 2018
    Publication date: January 17, 2019
    Inventors: Peter Bendel, Oliver Benke, Oliver Draese, Namik Hrle, Ruiping Li, Roland Seiffert, Knut Stolze, Maryela E. Weihrauch
  • Publication number: 20180293250
    Abstract: Sorting and storing a dataset, the dataset comprising at least one attribute. The method includes defining a set of data blocks and assigning to each data block a predefined maximum number of entries or a predefined maximum amount of storage, dividing the dataset into a sequence of multiple sub-datasets each having one value or a range of values of the attribute, wherein each pair of successive sub-datasets of the sequence are non-overlapping or overlapping at their respective extremum value of the attribute, for each sub-dataset of the multiple sub-datasets: in case the sub-dataset fully or partially fits into a data block of the defined data blocks storing the sub-dataset into at least the data block, the sub-dataset that partially fits into the data block comprising a number of entries that is smaller than a predefined maximum threshold.
    Type: Application
    Filed: June 12, 2018
    Publication date: October 11, 2018
    Inventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
  • Publication number: 20180293251
    Abstract: Sorting and storing a dataset, the dataset comprising at least one attribute. The method includes defining a set of data blocks and assigning to each data block a predefined maximum number of entries or a predefined maximum amount of storage, dividing the dataset into a sequence of multiple sub-datasets each having one value or a range of values of the attribute, wherein each pair of successive sub-datasets of the sequence are non-overlapping or overlapping at their respective extremum value of the attribute, for each sub-dataset of the multiple sub-datasets: in case the sub-dataset fully or partially fits into a data block of the defined data blocks storing the sub-dataset into at least the data block, the sub-dataset that partially fits into the data block comprising a number of entries that is smaller than a predefined maximum threshold.
    Type: Application
    Filed: June 12, 2018
    Publication date: October 11, 2018
    Inventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
  • Publication number: 20180225351
    Abstract: A computer receives a database request to be executed on a source database or a target database. The source database is configured to efficiently process database queries of a first query type, the target database is configured to efficiently process database queries of a second query type, data changes in the source database are asynchronously replicated to the target database, and all changed data in the source database impacting a result of the database request are replicated to the target database before executing the database request. The computer determines a latency time to asynchronously complete a replication of unreplicated data changes and determines a velocity of replication. The computer predicts, using the latency time and velocity of replication, which of the databases will complete an execution of the database request first and dispatches the database request to the database predicted to complete the execution of the database request first.
    Type: Application
    Filed: April 4, 2018
    Publication date: August 9, 2018
    Inventors: Namik Hrle, Andreas Lohrer, Daniel Martin, Matthias Tschaffler
  • Publication number: 20180225350
    Abstract: Dispatching a database request. A database request is received. Latency times are determined for databases managed by the DBMS, the latency times being estimates of the times to complete replications from the other databases of all unreplicated data changes in the other databases. For each database, a capture velocity and an apply are determined, which are a number of data changes applied to the database that can be identified or applied in a predefined time interval. For each database, an estimated time to complete the database request is determined. The database request is dispatched to the database having an estimated minimum time of execution of the database request, wherein the time of execution is function of the estimated time for the database to complete the database request, the latency time of the database, and the capture and apply velocities of the database.
    Type: Application
    Filed: April 4, 2018
    Publication date: August 9, 2018
    Inventors: Namik Hrle, Andreas Lohrer, Daniel Martin, Matthias Tschaffler
  • Patent number: 10025844
    Abstract: A computer receives a database request to be executed on a source database or a target database. The source database is configured to efficiently process database queries of a first query type, the target database is configured to efficiently process database queries of a second query type, data changes in the source database are asynchronously replicated to the target database, and all changed data in the source database impacting a result of the database request are replicated to the target database before executing the database request. The computer determines a latency time to asynchronously complete a replication of unreplicated data changes and determines a velocity of replication. The computer predicts, using the latency time and velocity of replication, which of the databases will complete an execution of the database request first and dispatches the database request to the database predicted to complete the execution of the database request first.
    Type: Grant
    Filed: September 17, 2015
    Date of Patent: July 17, 2018
    Assignee: International Business Machines Corporation
    Inventors: Namik Hrle, Andreas Lohrer, Daniel Martin, Matthias Tschaffler
  • Patent number: 10025511
    Abstract: Sorting and storing a dataset, the dataset comprising at least one attribute. The method includes defining a set of data blocks and assigning to each data block a predefined maximum number of entries or a predefined maximum amount of storage, dividing the dataset into a sequence of multiple sub-datasets each having one value or a range of values of the attribute, wherein each pair of successive sub-datasets of the sequence are non-overlapping or overlapping at their respective extremum value of the attribute, for each sub-dataset of the multiple sub-datasets: in case the sub-dataset fully or partially fits into a data block of the defined data blocks storing the sub-dataset into at least the data block, the sub-dataset that partially fits into the data block comprising a number of entries that is smaller than a predefined maximum threshold.
    Type: Grant
    Filed: August 9, 2016
    Date of Patent: July 17, 2018
    Assignee: International Business Machines Corporation
    Inventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
  • Publication number: 20180189370
    Abstract: A method, system and computer program product for providing consolidated access to data of a plurality of source databases. Tables of each of the source databases are replicated to a shared accelerator. The source DBMSs are configured to dispatch queries to the accelerator for accelerating query execution. The accelerator is configured such that the replicated tables can only be accessed by the source DBMS having provided said tables for executing a dispatched query. A user can select one of the source DBMSs to act as a consolidated DBMS—C-DBMS. The C-DBMS provides the consolidated access. The user is enabled to select tables managed by another one of the DBMSs. In response to receiving the selection of the tables, the accelerator is re-configuring such that the C-DBMS is granted access also to the copies of the selected tables in the accelerator.
    Type: Application
    Filed: January 5, 2017
    Publication date: July 5, 2018
    Inventors: Peter Bendel, Oliver Benke, Namik Hrle, Ruiping Li, Daniel Martin, Maryela E. Weihrauch
  • Publication number: 20180121495
    Abstract: A method, a computer program product and a computer system are provided. Attribute value information contains at least a minimum value representing a smallest value of a first attribute and a maximum value representing a largest value of the first attribute, thereby defining a first range of values of the first attribute. A received query against a data table requests one or more values of at least the first attribute that are covered by the first range of values. The attribute value information may be used for selecting a data block of the data table as a candidate potentially including at least part of the requested one or more values and scanning the data block. In response to determining that the data block does not include the one or more requested values, the attribute value information may be updated accordingly.
    Type: Application
    Filed: January 2, 2018
    Publication date: May 3, 2018
    Inventors: Felix O. Beier, Andreas Brodt, Namik Hrle, Oliver Schiller
  • Publication number: 20180113900
    Abstract: A method, a computer program product and a computer system are provided. Attribute value information contains at least a minimum value representing a smallest value of a first attribute and a maximum value representing a largest value of the first attribute, thereby defining a first range of values of the first attribute. A received query against a data table requests one or more values of at least the first attribute that are covered by the first range of values. The attribute value information may be used for selecting a data block of the data table as a candidate potentially including at least part of the requested one or more values and scanning the data block. In response to determining that the data block does not include the one or more requested values, the attribute value information may be updated accordingly.
    Type: Application
    Filed: October 26, 2016
    Publication date: April 26, 2018
    Inventors: Felix O. Beier, Andreas Brodt, Namik Hrle, Oliver Schiller