Patents by Inventor Paolo Papotti
Paolo Papotti 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: 10649975Abstract: Computer implemented methods for identifying denial constraints are provided herein. The denial constraints can be used with a database schema R. A predicate space P can be generated for an instance I in the schema R. An evidence set EviI can be generated. The evidence set EviI can include sets of satisfied predicates in the predicate space P for each instance I. A minimal set of predicates can be identified for the evidence set EviI. Valid denial constraints can be identified from the minimal set by inverting the predicates in the minimal set.Type: GrantFiled: May 31, 2013Date of Patent: May 12, 2020Assignee: Qatar FoundationInventors: Ihab Francis Ilyas Kaldas, Paolo Papotti, Xu Chu
-
Patent number: 10528532Abstract: A computer implemented method for integrating data into a target database may include: providing a plurality of source databases which each may include a relational schema and data for integration into the target database; generating at least one complexity model based on the relational schema and data of each source database, each complexity model indicating at least one inconsistency between two or more of the data sources which may be require to be resolved to integrate the data from the data sources into the target database; and generating an effort model that may include an effort value for each inconsistency indicated by each complexity model, each effort value indicating at least one of a time period and a financial cost to resolve the inconsistency to integrate data from the data sources into the target database.Type: GrantFiled: June 30, 2014Date of Patent: January 7, 2020Assignees: Qatar Foundation, Hasso-Plattner-Institut Für Softwaresystemtechnik GmbHInventors: Paolo Papotti, Felix Naumann, Sebastian Kruse, El Kindi Rezig
-
Patent number: 10223250Abstract: A system for checking data for errors, the system comprising a checking module operable to check tuples of data stored in a target database for errors, the tuples in the target database originating from the output of at least one query transformation module which applies a query transformation to tuples of data from at least one data source an identification module operable to identify a problematic tuple from a data source that produces an error in the target database, the identification module being operable to quantify the contribution of the problematic tuple in producing the error in the target database, and a description generation module operable to generate a descriptive query which represents at least one of errors identified by the checking module in the target database which are produced by the at least one query transformation module, and problematic tuples identified in a data source by the identification module.Type: GrantFiled: May 27, 2014Date of Patent: March 5, 2019Assignee: QATAR FOUNDATIONInventors: Mourad Ouzzani, Paolo Papotti, Ihab Francis Ilyas Kaldas, Anup Chalmalla
-
Patent number: 10162857Abstract: The optimized inequality join method is a method for joining relational tables on input inequality conditions. The optimized inequality join method is a relatively fast inequality join method using permutation arrays to store positional information for sorted attributed values. Additionally, space efficient bit arrays are used to enable optimization, such as Bloom filter indices, thus providing faster computation of the join results. The method may be used, for example, for joining various inequalities associated with a variety of measured environmental conditions for raising an alarm when certain conditions are met.Type: GrantFiled: August 15, 2016Date of Patent: December 25, 2018Assignee: Qatar Foundation For Education, Science and CommunityInventors: Zuhair Khayyat, William Lucia, Mourad Ouzzani, Paolo Papotti, Jorge-Arnulfo Quiane-Ruiz, Nan Tang
-
Publication number: 20170060944Abstract: The optimized inequality join method is a method for joining relational tables on input inequality conditions. The optimized inequality join method is a relatively fast inequality join method using permutation arrays to store positional information for sorted attributed values. Additionally, space efficient bit arrays are used to enable optimization, such as Bloom filter indices, thus providing faster computation of the join results. The method may be used, for example, for joining various inequalities associated with a variety of measured environmental conditions for raising an alarm when certain conditions are met.Type: ApplicationFiled: August 15, 2016Publication date: March 2, 2017Inventors: ZUHAIR KHAYYAT, WILLIAM LUCIA, MOURAD OUZZANI, PAOLO PAPOTTI, JORGE-ARNULFO QUIANE-RUIZ, NAN TANG
-
Publication number: 20160364325Abstract: A system for checking data for errors, the system comprising a checking module operable to check tuples of data stored in a target database for errors, the tuples in the target database originating from the output of at least one query transformation module which applies a query transformation to tuples of data from at least one data source an identification module operable to identify a problematic tuple from a data source that produces an error in the target database, the identification module being operable to quantify the contribution of the problematic tuple in producing the error in the target database, and a description generation module operable to generate a descriptive query which represents at least one of errors identified by the checking module in the target database which are produced by the at least one query transformation module, and problematic tuples identified in a data source by the identification module.Type: ApplicationFiled: May 27, 2014Publication date: December 15, 2016Inventors: Mourad Ouzzani, Paolo Papotti, Ihab Francis Ilyas Kaldas, Anup Chalmalla
-
Publication number: 20160154830Abstract: A computer implemented method for integrating data into a target database may include: providing a plurality of source databases which each may include a relational schema and data for integration into the target database; generating at least one complexity model based on the relational schema and data of each source database, each complexity model indicating at least one inconsistency between two or more of the data sources which may be require to be resolved to integrate the data from the data sources into the target database; and generating an effort model that may include an effort value for each inconsistency indicated by each complexity model, each effort value indicating at least one of a time period and a financial cost to resolve the inconsistency to integrate data from the data sources into the target database.Type: ApplicationFiled: June 30, 2014Publication date: June 2, 2016Inventors: Paolo Papotti, Felix Naumann, Sebastian Kruse, EI Kindi Rezig
-
Publication number: 20160103867Abstract: Computer implemented methods for identifying denial constraints are provided herein. The denial constraints can be used with a database schema R. A predicate space P can be generated for an instance I in the schema R. An evidence set EviI can be generated. The evidence set EviI can include sets of satisfied predicates in the predicate space P for each instance I. A minimal set of predicates can be identified for the evidence set EviI. Valid denial constraints can be identified from the minimal set by inverting the predicates in the minimal set.Type: ApplicationFiled: May 31, 2013Publication date: April 14, 2016Inventors: Ihad Francis ILYASHALDAS, Paolo PAPOTTI, Xu CHU
-
Publication number: 20080243765Abstract: A method for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification.Type: ApplicationFiled: March 29, 2007Publication date: October 2, 2008Inventors: Ariel Fuxman, Mauricio Antonio Hernandez-Sherrington, Ching-Tien Ho, Renee J. Miller, Paolo Papotti, Lucian Popa
-
Publication number: 20080243772Abstract: A method and system for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. A transformation query is generated from the nested mapping specification by generating a first query for transforming source data into flat views of the target and a second query for nesting flat view data according to the target format. Generating the first query includes applying default Skolemization to the specification.Type: ApplicationFiled: May 28, 2008Publication date: October 2, 2008Inventors: Ariel Fuxman, Mauricio Antonio Hernandez-Sherrington, Ching-Tien Ho, Renee J. Miller, Paolo Papotti, Lucian Popa