Patents by Inventor Maryela E. Weihrauch
Maryela E. Weihrauch 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).
-
Patent number: 10223399Abstract: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.Type: GrantFiled: November 3, 2015Date of Patent: March 5, 2019Assignee: International Business Machines CorporationInventors: Ke Wei Wei, Maryela E. Weihrauch, Hao Wu, Xin Ying Yang, Miao Zheng
-
Patent number: 10216774Abstract: In managing multiple versions of triggers, a database system creates a first version of a trigger to apply a first set of actions in response to a first triggering event, which includes: creating a first package for the first version of the trigger to include the first set of actions; linking the first package to the database object; and setting the first package as a current version of the trigger. The database system creates a second version of the trigger to apply a second set of actions to the database object in response to a second triggering event, which includes: creating a second package for the second version of the trigger to include the second set of actions; and linking the second package to the database object. In response to a command, the database system sets the current version of the trigger to the second package.Type: GrantFiled: June 24, 2016Date of Patent: February 26, 2019Assignee: International Business Machines CorporationInventors: Tammie Dang, Illong A. Huang, David J. Kuang, Fen-Ling Lin, Claire W. McFeely, Maryela E. Weihrauch, Binghui Zhong
-
Publication number: 20190057141Abstract: 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: ApplicationFiled: October 23, 2018Publication date: February 21, 2019Inventors: Peter Bendel, Oliver Benke, Namik Hrle, Ruiping Li, Daniel Martin, Maryela E. Weihrauch
-
Publication number: 20190018880Abstract: 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: September 10, 2018Publication date: January 17, 2019Inventors: Peter Bendel, Oliver Benke, Oliver Draese, Namik Hrle, Ruiping Li, Roland Seiffert, Knut Stolze, Maryela E. Weihrauch
-
Publication number: 20180260291Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: ApplicationFiled: May 9, 2018Publication date: September 13, 2018Inventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch
-
Publication number: 20180189370Abstract: 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: ApplicationFiled: January 5, 2017Publication date: July 5, 2018Inventors: Peter Bendel, Oliver Benke, Namik Hrle, Ruiping Li, Daniel Martin, Maryela E. Weihrauch
-
Patent number: 9996432Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: GrantFiled: February 3, 2016Date of Patent: June 12, 2018Assignee: International Business Machines CorporationInventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch
-
Patent number: 9934116Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: GrantFiled: January 17, 2017Date of Patent: April 3, 2018Assignee: International Business Machines CorporationInventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch
-
Patent number: 9934115Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: GrantFiled: January 17, 2017Date of Patent: April 3, 2018Assignee: International Business Machines CorporationInventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch
-
Publication number: 20180089255Abstract: In an enforcement of temporal referential integrity in a database system, the database system receives a change request for one or more rows in a target table in the database system. The system determines that the target table has temporal referential constraints with a second table. The system compares a non-period child key value in child table row(s) with a non-period parent key value in parent table row(s) and compares a child business time period key value in the child table row(s) with a parent business time period key value in the parent table row(s). When the non-period child key value matches the non-period parent key value and when the child business time period key value is within the parent business time period key value, the system determines that the change request satisfies the temporal referential constraints. Otherwise, the system determines that the change request violates the temporal referential constraints.Type: ApplicationFiled: November 7, 2017Publication date: March 29, 2018Inventors: Yao-Ching S. CHEN, Xiaohong FU, Maryela E. WEIHRAUCH
-
Publication number: 20180052880Abstract: In an enforcement of temporal referential integrity in a database system, the database system receives a change request for one or more rows in a target table in the database system. The system determines that the target table has temporal referential constraints with a second table. The system compares a non-period child key value in child table row(s) with a non-period parent key value in parent table row(s) and compares a child business time period key value in the child table row(s) with a parent business time period key value in the parent table row(s). When the non-period child key value matches the non-period parent key value and when the child business time period key value is within the parent business time period key value, the system determines that the change request satisfies the temporal referential constraints. Otherwise, the system determines that the change request violates the temporal referential constraints.Type: ApplicationFiled: August 18, 2016Publication date: February 22, 2018Inventors: Yao-Ching S. CHEN, Xiaohong FU, Maryela E. WEIHRAUCH
-
Publication number: 20180046677Abstract: A database system searches for any statements that satisfy one or more of a set of filtering criteria. When a given dynamic query statement fully satisfies the set of filtering criteria, the given statement is stabilized by persistently storing a bound form of the given dynamic query statement. When the given dynamic query statement partly satisfies the set of filtering criteria, a monitoring request is created with the set of filtering criteria to begin monitoring subsequent executions of the statement, and the statement is linked to the monitoring request. When the given dynamic query statement subsequently fully satisfies the set of filtering criteria, the statement is stabilized by persistently storing the bound form of the statement. When the given dynamic query is re-executed, the stabilized statement is loaded, and the PREPARE process is bypassed.Type: ApplicationFiled: August 9, 2016Publication date: February 15, 2018Inventors: Patrick D. BOSSMAN, Frank D. BOWER, Tammie DANG, Peter KUANG, Euna PARK, Maryela E. WEIHRAUCH
-
Patent number: 9892145Abstract: A row is inserted in a database table on a page having a first space reserved for inserting rows of the database table. A second space is reserved for adding data to the inserted row, wherein reserving the second space includes reserving the second space on the page responsive to inserting the row, so that the amount of space reserved for adding data to inserted rows grows as more rows are inserted. The page is marked full for the second space independently of whether the first space is full for inserting new rows. Data is added to rows on the page, responsive to detecting that the second space is full, by adding the data to one or more new pages, even though rows may still be inserted on the page using any remaining room in the first space on the page.Type: GrantFiled: September 10, 2016Date of Patent: February 13, 2018Assignee: International Business Machines CorporationInventors: Charles R. Bonner, John J. Campbell, Frances H. Villafuerte, Maryela E. Weihrauch
-
Publication number: 20170371905Abstract: In managing multiple versions of triggers, a database system creates a first version of a trigger to apply a first set of actions in response to a first triggering event, which includes: creating a first package for the first version of the trigger to include the first set of actions; linking the first package to the database object; and setting the first package as a current version of the trigger. The database system creates a second version of the trigger to apply a second set of actions to the database object in response to a second triggering event, which includes: creating a second package for the second version of the trigger to include the second set of actions; and linking the second package to the database object. In response to a command, the database system sets the current version of the trigger to the second package.Type: ApplicationFiled: June 24, 2016Publication date: December 28, 2017Inventors: Tammie DANG, Illong A. HUANG, David J. KUANG, Fen-Ling LIN, Claire W. MCFEELY, Maryela E. WEIHRAUCH, Binghui ZHONG
-
Publication number: 20170371911Abstract: In supporting temporal logical transactions, a database management system (DBMS) determines that a temporal logical transaction time (T) is set for a temporal logical transaction. The DBMS receives a change request for a current row in a current table. A history row for a history table corresponding to the current table is created. The values in the history row are set to the values in the current row, where a begin time in the history row has same value as a begin time in the current row, and an end time in the history row is set to T. When the begin time equals the end time in the history row, the DBMS does not store the history row in the history table. The values in the current row are changed according to the change request, and the begin time in the current row is set to T.Type: ApplicationFiled: September 8, 2017Publication date: December 28, 2017Inventors: Yao-Ching S. CHEN, Xiaohong FU, Fung LEE, Claire W. MCFEELY, Maryela E. WEIHRAUCH
-
Publication number: 20170308563Abstract: In supporting temporal logical transactions, a database management system (DBMS) determines that a temporal logical transaction time (T) is set for a temporal logical transaction. The DBMS receives a change request for a current row in a current table. A history row for a history table corresponding to the current table is created. The values in the history row are set to the values in the current row, where a begin time in the history row has same value as a begin time in the current row, and an end time in the history row is set to T. When the begin time equals the end time in the history row, the DBMS does not store the history row in the history table. The values in the current row are changed according to the change request, and the begin time in the current row is set to T.Type: ApplicationFiled: April 21, 2016Publication date: October 26, 2017Inventors: Yao-Ching S. CHEN, Xiaohong FU, Fung LEE, Claire W. MCFEELY, Maryela E. WEIHRAUCH
-
Publication number: 20170249346Abstract: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.Type: ApplicationFiled: May 17, 2017Publication date: August 31, 2017Inventors: Ke Wei Wei, Maryela E. Weihrauch, Hao Wu, Xin Ying Yang, Miao Zheng
-
Publication number: 20170220435Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: ApplicationFiled: January 17, 2017Publication date: August 3, 2017Inventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch
-
Publication number: 20170220434Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: ApplicationFiled: January 17, 2017Publication date: August 3, 2017Inventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch
-
Publication number: 20170220432Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.Type: ApplicationFiled: February 3, 2016Publication date: August 3, 2017Inventors: Kollol K. Misra, Pallavi Priyadarshini, Parameswara R. Tatini, Maryela E. Weihrauch