Patents by Inventor Vivek R. Narasayya
Vivek R. Narasayya 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: 11372770Abstract: Methods for determining cache activity and for optimizing cache reclamation are performed by systems and devices. A cache entry access is determined at an access time, and a data object of the cache entry for a current time window is identified that includes a time stamp for a previous access and a counter index. A conditional counter operation is then performed on the counter associated with the index to increment the counter when the time stamp is outside the time window or to maintain the counter when the time stamp is within the time window. A counter index that identifies another counter for a previous time window where the other counter value was incremented for the previous cache entry access causes the other counter to be decremented. A cache configuration command to reclaim, or additionally allocate space to, the cache is generated based on the values of the counters.Type: GrantFiled: September 9, 2020Date of Patent: June 28, 2022Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Junfeng Dong, Ajay Kalhan, Manoj A. Syamala, Vivek R. Narasayya, Changsong Li, Shize Xu, Pankaj Arora, John M. Oslake, Arnd Christian König, Jiaqi Liu
-
Publication number: 20220075731Abstract: Methods for determining cache activity and for optimizing cache reclamation are performed by systems and devices. A cache entry access is determined at an access time, and a data object of the cache entry for a current time window is identified that includes a time stamp for a previous access and a counter index. A conditional counter operation is then performed on the counter associated with the index to increment the counter when the time stamp is outside the time window or to maintain the counter when the time stamp is within the time window. A counter index that identifies another counter for a previous time window where the other counter value was incremented for the previous cache entry access causes the other counter to be decremented. A cache configuration command to reclaim, or additionally allocate space to, the cache is generated based on the values of the counters.Type: ApplicationFiled: September 9, 2020Publication date: March 10, 2022Inventors: Junfeng DONG, Ajay KALHAN, Manoj A. SYAMALA, Vivek R. NARASAYYA, Changsong LI, Shize XU, Pankaj ARORA, John M. OSLAKE, Arnd Christian KÖNIG, Jiaqi LIU
-
Patent number: 11182360Abstract: Systems, methods, and computer-executable instructions for reorganizing a physical layout of data of a database a database. A workload is selected from previously executed database operations. A total resource consumption of the previously executed database operations and of the workload is determined. The total resource consumption of the workload is more than a predetermined threshold of the total resource consumption of the previously executed database operations. Optimization operations for the database are determined using the workload. A cloned database of the database is created. The optimization operations are executed on the cloned database. A database operation is received for the database. The database operation is executed on the database and the cloned database. The performance of the cloned database is verified as being improved compared to the performance of the database based on the executing of the database operation on the database and the cloned database.Type: GrantFiled: January 14, 2019Date of Patent: November 23, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Sudipto Das, Vivek R Narasayya, Gaoxiang Xu, Surajit Chaudhuri, Andrija Jovanovic, Miodrag Radulovic
-
Patent number: 11138266Abstract: Systems and techniques for leveraging query executions to improve index recommendations are described herein. In an example, a machine learning model is adapted to receive a first query plan and a second query plan for performing a query with a database, where the first query plan is different from the second query plan. The machine learning model may be further adapted to determine execution cost efficiency between the first query plan and the second query plan. The machine learning model is trained using relative execution cost comparisons between a set of pairs of query plans for the database. The machine learning model is further adapted to output a ranking of the first query plan and second query plan, where the first query plan and second query plan are ranked based on execution cost efficiency.Type: GrantFiled: February 21, 2019Date of Patent: October 5, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Bailu Ding, Sudipto Das, Surajit Chaudhuri, Vivek R Narasayya, Ryan Marcus, Lin Ma, Adith Swaminathan
-
Patent number: 10896229Abstract: The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).Type: GrantFiled: November 12, 2018Date of Patent: January 19, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Kanstantsyn Zoryn, Zhimin Chen, Kaushik Chakrabarti, James P. Finnigan, Vivek R. Narasayya, Surajit Chaudhuri, Kris Ganjam
-
Patent number: 10853344Abstract: The present invention extends to methods, systems, and computer program products for understanding tables for search. Aspects of the invention include identifying a subject tuple (e.g., a subject column) for a table, detecting a tuple header (e.g., a column header) using other tables, and detecting a tuple header (e.g., a column header) using a knowledge base. Implementations can be utilized in a structured data search system (SDSS) that indexes structured information, such as, tables in a relational database or html tables extracted from web pages. The SDSS allows users to search over the structured information (tables) using different mechanisms including keyword search and data finding data.Type: GrantFiled: July 27, 2017Date of Patent: December 1, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Zhongyuan Wang, Kanstantsyn Zoryn, Zhimin Chen, Kaushik Chakrabarti, James P. Finnigan, Vivek R. Narasayya, Surajit Chaudhuri, Kris Ganjam
-
Patent number: 10824592Abstract: Generally discussed herein are devices, systems, and methods for database management. A method may include determining a first hyperloglog (HLL) sketch of a first column of data, determining a second HLL sketch of a second column of data, estimating an inclusion coefficient based on the first and second HLL sketches, and performing operations on the first column of data or the second column of data in response to determining the inclusion coefficient is greater than, or equal to, a specified threshold.Type: GrantFiled: June 14, 2018Date of Patent: November 3, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Azade Nazi, Bolin Ding, Vivek R Narasayya, Surajit Chaudhuri
-
Patent number: 10810202Abstract: Systems, methods, and computer-executable instructions for creating a query execution plan for a query of a database includes receiving, from the database, a set of previously executed query execution plans for the query. Each previously-executed query execution plans includes subplans. Each subplan indicates a tree of physical operators. Physical operators that executed in the set of previously-executed query execution plans are determined. For each physical operator, an execution cost based is determined. Invalid physical operators from the previously-executed query execution plans that are invalid for the database are removed. Equivalent subplans from the previously-executed query execution plans are identified based on physical properties and logical expressions of the subplans. A constrained search space is created based on the equivalent subplans. A query execution plan for the query is constructed from the constrained search space based on the execution cost.Type: GrantFiled: June 14, 2018Date of Patent: October 20, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Bailu Ding, Sudipto Das, Wentao Wu, Surajit Chaudhuri, Vivek R Narasayya
-
Patent number: 10810181Abstract: The present invention extends to methods, systems, and computer program products for refining structured data indexes. Aspects of the invention include associating structured data, such as, for example, tables, with additional content. Additional content can include content outside the <table> and </table> tags of a web table. Indexes for structured data (e.g., table indexes) can be refined based on the additional content to improve the relevance of providing parts of the structured data (e.g., parts of the table) in search results.Type: GrantFiled: April 11, 2018Date of Patent: October 20, 2020Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Kanstantsyn Zoryn, Zhimin Chen, Kaushik Chakrabarti, James P. Finnigan, Vivek R. Narasayya, Surajit Chaudhuri, Kris Ganjam
-
Patent number: 10769123Abstract: Provided are methods and systems for generating physical database design tuning recommendations. Given a workload, the system analyzes the workload to identify and recommend a set of rowstore and columnstore indexes optimal for the performance of the workload. The system is designed to estimate the size of the columnstore index (at the granularity of each column) without actually building the index, estimate the improvement in query performance that each columnstore index would result in when built, and automatically derive the workload used for the physical design tuning task by analyzing stored query execution history data. This automatic workload derivation is orthogonal to columnstores and can be used even when columnstore indexes are not being used.Type: GrantFiled: June 28, 2017Date of Patent: September 8, 2020Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Sudipto Das, Bolin Ding, Vivek R. Narasayya, Manoj A. Syamala, Jingjing Wang, Gaoxiang Xu
-
Publication number: 20200272667Abstract: Systems and techniques for leveraging query executions to improve index recommendations are described herein. In an example, a machine learning model is adapted to receive a first query plan and a second query plan for performing a query with a database, where the first query plan is different from the second query plan. The machine learning model may be further adapted to determine execution cost efficiency between the first query plan and the second query plan. The machine learning model is trained using relative execution cost comparisons between a set of pairs of query plans for the database. The machine learning model is further adapted to output a ranking of the first query plan and second query plan, where the first query plan and second query plan are ranked based on execution cost efficiency.Type: ApplicationFiled: February 21, 2019Publication date: August 27, 2020Inventors: Bailu Ding, Sudipto Das, Surajit Chaudhuri, Vivek R Narasayya, Ryan Marcus, Lin Ma, Adith Swaminathan
-
Publication number: 20200226109Abstract: Systems, methods, and computer-executable instructions for reorganizing a physical layout of data of a database a database. A workload is selected from previously executed database operations. A total resource consumption of the previously executed database operations and of the workload is determined. The total resource consumption of the workload is more than a predetermined threshold of the total resource consumption of the previously executed database operations. Optimization operations for the database are determined using the workload. A cloned database of the database is created. The optimization operations are executed on the cloned database. A database operation is received for the database. The database operation is executed on the database and the cloned database. The performance of the cloned database is verified as being improved compared to the performance of the databased based on the executing of the database operation on the database and the cloned database.Type: ApplicationFiled: January 14, 2019Publication date: July 16, 2020Inventors: Sudipto Das, Vivek R. Narasayya, Gaoxiang Xu, Surajit Chaudhuri, Andrija Jovanovic, Miodrag Radulovic
-
Patent number: 10685020Abstract: In some embodiments, the disclosed subject matter involves a server query optimizer for parametric query optimization (PQO) to address the problem of finding and reusing a relatively small number of query plans that can achieve good plan quality across multiple instances of a parameterized query. An embodiment processes query instances on-line and ensures (a) tight, bounded cost sub-optimality for each instance, (b) low optimization overheads, and (c) only a small number of plans need to be stored. A plan re-costing based approach is disclosed to provide good performance on all three metrics. Other embodiments are described and claimed.Type: GrantFiled: June 2, 2017Date of Patent: June 16, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Surajit Chaudhuri, Anshuman Dutt, Vivek R Narasayya
-
Publication number: 20190384830Abstract: Generally discussed herein are devices, systems, and methods for database management. A method may include determining a first hyperloglog (HLL) sketch of a first column of data, determining a second HLL sketch of a second column of data, estimating an inclusion coefficient based on the first and second HLL sketches, and performing operations on the first column of data or the second column of data in response to determining the inclusion coefficient is greater than, or equal to, a specified threshold.Type: ApplicationFiled: June 14, 2018Publication date: December 19, 2019Inventors: Azade Nazi, Bolin Ding, Vivek R. Narasayya, Surajit Chaudhuri
-
Publication number: 20190384844Abstract: Systems, methods, and computer-executable instructions for creating a query execution plan for a query of a database includes receiving, from the database, a set of previously executed query execution plans for the query. Each previously-executed query execution plans includes subplans. Each subplan indicates a tree of physical operators. Physical operators that executed in the set of previously-executed query execution plans are determined. For each physical operator, an execution cost based is determined. Invalid physical operators from the previously-executed query execution plans that are invalid for the database are removed. Equivalent subplans from the previously-executed query execution plans are identified based on physical properties and logical expressions of the subplans. A constrained search space is created based on the equivalent subplans. A query execution plan for the query is constructed from the constrained search space based on the execution cost.Type: ApplicationFiled: June 14, 2018Publication date: December 19, 2019Inventors: Bailu Ding, Sudipto Das, Wentao Wu, Surajit Chaudhuri, Vivek R. Narasayya
-
Patent number: 10503704Abstract: Techniques for tenant performance isolation in a multiple-tenant database management system are described. These techniques may include providing a reservation of server resources. The server resources reservation may include a reservation of a central processing unit (CPU), a reservation of Input/Ouput throughput, and/or a reservation of buffer pool memory or working memory. The techniques may also include a metering mechanism that determines whether the resource reservation is satisfied. The metering mechanism may be independent of an actual resource allocation mechanism associated with the server resource reservation.Type: GrantFiled: August 31, 2016Date of Patent: December 10, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Vivek R. Narasayya, Sudipto Das, Feng Li, Manoj A. Syamala, Hyunjung Park, Surajit Chaudhuri, Badrish Chandramouli
-
Patent number: 10303646Abstract: A server system may include a cluster of multiple computers that are networked for high-speed data communications. Each of the computers has a remote direct memory access (RDMA) network interface to allow high-speed memory sharing between computers. A relational database engine of each computer is configured to utilize a hierarchy of memory for temporary storage of working data, including in order of decreasing access speed (a) local main memory, (b) remote memory accessed via RDMS, and (c) mass storage. The database engine uses the local main memory for working data, and additionally uses the RDMA accessible memory for working data when the local main memory becomes depleted. The server system may include a memory broker to which individual computers report their available or unused memory, and which leases shared memory to requesting computers.Type: GrantFiled: March 25, 2016Date of Patent: May 28, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Sudipto Das, Feng Li, Manoj A. Syamala, Vivek R. Narasayya
-
Publication number: 20190080006Abstract: The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).Type: ApplicationFiled: November 12, 2018Publication date: March 14, 2019Inventors: Kanstantsyn ZORYN, Zhimin CHEN, Kaushik CHAKRABARTI, James P. FINNIGAN, Vivek R. NARASAYYA, Surajit CHAUDHURI, Kris GANJAM
-
Publication number: 20180329955Abstract: In some embodiments, the disclosed subject matter involves a server query optimizer for parametric query optimization (PQO) to address the problem of finding and reusing a relatively small number of query plans that can achieve good plan quality across multiple instances of a parameterized query. An embodiment processes query instances on-line and ensures (a) tight, bounded cost sub-optimality for each instance, (b) low optimization overheads, and (c) only a small number of plans need to be stored. A plan re-costing based approach is disclosed to provide good performance on all three metrics. Other embodiments are described and claimed.Type: ApplicationFiled: June 2, 2017Publication date: November 15, 2018Inventors: Surajit Chaudhuri, Anshuman Dutt, Vivek R. Narasayya
-
Patent number: 10127315Abstract: The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).Type: GrantFiled: July 8, 2014Date of Patent: November 13, 2018Inventors: Kanstantsyn Zoryn, Zhimin Chen, Kaushik Chakrabarti, James P. Finnigan, Vivek R. Narasayya, Surajit Chaudhuri, Kris Ganjam