Patents by Inventor Jay Kumar Goyal
Jay Kumar Goyal 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: 9116990Abstract: Methods, systems, and computer-storage media for improving the freshness, or the apparent freshness, of search results are described. In an embodiment, the first portion of search results presented on a search results page are based on responsiveness to the search query and a second portion of results describe only recently published documents that are responsive to the search query. In an embodiment, a more recent version of the document, which is not directly used to determine responsiveness, is used to build the caption for a search result. Another way to make search results appear fresh is to include a publication time within the search result caption. In one embodiment, the publication time is generated by calculating a point in time between when a document is first added to a search index and the previous time the search engine visited the site where the document was found.Type: GrantFiled: May 27, 2010Date of Patent: August 25, 2015Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Walter Sun, Thomas Arthur Ledbetter, Vinay Sudhir Deshpande, Yinzhe Yu, Lin Guo, Abhishek Singh, Junaid Ahmed, Jay Kumar Goyal, Jingfeng Li, Brahm Kiran Singh
-
Patent number: 8756245Abstract: Systems and methods for answering user questions using databases annotated with answerable questions are disclosed. The database includes database items organized into columns. Each of the columns may have a question annotated thereto. The question is a parameterized question that is answerable by the database items in the column. A question answering algorithm is used to search the database for an annotated question corresponding to a question that needs to be answered.Type: GrantFiled: May 16, 2006Date of Patent: June 17, 2014Assignee: IAC Search & Media, Inc.Inventors: Tomasz Imielinski, Rohit Mittal, Scot Zola, Jay Kumar Goyal
-
Patent number: 8244701Abstract: Systems and methods for applying user behavior data to improve search query result ranking are provided. Upon receiving an update file indicating that recent, significant user behavior data is available for a document associated with an inverted index, the update file is published periodically and frequently to an index server. After filtering out the relevant update information from the update file, the index server extracts identifiers of the documents having the associated user behavior data. The update file and the identifier of the documents are utilized to update an in-memory index containing representations of metadata indicative of the user behavior. The in-memory index is continuously updated and utilized to serve search query results in response to user search queries. Search query results from the in-memory index are ranked using the user behavior data prior to serving. Thus, results associated with recent, significant user-behavior metadata receive prominent placement on the search results page.Type: GrantFiled: June 27, 2011Date of Patent: August 14, 2012Assignee: Microsoft CorporationInventors: Walter Sun, Jay Kumar Goyal, Pratibha Permandla, Yinzhe Yu, Jingfeng Li
-
Patent number: 8239391Abstract: Methods, systems, and media are provided for an optimized search engine index. The optimized index is formed by merging small lower level indexes of fresh documents together into a hierarchical cluster of multiple higher level indexes. The optimized index of fresh documents is formed via a single threaded process, while a fresh index serving platform concurrently serves fresh queries. The hierarchy of higher level indexes is formed by merging lower and/or higher level indexes with similar expiration times together. Therefore, as some indexes expire, the remaining un-expired indexes can be re-used and merged with new incoming indexes. The single threaded process provides fast serving of fresh documents, while also providing time to integrate the fresh indexes into a long term primary search engine index, prior to expiring.Type: GrantFiled: July 13, 2010Date of Patent: August 7, 2012Assignee: Microsoft CorporationInventors: Jay Kumar Goyal, Neil Sharman, Vibhaakar Sharma, Vinay Sudhir Deshpande, Utkarsh Jain, Gaurav Sareen, Yinzhe Yu, Daniel Yuan
-
Patent number: 8150841Abstract: Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.Type: GrantFiled: January 20, 2010Date of Patent: April 3, 2012Assignee: Microsoft CorporationInventors: Christopher Avery Meyers, Gopi Prashanth Gopal, Andrew Peter Oakley, Nitin Agrawal, Nicholas Eric Craswell, Milad Shokouhi, Derrick Leslie Connell, Sanaz Ahari, Neil Bruce Sharman, Gaurav Sareen, Hugh Evan Williams, Jay Kumar Goyal
-
Publication number: 20120016864Abstract: Methods, systems, and media are provided for an optimized search engine index. The optimized index is formed by merging small lower level indexes of fresh documents together into a hierarchical cluster of multiple higher level indexes. The optimized index of fresh documents is formed via a single threaded process, while a fresh index serving platform concurrently serves fresh queries. The hierarchy of higher level indexes is formed by merging lower and/or higher level indexes with similar expiration times together. Therefore, as some indexes expire, the remaining un-expired indexes can be re-used and merged with new incoming indexes. The single threaded process provides fast serving of fresh documents, while also providing time to integrate the fresh indexes into a long term primary search engine index, prior to expiring.Type: ApplicationFiled: July 13, 2010Publication date: January 19, 2012Applicant: MICROSOFT CORPORATIONInventors: JAY KUMAR GOYAL, NEIL SHARMAN, VIBHAAKAR SHARMA, VINAY SUDHIR DESHPANDE, UTKARSH JAIN, GAURAV SAREEN, YINZHE YU, DANIEL YUAN
-
Publication number: 20110295844Abstract: Methods, systems, and computer-storage media for improving the freshness, or the apparent freshness, of search results are described. In an embodiment, the first portion of search results presented on a search results page are based on responsiveness to the search query and a second portion of results describe only recently published documents that are responsive to the search query. In an embodiment, a more recent version of the document, which is not directly used to determine responsiveness, is used to build the caption for a search result. Another way to make search results appear fresh is to include a publication time within the search result caption. In one embodiment, the publication time is generated by calculating a point in time between when a document is first added to a search index and the previous time the search engine visited the site where the document was found.Type: ApplicationFiled: May 27, 2010Publication date: December 1, 2011Applicant: MICROSOFT CORPORATIONInventors: WALTER SUN, THOMAS ARTHUR LEDBETTER, VINAY SUDHIR DESHPANDE, YINZHE YU, LIN GUO, ABHISHEK SINGH, JUNAID AHMED, JAY KUMAR GOYAL, JINGFENG LI, BRAHM KIRAN SINGH
-
Publication number: 20110258198Abstract: Systems and methods for applying user behavior data to improve serach query result ranking are provided. Upon receiving an update file indicating that recent, significant user behavior data is available for a document associated with an inverted index, the update file is published periodically and frequently to an index server. After filtering out the relevant update information from the update file, the index server extracts identifiers of the documents having the associated user behavior data. The update file and the identifier of the documents are utilized to update an in-memory index containing representations of metadata indicative of the user behavior. The in-memory index is continuously updated and utilized to serve search query results in response to user search queries. Search query results from the in-memory index are ranked using the user behavior data prior to serving. Thus, results associated with recent, significant user-behavior metadata receive prominent placement on the search results page.Type: ApplicationFiled: June 27, 2011Publication date: October 20, 2011Applicant: MICROSOFT CORPORATIONInventors: WALTER SUN, JAY KUMAR GOYAL, PRATIBHA PERMANDLA, YINZHE YU, JINGFENG LI
-
Publication number: 20110179017Abstract: Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.Type: ApplicationFiled: January 20, 2010Publication date: July 21, 2011Applicant: MICROSOFT CORPORATIONInventors: CHRISTOPHER AVERY MEYERS, GOPI PRASHANTH GOPAL, ANDREW PETER OAKLEY, NITIN AGRAWAL, NICHOLAS ERIC CRASWELL, MILAD SHOKOUHI, DERRICK LESLIE CONNELL, SANAZ AHARI, NEIL BRUCE SHARMAN, GAURAV SAREEN, HUGH EVAN WILLIAMS, JAY KUMAR GOYAL