Corey J. Centen - Victoria, CA Sarah A. Smith - Victoria, CA Gregory V. Browne - Redmond WA, US Ryan D. Lee - Victoria, CA Maegan P. Wilkinson - Seattle WA, US Richard C. Nova - Kirkland WA, US Chad Alan Follmar - Louisville CO, US David Mark VandeRiet - Louisville CO, US Seth Paul Lynch - Raleigh NC, US Mark Catron - Louisville CO, US Chad Clayton Walters - Apex NC, US
Gregory V. Browne - Redmond WA, US Adam Looker - Victoria, CA Ryan D. Lee - Victoria, CA Sarah A. Smith - Victoria, CA Corey J. Centen - Toronto, CA Maegan P. Wilkinson - Seattle WA, US Richard C. Nova - Kirkland WA, US Cathlene Durand Buchanan - Shoreline WA, US Chad Alan Follmar - Louisville CO, US David Mark VandeRiet - Louisville CO, US Seth Paul Lynch - Raleigh NC, US Mark Allen Catron - Superior CO, US Chad Clayton Walters - Apex NC, US
Knut Magne Risvik - Mo I Rana, NO Michael Hopcroft - Kirkland WA, US John G. Bennett - Bellevue WA, US Karthik Kalyanaraman - Bellevue WA, US Trishul Chilimbi - Seattle WA, US Chad P. Walters - Bellevue WA, US Jan Otto Pedersen - Los Altos CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
US Classification:
707723
Abstract:
Search results are identified and returned in response to search queries by evaluating and pruning candidate documents in multiple stages. The process employs a search index that indexes atoms found in documents and pre-computed scores for document/atom pairs. When a search query is received, atoms are identified from the search query and a reformulated query is generated based on the identified atoms. The reformulated query is used to identify matching documents, and a preliminary score is generated for matching documents using a simplified scoring function and pre-computed scores in the search index. Documents are pruned based on preliminary scores, and the remaining documents are evaluated using a final ranking algorithm that provides a final set of ranked documents, which is used to generate search results to return in response to the search query.
KNUT MAGNE RISVIK - MO I RANA, NO MICHAEL HOPCROFT - KIRKLAND WA, US JOHN G. BENNETT - BELLEVUE WA, US KARTHIK KALYANARAMAN - BELLEVUE WA, US TRISHUL CHILIMBI - SEATTLE WA, US CHAD P. WALTERS - BELLEVUE WA, US VISHESH PARIKH - REDMOND WA, US JAN OTTO PEDERSEN - LOS ALTOS CA, US
Assignee:
MICROSOFT CORPORATION - REDMOND WA
International Classification:
G06F 17/30
US Classification:
707723, 707741, 707E17002, 707E17014, 707E17005
Abstract:
Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.
Hybrid-Distribution Model For Search Engine Indexes
KNUT MAGNE RISVIK - MO I RANA, NO MICHAEL HOPCROFT - KIRKLAND WA, US JOHN BENNETT - BELLEVUE WA, US KARTHIK KALYANARAMAN - BELLEVUE WA, US TRISHUL CHILIMBI - SEATTLE WA, US CHAD P. WALTERS - BELLEVUE WA, US VISHESH PARIKH - REDMOND WA, US JAN OTTO PEDERSEN - LOS ALTOS CA, US
Assignee:
MICROSOFT CORPORATION - REDMOND WA
International Classification:
G06F 17/30
US Classification:
707723, 707737, 707E17089, 707E17014
Abstract:
Methods and systems are provided for using a hybrid-distribution system to identify relevant documents based on a search query. A group of documents is assigned to a particular segment. The group of documents is indexed both by atom and by document to form a reverse index and a forward index. Both indexes are divided amongst each node in that segment so that each node is responsible for storing and accessing a different portion of both the reverse and forward indexes. The reverse index portion is accessed on each of a first set of nodes to identify a first set of documents that is relevant to a particular search query. Document identifications associated with the first set of documents are used to identify a second set of nodes that access their forward index portions to limit the number of relevant documents to a second set of documents.
HUI SHEN - Beijing, CN Mao Yang - Beijing, CN Lintao Zhang - Beijing, CN Zhenyu Zhao - Beijing, CN Xiao Wu - Beijing, CN Ying Yan - Beijing, CN Xiaosong Yang - Beijing, CN Chad Walters - Bellevue WA, US Choong Soon Chang - Palo Alto CA, US
International Classification:
G06F 17/30
US Classification:
707711, 707E17002, 707E17108
Abstract:
Subject matter described herein includes a multi-layer search-engine index. Accordingly, the search-engine index is divided into multiple indexes, each of which includes a respective set of information used to serve (i.e., respond to) a query. One index includes a term index, which organizes a set of terms that are found among a collection of documents. Another index includes a document index, which organizes a set of documents that are searchable. A computing device is used to serve the search-engine index (i.e., to analyze the index when identifying documents relevant to a search query). For example, a solid-state device might be used to serve the multi-layer search-engine index.
- Redmond WA, US MICHAEL HOPCROFT - KIRKLAND WA, US JOHN G. BENNETT - BELLEVUE WA, US KARTHIK KALYANARAMAN - BELLEVUE WA, US TRISHUL CHILIMBI - SEATTLE WA, US CHAD P. WALTERS - BELLEVUE WA, US VISHESH PARIKH - REDMOND WA, US JAN OTTO PEDERSEN - LOS ALTOS CA, US
International Classification:
G06F 16/951 G06F 16/182 G06F 16/2453 G06F 16/2457
Abstract:
Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.
- Redmond WA, US MAO YANG - BEIJING, CN LINTAO ZHANG - BEIJING, CN ZHENYU ZHAO - BEIJING, CN XIAO WU - BEIJING, CN YING YAN - BEIJING, CN XIAOSONG YANG - BEIJING, CN CHAD WALTERS - BELLEVUE WA, US CHOONG SOON CHANG - PALO ALTO CA, US
International Classification:
G06F 17/30
Abstract:
Subject matter described herein includes a multi-layer search-engine index. Accordingly, the search-engine index is divided into multiple indexes, each of which includes a respective set of information used to serve (i.e., respond to) a query. One index includes a term index, which organizes a set of terms that are found among a collection of documents. Another index includes a document index, which organizes a set of documents that are searchable. A computing device is used to serve the search-engine index (i.e., to analyze the index when identifying documents relevant to a search query). For example, a solid-state device might be used to serve the multi-layer search-engine index.
Intellectual Property Business Methods and Systems Information Technology, Internet and E-Commerce Intellectual Property Litigation Intellectual Property Management Licensing and IP Transactions Patent Litigation Patents
Jurisdiction:
Texas (2002)
Law School:
University of Virginia School of Law
Education:
University of Virginia School of Law, JD Duke University, BS
Microsoft since Jul 2012
Partner Development Manager
Microsoft - Bellevue, WA Mar 2012 - Jul 2012
Partner Development Manager
Microsoft - Bellevue, WA Sep 2011 - Feb 2012
Partner Development Lead
Microsoft Corporation Mar 2010 - Sep 2011
Principal Development Manager
Microsoft Corporation Jun 2009 - Mar 2010
Principal Development Lead
Education:
Stanford University Sep 1988 - Jun 1992
BS, Symbolic Systems
Skills:
Open Source Distributed Systems Search Engine Technology Performance Tuning Engineering Management Scalability Hadoop Natural Language Processing Algorithms Search Big Data Web Applications Cross Functional Team Leadership Software Design High Performance Computing Agile Methodologies Hbase Rest Apache Software Engineering Start Ups Architecture Cloud Computing Nosql System Architecture Information Retrieval Computer Science Data Mining Software Development Machine Learning Amazon Ec2 Mapreduce Amazon Web Services Business Intelligence Web Services Saas Text Mining Large Scale Systems Technical Leadership Multithreading Artificial Intelligence Architectures
2010 to 2000 Vice President of EngineeringIBM Austin, TX 2010 to 2010 Senior Software Engineering ManagerLOMBARDI SOFTWARE Austin, TX 2007 to 2010 Director of EngineeringAMAZON Seattle, WA 2005 to 2007 Senior Development Manager
Education:
VANDERBILT UNIVERSITY Nashville, TN 1999 Bachelor of Science in Computer Science
Angela Lenzmeier, Lauren Voneper, Rebecca Motycka, Diana Steinmeyer, Rebecca George, Natalie Warner, Ken Schwenke, Steven Cole, William Thompson, Joe Rick, Eric Ekeroth, Sarah Fox
Austin, TX Valparaiso, IN Nashville, TN Seattle, WA Cedar Park, TX
Work:
Socialware - Vice President of Engineering Trilogy Software InsuranceOrder.com Marsh Inc Amazon.com Lombardi Software IBM
Education:
Vanderbilt University, Chesterton High School
Relationship:
In_a_relationship
About:
Chad is responsible for the overall engineering direction and execution at Socialware. Before joining Socialware, he was the Director of Engineering at Lombardi where he built and ran a team in both A...
Chad Walters
Work:
Electrical Tech Services, Inc. - President
Education:
Texas A&M Universary - Information & Operations Management
Chad Walters
Education:
Hibbing High School, The College of St. Scholastica - Business Management
Chad Walters
About:
I am a Network Engineer and IT Specialist by trade. Always keeping up with the latest innovations, I received a Google+ Invite from a good colleague in hopes I can explore it for its technical offerin...