Patents Assigned to Knowledge Computing Corporation
-
Patent number: 8037050Abstract: The application discloses a new system for performing queries and entity resolution on two or more data sources without having to ETL all the documents, entities, and descriptions of entities. Also disclosed, is a method to perform advanced entity resolution without divulging personally sensitive information to end-users and intermediate systems.Type: GrantFiled: January 29, 2009Date of Patent: October 11, 2011Assignee: Knowledge Computing CorporationInventors: William Oliver, Robert Griffin
-
Publication number: 20110231358Abstract: Date-warehouse systems are populated using an enhanced Extraction-Load-Transform (ETL) process and system by employing three ideas: Out-of-order-fill ETL, relative-ordering index (ROI), and dependent queries. Out-of-order-fill ETL allows a data warehouse to accept the loading of data files in any order, and does not require the loading of any previous backup data files in order to provide some functionality to end users under the view that some functionality or data access is better than none at all. Dependent queries are processes that use defined data structures for use in constructing, extracting, and validating each record to be written in said data-warehouse system in order to ensure that referential integrity is maintained and that no orphaned data is pushed into the data warehouse. Finally, ROI is a process wherein a value is determined, based on the constraints of the source data, which indicates the relative newness of the data.Type: ApplicationFiled: May 27, 2011Publication date: September 22, 2011Applicant: KNOWLEDGE COMPUTING CORPORATIONInventors: Adrian Boyko, William Oliver, Wojciech Wyzga
-
Patent number: 7984019Abstract: Date-warehouse systems are populated using an enhanced Extraction-Load-Transform (ETL) process and system by employing three ideas: Out-of-order-fill ETL, relative-ordering index (ROI), and dependent queries. Out-of-order-fill ETL allows a data warehouse to accept the loading of data files in any order, and does not require the loading of any previous backup data files in order to provide some functionality to end users under the view that some functionality or data access is better than none at all. Dependent queries are processes that use defined data structures for use in constructing, extracting, and validating each record to be written in said data-warehouse system in order to ensure that referential integrity is maintained and that no orphaned data is pushed into the data warehouse. Finally, ROI is a process wherein a value is determined, based on the constraints of the source data, which indicates the relative newness of the data.Type: GrantFiled: July 11, 2008Date of Patent: July 19, 2011Assignee: Knowledge Computing CorporationInventors: Adrian Boyko, Zach Heidepriem, William Oliver, Wojciech Wyzga
-
Patent number: 7840546Abstract: Query inefficiencies are improved and entity-interrelational blindness is overcome by employing two ideas: Consolidation Strings and Inter-Node Consolidation. These ideas can be typically employed in law-enforcement records systems (such as COPLINK systems), but is certainly not limited to such an application. Consolidation Strings represent key pieces of information that are in a text/character format, and may be encrypted/hashed. A system's hierarchy of consolidation rules automatically determine if two different rows in a database actually refer to the same real-world object. These rules are NOT statistical or probabilistic in nature, thus enhancing the confidence and reliability in the results. Three general classifications of Consolidation Strings are encompassed: Those based on positive identifiers, those based on demographic information, and those based on associative information that spans multiple-entity types.Type: GrantFiled: June 13, 2008Date of Patent: November 23, 2010Assignee: Knowledge Computing CorporationInventors: William Oliver, Robert Griffin, Wojciech Wyzga
-
Publication number: 20100030750Abstract: The application discloses a new system for performing queries and entity resolution on two or more data sources without having to ETL all the documents, entities, and descriptions of entities. Also disclosed, is a method to perform advanced entity resolution without divulging personally sensitive information to end-users and intermediate systems.Type: ApplicationFiled: January 29, 2009Publication date: February 4, 2010Applicant: KNOWLEDGE COMPUTING CORPORATIONInventor: William Oliver
-
Publication number: 20090177647Abstract: Query inefficiencies are improved and entity-interrelational blindness is overcome by employing two ideas: Consolidation Strings and Inter-Node Consolidation. These ideas can be typically employed in law-enforcement records systems (such as COPLINK systems), but is certainly not limited to such an application. Consolidation Strings represent key pieces of information that are in a text/character format, and may be encrypted/hashed. A system's hierarchy of consolidation rules automatically determine if two different rows in a database actually refer to the same real-world object. These rules are NOT statistical or probabilistic in nature, thus enhancing the confidence and reliability in the results. Three general classifications of Consolidation Strings are encompassed: Those based on positive identifiers, those based on demographic information, and those based on associative information that spans multiple-entity types.Type: ApplicationFiled: June 13, 2008Publication date: July 9, 2009Applicant: Knowledge Computing CorporationInventors: William Oliver, Robert Griffin, Wojciech Wyzga
-
Publication number: 20090172047Abstract: Date-warehouse systems are populated using an enhanced Extraction-Load-Transform (ETL) process and system by employing three ideas: Out-of-order-fill ETL, relative-ordering index (ROI), and dependent queries. Out-of-order-fill ETL allows a data warehouse to accept the loading of data files in any order, and does not require the loading of any previous backup data files in order to provide some functionality to end users under the view that some functionality or data access is better than none at all. Dependent queries are processes that use defined data structures for use in constructing, extracting, and validating each record to be written in said data-warehouse system in order to ensure that referential integrity is maintained and that no orphaned data is pushed into the data warehouse. Finally, ROI is a process wherein a value is determined, based on the constraints of the source data, which indicates the relative newness of the data.Type: ApplicationFiled: July 11, 2008Publication date: July 2, 2009Applicant: Knowledge Computing CorporationInventors: Adrian Boyko, William Oliver, Wojciech Wyzga, Zach Heidepriem
-
Publication number: 20020107871Abstract: A system for data mining and warehousing is provided. The system includes a client computer running a web browser. In conjunction with the web browser is an applet that helps to sort, decompress, compress, encrypt and unencrypt data. A remote server is coupled to the client computer and sends the web browser search forms after the web browser requests them and receives a search query from the web browser. A connect/detect database is coupled to the remote server that receives the search query at a database view. Data is then retrieved from a database table. The database tables contain data from one or more legacy databases. The data in the legacy databases are copied to the database tables using a migration engine coupled to a migration database. The database can be search to retrieve data related to a search term or retrieve the data related to a search term and additional data associated with the data related to the search term.Type: ApplicationFiled: February 5, 2002Publication date: August 8, 2002Applicant: Knowledge Computing CorporationInventors: Wojciech J. Wyzga, William J. Oliver, Michael S. Williams