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: 20180095829Abstract: 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: ApplicationFiled: November 22, 2017Publication date: April 5, 2018Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
-
Patent number: 9886347Abstract: 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: GrantFiled: January 8, 2015Date of Patent: February 6, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
-
Patent number: 9852141Abstract: 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: GrantFiled: August 5, 2016Date of Patent: December 26, 2017Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Patent number: 9710507Abstract: A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval.Type: GrantFiled: September 17, 2015Date of Patent: July 18, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Peter Bendel, Oliver Draese, Namik Hrle, Tianchao Li
-
Publication number: 20170139943Abstract: 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: ApplicationFiled: August 5, 2016Publication date: May 18, 2017Inventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Publication number: 20170139617Abstract: 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: ApplicationFiled: August 9, 2016Publication date: May 18, 2017Inventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Patent number: 9442694Abstract: 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: GrantFiled: November 18, 2015Date of Patent: September 13, 2016Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Publication number: 20160210328Abstract: 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: ApplicationFiled: January 20, 2016Publication date: July 21, 2016Inventors: Peter Bendel, Oliver Benke, Oliver Draese, Namik Hrle, Ruiping Li, Roland Seiffert, Knut Stolze, Maryela E. Weihrauch
-
Publication number: 20160203050Abstract: 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: ApplicationFiled: January 8, 2015Publication date: July 14, 2016Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
-
Publication number: 20160171070Abstract: 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: ApplicationFiled: September 17, 2015Publication date: June 16, 2016Inventors: Namik Hrle, Andreas Lohrer, Daniel Martin, Matthias Tschaffler
-
Publication number: 20160110439Abstract: 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: ApplicationFiled: September 18, 2015Publication date: April 21, 2016Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, James D. Spyker, Yongfeng Yao
-
Patent number: 9286300Abstract: At least a portion of data from a first processing system is archived onto a second processing system based on partitions of the data. A query received at the first processing system is processed at the second processing system to retrieve archived data satisfying the received query in response to determining at the first processing system that the received query encompasses archived data. Embodiments of the present invention further include methods, systems, and computer program products for archiving and accessing data in substantially the same manner described above.Type: GrantFiled: May 2, 2013Date of Patent: March 15, 2016Assignee: International Business Machines CorporationInventors: Oliver Draese, Namik Hrle, Claus Kempfert, Oliver Koeth, Ruiping Li, Robert S. Muse, Knut Stolze, Guogen Zhang
-
Publication number: 20160004740Abstract: A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval.Type: ApplicationFiled: September 17, 2015Publication date: January 7, 2016Inventors: Peter Bendel, Oliver Draese, Namik Hrle, Tianchao Li
-
Patent number: 9176995Abstract: A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval.Type: GrantFiled: November 15, 2010Date of Patent: November 3, 2015Assignee: International Business Machines CorporationInventors: Tianchao Li, Peter Bendel, Oliver Draese, Namik Hrle
-
Publication number: 20150278329Abstract: 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: ApplicationFiled: March 23, 2015Publication date: October 1, 2015Inventors: Namik Hrle, Daniel Martin, Jens P. Mueller, Knut Stolze
-
Publication number: 20150264155Abstract: A capability for updating a cache. The capability includes identifying, in a query instance that has led to a filling of the cache, a parameter whose values are monotonic—in particular monotonically increasing or decreasing—over time, wherein the query instance has a first execution time. When generating a new query instance, at a second, later execution time instead of the previous value of the parameter, a new value may be used that corresponds to the monotonic previous value at the second execution time. The new query instance is executed, wherein the cache is updated with the results of the new query instance.Type: ApplicationFiled: March 12, 2015Publication date: September 17, 2015Inventors: Namik Hrle, Georg K. Mayer, Joachim Rese
-
Publication number: 20150261870Abstract: An aggregate is generated. Upon receiving a second query comprising a filter criterion, a determination is made as to whether at least a threshold number of previous first queries comprises a similar filter criterion, and if so generating an aggregate using the similar filter criterion as an aggregation criterion, such that future queries comprising the similar filter criterion are satisfied by the aggregate.Type: ApplicationFiled: March 12, 2015Publication date: September 17, 2015Inventors: Namik Hrle, Georg K. Mayer, Joachim Rese
-
Patent number: 9110899Abstract: Methods for processing a query in a multi-tenancy environment utilizing an electronic computing device are presented, the methods including: causing the electronic computing device to receive the query to a database, where the query includes a number of objects; causing the electronic computing device to determine whether any of the number of objects correspond with the set of tenant database objects; if any of the number of objects correspond with the set of tenant database objects, causing the electronic computing device to process the number of objects from the tenant production table; and if any of the number of objects correspond with the set of instance database objects, causing the electronic computing device to process the number of objects from the instance production table.Type: GrantFiled: May 10, 2013Date of Patent: August 18, 2015Assignee: International Business Machines CorporationInventors: Curt L Cotner, Namik Hrle
-
Patent number: 9009138Abstract: A method and apparatus for transparent analytical query acceleration identifies within a database management system (DBMS) if a query is an analytical type. The query is processed with an analytical query processor if the query is the analytical type. In addition, the query is processed within the DBMS if the query is not the analytical type.Type: GrantFiled: June 17, 2011Date of Patent: April 14, 2015Assignee: International Business Machines CorporationInventors: Oliver Draese, Namik Hrle, James A. Ruddy
-
Patent number: 8954407Abstract: Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned.Type: GrantFiled: April 12, 2011Date of Patent: February 10, 2015Assignee: International Business Machines CorporationInventors: Namik Hrle, Johannes Schuetzner, Knut Stolze