Patents by Inventor Eugene Inseok Chong
Eugene Inseok Chong 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: 11822531Abstract: Disclosed is an improved approach to represent RDF data in a database system, where one or more auxiliary tables are maintained for the RDF data. The auxiliary tables advantageously permit a database processing system to process a query using fewer numbers of joins or self-joins.Type: GrantFiled: December 7, 2021Date of Patent: November 21, 2023Assignee: Oracle International CorporationInventors: Souripriya Das, Matthew Steven Perry, Eugene Inseok Chong
-
Publication number: 20230177037Abstract: Disclosed is an improved approach to represent RDF data in a database system, where one or more auxiliary tables are maintained for the RDF data. The auxiliary tables advantageously permit a database processing system to process a query using fewer numbers of joins or self-joins.Type: ApplicationFiled: December 7, 2021Publication date: June 8, 2023Applicant: Oracle International CorporationInventors: Souripriya DAS, Matthew Steven PERRY, Eugene Inseok CHONG
-
Patent number: 10572485Abstract: Systems for database query processors. In a method embodiment, processing commences upon receiving a first set of a plurality of database language queries that reference a normalized column in an RDF table and that also includes a JOIN clause that references both the normalized column in the RDF table and a corresponding lookup table (e.g., a denormalization dictionary) that contains both normalized RDF data and denormalized RDF data. An in-memory table is allocated and formatted to comprise virtual columns that correspond to denormalized RDF data. Virtual columns of the in-memory table are populated with denormalized RDF data. In case of receipt of a SPARQL query, the incoming query is first translated into non-SPARQL database statements which are in turn recoded into database language statements that use lookup functions to lookup the denormalized RDF data from the virtual columns of the in-memory table rather than by incurring expensive disk I/O operations.Type: GrantFiled: April 28, 2017Date of Patent: February 25, 2020Assignee: ORACLE INTERNATIONAL CORPORATIONInventor: Eugene Inseok Chong
-
Publication number: 20180314737Abstract: Systems for database query processors. In a method embodiment, processing commences upon receiving a first set of a plurality of database language queries that reference a normalized column in an RDF table and that also includes a JOIN clause that references both the normalized column in the RDF table and a corresponding lookup table (e.g., a denormalization dictionary) that contains both normalized RDF data and denormalized RDF data. An in-memory table is allocated and formatted to comprise virtual columns that correspond to denormalized RDF data. Virtual columns of the in-memory table are populated with denormalized RDF data. In case of receipt of a SPARQL query, the incoming query is first translated into non-SPARQL database statements which are in turn recoded into database language statements that use lookup functions to lookup the denormalized RDF data from the virtual columns of the in-memory table rather than by incurring expensive disk I/O operations.Type: ApplicationFiled: April 28, 2017Publication date: November 1, 2018Applicant: ORACLE INTERNATIONAL CORPORATIONInventor: Eugene Inseok CHONG
-
Patent number: 8782017Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.Type: GrantFiled: December 12, 2011Date of Patent: July 15, 2014Assignee: Oracle International CorporationInventors: Souripriya Das, Eugene Inseok Chong, Zhe Wu, Melliyal Annamalai, Jogannathan Srinivasan
-
Patent number: 8768931Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.Type: GrantFiled: December 12, 2011Date of Patent: July 1, 2014Assignee: Oracle International CorporationInventors: Souripriya Das, Eugene Inseok Chong, Zhe Wu, Melliyal Annamalai, Jogannathan Srinivasan
-
Patent number: 8719250Abstract: The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.Type: GrantFiled: April 18, 2005Date of Patent: May 6, 2014Assignee: Oracle International CorporationInventors: Eugene Inseok Chong, Souripriya Das, George Eadon, Jagannathan Srinivasan
-
Patent number: 8401991Abstract: An un-indexed, partitioned temporary table and an exchange table are used in the inferencing of semantic data in a relational database system. The exchange table has the same structure as a semantic data table storing the semantic data. In the inferencing process, a new partition is created in the semantic data table. Inference rules are executed on the semantic data table, and any newly inferred semantic data generated is added to the temporary table. Once no new data is generated, the inferred semantic data is copied from the temporary table into the exchange table. Indexes that are the same as indexes for the semantic data table are built for the exchange table. The indexed data in the exchange table is then exchanged into the new partition in the semantic data table. By use of the un-indexed, partitioned temporary table, incremental maintenance of indexes is avoided, thus allowing for greater efficiency.Type: GrantFiled: August 8, 2008Date of Patent: March 19, 2013Assignee: Oracle International CorporationInventors: Zhe Wu, George Eadon, Souripriya Das, Eugene Inseok Chong, Vladimir Kolovski, Melliyal Annamalai, Jagannathan Srinivasan
-
Patent number: 8214354Abstract: Techniques for using arbitrary sets of objects to constrain objects in database systems. The constraint set of objects is associated with the constrained object in the database system and the database system will perform an operation which adds an object to the constrained object only if the object being added belongs to the constraint set. In a preferred embodiment, the techniques are employed to obtain constraint sets of terms from ontologies which are then used to constrain columns containing those terms. An implementation of the techniques makes a materialized view out of the objects in the constraint set and uses the materialized view to define a referential integrity constraint on the constrained column.Type: GrantFiled: March 31, 2006Date of Patent: July 3, 2012Assignee: Oracle International CorporationInventors: Eugene Inseok Chong, Souripriya Das, George Eadon, Jagannathan Srinivasan
-
Publication number: 20120117081Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.Type: ApplicationFiled: December 12, 2011Publication date: May 10, 2012Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Souripriya DAS, Eugene Inseok CHONG, Zhe WU, Melliyal ANNAMALAI, Jagannathan SRINIVASAN
-
Publication number: 20120084271Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.Type: ApplicationFiled: December 12, 2011Publication date: April 5, 2012Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Souripriya DAS, Eugene Inseok CHONG, Zhe WU, Melliyal ANNAMALAI, Jogannathan SRINIVASAN
-
Patent number: 8078646Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.Type: GrantFiled: August 8, 2008Date of Patent: December 13, 2011Assignee: Oracle International CorporationInventors: Souripriya Das, Eugene Inseok Chong, Zhe Wu, Melliyal Annamalai, Jagannathan Srinivasan
-
Patent number: 7870174Abstract: Systems, methodologies, media, and other embodiments associated with supporting reference partitioned tables in a relational database are described. One example method includes identifying a partitioning strategy (e.g., range, list, hash) associated with a parent table that is related to a child table by a referential constraint. The example method may also include creating the child table to be a reference-partitioned table partitioned according to the partitioning strategy associated with the parent table. The example method may also include creating the child table to be equi-partitioned with respect to the parent table. The child table is not to replicate a partition key of the parent table but rather is to inherit a partitioning key associated with the parent table through a foreign key relationship.Type: GrantFiled: October 11, 2007Date of Patent: January 11, 2011Assignee: Oracle International CorporationInventors: George Eadon, Eugene Inseok Chong, Shrikanth Shankar, Ananth Raghavan, Jagannathan Srinivasan, Souripriya Das
-
Patent number: 7680862Abstract: The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.Type: GrantFiled: April 18, 2005Date of Patent: March 16, 2010Assignee: Oracle International CorporationInventors: Eugene Inseok Chong, Souripriya Das, George Eadon, Jagannathan Srinivasan
-
Publication number: 20100036862Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.Type: ApplicationFiled: August 8, 2008Publication date: February 11, 2010Applicant: Oracle International CorporationInventors: Souripriya Das, Eugene Inseok Chong, Zhe Wu, Melliyal Annamalai, Jagannathan Srinivasan
-
Publication number: 20100036788Abstract: An un-indexed, partitioned temporary table and an exchange table are used in the inferencing of semantic data in a relational database system. The exchange table has the same structure as a semantic data table storing the semantic data. In the inferencing process, a new partition is created in the semantic data table. Inference rules are executed on the semantic data table, and any newly inferred semantic data generated is added to the temporary table. Once no new data is generated, the inferred semantic data is copied from the temporary table into the exchange table. Indexes that are the same as indexes for the semantic data table are built for the exchange table. The indexed data in the exchange table is then exchanged into the new partition in the semantic data table. By use of the un-indexed, partitioned temporary table, incremental maintenance of indexes is avoided, thus allowing for greater efficiency.Type: ApplicationFiled: August 8, 2008Publication date: February 11, 2010Applicant: Oracle International CorporationInventors: Zhe Wu, George Eadon, Souripriya Das, Eugene Inseok Chong, Vladimir Kolovski, Melliyal Annamalai, Jagannathan Srinivasan
-
Publication number: 20090100089Abstract: Systems, methodologies, media, and other embodiments associated with supporting reference partitioned tables in a relational database are described. One example method includes identifying a partitioning strategy (e.g., range, list, hash) associated with a parent table that is related to a child table by a referential constraint. The example method may also include creating the child table to be a reference-partitioned table partitioned according to the partitioning strategy associated with the parent table. The example method may also include creating the child table to be equi-partitioned with respect to the parent table. The child table is not to replicate a partition key of the parent table but rather is to inherit a partitioning key associated with the parent table through a foreign key relationship.Type: ApplicationFiled: October 11, 2007Publication date: April 16, 2009Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: George Eadon, Eugene Inseok Chong, Shrikanth Shankar, Ananth Raghavan, Jagannathan Srinivasan, Souriprlya Das
-
Patent number: 7328209Abstract: The method for processing data in a relational database wherein ontology data that specifies terms and relationships between pairs of said terms expressed in an OWL document is stored in the database, database queries that include a semantic matching operator are formed which identify the ontology data and further specify a stated relationship between two input terms, and the query is executed to invoke the semantic matching operator to determine if the two input terms are related by the stated relationship by consulting said ontology data.Type: GrantFiled: August 11, 2004Date of Patent: February 5, 2008Assignee: Oracle International CorporationInventors: Souripriya Das, Eugene Inseok Chong, George Eadon, Jagannathan Srinivasan