The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Oct. 06, 2009
Filed:
Nov. 27, 2002
Zhanliang (John) Chen, Sammamish, WA (US);
Christopher C. Mcconnell, Redmond, WA (US);
Igor I. Rondel, Redmond, WA (US);
Scott A. Thurlow, Kirkland, WA (US);
Siddhartha Cingh Arora, Redmond, WA (US);
Thomas D. White, Carnation, WA (US);
Tobin D. Baker, Kirkland, WA (US);
Zhanliang (John) Chen, Sammamish, WA (US);
Christopher C. McConnell, Redmond, WA (US);
Igor I. Rondel, Redmond, WA (US);
Scott A. Thurlow, Kirkland, WA (US);
Siddhartha Cingh Arora, Redmond, WA (US);
Thomas D. White, Carnation, WA (US);
Tobin D. Baker, Kirkland, WA (US);
Microsoft Corporation, Redmond, WA (US);
Abstract
A method and system for federated searching that includes receiving a user query a first location, extracting terms from the user query, assigning the query a ranking based on the terms, sending the user query to a second location for resolution if the ranking of the query meets a predetermined threshold, and receiving a response from the second location. The user query is parsed, normalized and ranked to determine if terms in the user query are relevant to the search facility of the second location. In order to make that ranking determination, data representative of the goods or services provided by the second location is provided to the first location by the second location. A data structure is built to allow an original value provided by the second location and the slot wherein the original value is expected to be indexed by all possible values for the original value by determining substantially all possible values for the original value. Relevant synsets are determined for the data, wherein terms within the synsets are associated to a term that was provided by the second location, and wherein a class of the data is preserved.