Patents by Inventor Kaushik Shriraghav
Kaushik Shriraghav 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: 10572442Abstract: A database management system (DBMS) run a host CPU and a hardware coprocessor accelerate traversal of a tree-type data structure by allocating reusable memory in cache to store portions of the tree-type data structure as the tree-type data structure is being requested by the host CPU. The hardware coprocessor manages the cached tree-type data structure in a manner that is transparent to the host CPU. A driver located at the host CPU or at a separate computing device can provide an interface between the host CPU and the hardware coprocessor, thus reducing communications between the host CPU and the hardware coprocessor.Type: GrantFiled: November 26, 2014Date of Patent: February 25, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Kenneth H. Eguro, Zsolt Istvan, Arvind Arasu, Ravishankar Ramamurthy, Kaushik Shriraghav
-
Patent number: 9953184Abstract: The techniques discussed herein facilitate the transmission, storage, and manipulation of data in an encrypted database management system (EDBMS). An untrusted machine is connected to a data store having encrypted records, a client machine that sends encrypted queries, and a trusted machine that receives and decrypts the encrypted records and encrypted queries. The trusted machine processes the query using semantically secure query operators to produce a query result. The trusted machine ensures the size of the query result conforms to an upper bound on the number or records in the query result and returns the query result.Type: GrantFiled: April 17, 2015Date of Patent: April 24, 2018Assignee: Microsoft Technology Licensing, LLCInventors: Arvind Arasu, Kenneth Hiroshi Eguro, Ravishankar Ramamurthy, Kaushik Shriraghav
-
Publication number: 20160306995Abstract: The techniques discussed herein facilitate the transmission, storage, and manipulation of data in an encrypted database management system (EDBMS). An untrusted machine is connected to a data store having encrypted records, a client machine that sends encrypted queries, and a trusted machine that receives and decrypts the encrypted records and encrypted queries. The trusted machine processes the query using semantically secure query operators to produce a query result. The trusted machine ensures the size of the query result conforms to an upper bound on the number or records in the query result and returns the query result.Type: ApplicationFiled: April 17, 2015Publication date: October 20, 2016Inventors: Arvind Arasu, Kenneth Hiroshi Eguro, Ravishankar Ramamurthy, Kaushik Shriraghav
-
Publication number: 20160147779Abstract: A database management system (DBMS) run a host CPU and a hardware coprocessor accelerate traversal of a tree-type data structure by allocating reusable memory in cache to store portions of the tree-type data structure as the tree-type data structure is being requested by the host CPU. The hardware coprocessor manages the cached tree-type data structure in a manner that is transparent to the host CPU. A driver located at the host CPU or at a separate computing device can provide an interface between the host CPU and the hardware coprocessor, thus reducing communications between the host CPU and the hardware coprocessor.Type: ApplicationFiled: November 26, 2014Publication date: May 26, 2016Inventors: Kenneth H. Eguro, Zsolt Istvan, Arvind Arasu, Ravishankar Ramamurthy, Kaushik Shriraghav
-
Patent number: 8606771Abstract: The claimed subject matter provides a method and a system for the efficient indexing of error tolerant set containment. An exemplary method comprises obtaining a frequency threshold and a query set. All tokens or token sets within the query set are determined, and then all minimal infrequent tokens or all minimal infrequent tokens sets of data records are found and used to build an index. The minimal infrequent tokens or minimal infrequent tokensets are processed in a fixed order, and then a collection of signatures for each minimal infrequent token or token set is determined.Type: GrantFiled: December 21, 2010Date of Patent: December 10, 2013Assignee: Microsoft CorporationInventors: Arvind Arasu, Parag Agrawal, Kaushik Shriraghav
-
Publication number: 20120330880Abstract: The claimed subject matter provides a method for data generation. The method includes identifying a generative probability distribution based on one or more cardinality constraints for populating a database table. The method also includes selecting one or more values for a corresponding one or more attributes in the database table based on the generative probability distribution and the cardinality constraints. Additionally, the method includes generating a tuple for the database table. The tuple comprises the one or more values.Type: ApplicationFiled: June 23, 2011Publication date: December 27, 2012Applicant: Microsoft CorporationInventors: Arvind Arasu, Kaushik Shriraghav, Jian Li
-
Publication number: 20120158696Abstract: The claimed subject matter provides a method and a system for the efficient indexing of error tolerant set containment. An exemplary method comprises obtaining a frequency threshold and a query set. All tokens or token sets within the query set are determined, and then all minimal infrequent tokens or all minimal infrequent tokens sets of data records are found and used to build an index. The minimal infrequent tokens or minimal infrequent tokensets are processed in a fixed order, and then a collection of signatures for each minimal infrequent token or token set is determined.Type: ApplicationFiled: December 21, 2010Publication date: June 21, 2012Applicant: Microsoft CorporationInventors: Arvind Arasu, Parag Agrawal, Kaushik Shriraghav
-
Patent number: 7865505Abstract: A machine implemented system and method that efficiently facilitates and effectuates exact similarity joins between collections of sets. The system and method obtains a collection of sets and a threshold value from an interface, and based at least in part on an identifiable similarity, such as an overlap or intersection, between the collection of sets the analysis component generates and outputs a candidate pair that at least equals or exceeds the threshold value.Type: GrantFiled: January 30, 2007Date of Patent: January 4, 2011Assignee: Microsoft CorporationInventors: Arvind Arasu, Venkatesh Ganti, Kaushik Shriraghav
-
Patent number: 7707207Abstract: The claimed subject matter relates to incorporating a skyline operator within a relational database engine, and more particularly to a database engine that utilizes novel techniques to determine the lowest cost of generating the skyline produced by the skyline operator. The database engine receives queries and associated preferences and, based on a cardinality estimate and a cost estimate, an appropriate skyline generating technique is utilized to produce a skyline representative of the received queries and its associated preferences.Type: GrantFiled: February 17, 2006Date of Patent: April 27, 2010Assignee: Microsoft CorporationInventors: Kaushik Shriraghav, Surajit Chaudhuri, Nilesh N. Dalvi
-
Patent number: 7634464Abstract: The subject disclosure pertains to a powerful and flexible framework for record matching. The framework facilitates design of a record matching query or package composed of a set of well-defined primitive operators (e.g., relational, data cleaning . . . ), which can ultimately be executed to match records. To assist design of such packages, a learning technique based on examples is provided. More specifically, a set of matching and non-matching record pairs can be input and employed to facilitate automatic package generation. A generated package can subsequently be transformed manually and/or automatically into a semantically equivalent form optimized for execution.Type: GrantFiled: June 14, 2006Date of Patent: December 15, 2009Assignee: Microsoft CorporationInventors: Bee-Chung Chen, Venkatesh Ganti, Kaushik Shriraghav
-
Patent number: 7562067Abstract: A system that facilitates estimating functional relationships associated with one or more columns in a database comprises a sampling component that receives a random sample of records within the database. An estimate generator component calculates an estimate of strength of functional relationships based at least in part upon the received samples. For example, the estimate generator component can calculate an estimate of strength of a column as a key column based at least in part upon the received samples.Type: GrantFiled: May 6, 2005Date of Patent: July 14, 2009Assignee: Microsoft CorporationInventors: Surajit Chaudhuri, Venkatesh Ganti, Kaushik Shriraghav
-
Patent number: 7558780Abstract: The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.Type: GrantFiled: November 30, 2006Date of Patent: July 7, 2009Assignee: Microsoft CorporationInventors: Kaushik Shriraghav, Venkatesh Ganti, Xin Dong
-
Patent number: 7454407Abstract: Techniques for estimating the progress of database queries are described herein. In a first implementation, a respective lower-bound parameter is associated with each node in an operator tree that representing a given database query, and the progress of the database query at a given point is estimated based upon the lower-bound parameters. In a second implementation, the progress of the query is estimated by associating respective lower-bound and upper-bound parameters with each node in the operator tree. The progress of the query at the given point is then estimated based on the lower-bound and upper-bound parameters.Type: GrantFiled: June 10, 2005Date of Patent: November 18, 2008Assignee: Microsoft CorporationInventors: Surajit Chaudhuri, Ravishankar Ramamurthy, Kaushik Shriraghav
-
Patent number: 7406479Abstract: A set similarity join system and method are provided. The system can be employed to facilitate data cleaning based on similarities through the identification of “close” tuples (e.g., records and/or rows). “Closeness” can be is evaluated using a similarity function(s) chosen to suit the domain and/or application. Thus, the system facilitates generic domain-independent data cleansing. The system can be employed with a foundational primitive, the set similarity join (SSJoin) operator, which can be used as a building block to implement a broad variety of notions of similarity (e.g., edit similarity, Jaccard similarity, generalized edit similarity, hamming distance, soundex, etc.) as well as similarity based on co-occurrences. The SSJoin operator can exploit the observation that set overlap can be used effectively to support a variety of similarity functions. The SSJoin operator compares values based on “sets” associated with (or explicitly constructed for) each one of them.Type: GrantFiled: February 10, 2006Date of Patent: July 29, 2008Assignee: Microsoft CorporationInventors: Kaushik Shriraghav, Surajit Chaudhuri, Venkatesh Ganti
-
Publication number: 20070294221Abstract: The subject disclosure pertains to a powerful and flexible framework for record matching. The framework facilitates design of a record matching query or package composed of a set of well-defined primitive operators (e.g., relational, data cleaning . . . ), which can ultimately be executed to match records. To assist design of such packages, a learning technique based on examples is provided. More specifically, a set of matching and non-matching record pairs can be input and employed to facilitate automatic package generation. A generated package can subsequently be transformed manually and/or automatically into a semantically equivalent form optimized for execution.Type: ApplicationFiled: June 14, 2006Publication date: December 20, 2007Applicant: MICROSOFT CORPORATIONInventors: Bee-Chung Chen, Venkatesh Ganti, Kaushik Shriraghav
-
Publication number: 20070198439Abstract: The claimed subject matter relates to incorporating a skyline operator within a relational database engine, and more particularly to a database engine that utilizes novel techniques to determine the lowest cost of generating the skyline produced by the skyline operator. The database engine receives queries and associated preferences and based on a cardinality estimate and a cost estimate an appropriate skyline generating technique is utilized to produce a skyline representative of the received queries and its associated preferences.Type: ApplicationFiled: February 17, 2006Publication date: August 23, 2007Applicant: Microsoft CorporationInventors: Kaushik Shriraghav, Surajit Chaudhuri, Nilesh Dalvi
-
Publication number: 20070198469Abstract: The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.Type: ApplicationFiled: November 30, 2006Publication date: August 23, 2007Applicant: MICROSOFT CORPORATIONInventors: Kaushik Shriraghav, Venkatesh Ganti, Xin Dong
-
Publication number: 20070192297Abstract: The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.Type: ApplicationFiled: November 9, 2006Publication date: August 16, 2007Applicant: MICROSOFT CORPORATIONInventors: Kaushik Shriraghav, Venkatesh Ganti, Xin Dong
-
Publication number: 20070192282Abstract: The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.Type: ApplicationFiled: February 13, 2006Publication date: August 16, 2007Applicant: Microsoft CorporationInventors: Kaushik Shriraghav, Venkatesh Ganti, Xin Dong
-
Publication number: 20070192342Abstract: A set similarity join system and method are provided. The system can be employed to facilitate data cleaning based on similarities through the identification of “close” tuples (e.g., records and/or rows). “Closeness” can be is evaluated using a similarity function(s) chosen to suit the domain and/or application. Thus, the system facilitates generic domain-independent data cleansing. The system can be employed with a foundational primitive, the set similarity join (SSJoin) operator, which can be used as a building block to implement a broad variety of notions of similarity (e.g., edit similarity, Jaccard similarity, generalized edit similarity, hamming distance, soundex, etc.) as well as similarity based on co-occurrences. The SSJoin operator can exploit the observation that set overlap can be used effectively to support a variety of similarity functions. The SSJoin operator compares values based on “sets” associated with (or explicitly constructed for) each one of them.Type: ApplicationFiled: February 10, 2006Publication date: August 16, 2007Applicant: Microsoft CorporationInventors: Kaushik Shriraghav, Surajit Chaudhuri, Venkatesh Ganti