UPPER BOUNDS FOR MATCHING

• US 20140372410A1
• Filed: 06/14/2013
• Published: 12/18/2014
• Est. Priority Date: 06/14/2013
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: HUMPHREY, MATTHEW G., VED, NITIN
• Application Number:
  US13/917,802
• Publication Number:
  US 20140372410A1
• Time in Patent Office: Days
• US Class Current: 707/722
• CPC Class Codes: G06F 16/245 Query processing

Abstract

Methods, computer systems, and computer-storage media are provided for refining results. In order to display accurate counts for refinements, an upper bound may be assigned to the refinements such that one the upper bound is reached, counts no longer need to be generated for that refinement. This allows for more accurate counting of all of the refinements if dominating refinements are limited at an upper bound. Once the upper bound is reached, the refinement is no longer counted and the remaining time allowed to count refinements is utilized to count the remaining refinements.

Claims

1. One or more computer-storage media having computer-executable instructions embodied thereon that, when executed by one or more computing devices, perform a method of refining results, the method comprising:

identifying a plurality of refinements associated with a search query, wherein a refinement is an identifier that narrows the search query;

identifying an upper bound for each refinement of the plurality of refinements, wherein the upper bound is a predetermined maximum threshold of documents to identify as associated with at least one of the plurality of refinements; and

removing the at least one refinement of the plurality of refinements from the plurality of refinements once the upper bound is reached such that counts are no longer updated for the at least one refinement.

2. The media of claim 1, further comprising updating counts for each of the remaining plurality of refinements until a predetermined time period has elapsed.

3. The media of claim 1, further comprising displaying the counts for each of the plurality of refinements to a user.

4. The media of claim 1, further comprising displaying the counts for each of the plurality of refinements to a user in combination with search results associated with the search query.

5. The media of claim 1, wherein at least one of the plurality of refinements is a brand of an item.

6. The media of claim 1, wherein at least one of the plurality of refinements is a price range.

7. The media of claim 1, further comprising receiving a selection of at least one refinement of the plurality of refinements.

8. The media of claim 7, further comprising displaying narrowed refinement results in response to receiving the selection of the at least one refinement.

9. A system for refining results, the system comprising:

a computing device associated with a refining engine having one or more processors and one or more computer-storage media; and

a data store coupled with the refining engine,

wherein the refining engine;

identifies a plurality of refinements associated with a search query, wherein a refinement is an identifier that narrows the search query;

identifies an upper bound for each refinement of the plurality of refinements, wherein the upper bound is a predetermined maximum threshold of documents to identify as associated with at least one of the plurality of refinements; and

removes the at least one refinement of the plurality of refinements from the plurality of refinements once the upper bound is reached such that counts are no longer updated for the at least one refinement.

10. The system of claim 9, wherein the refining engine further updates counts for each of the plurality of refinements remaining until a predetermined time period has elapsed.

11. The system of claim 9, wherein the refining engine further displays the counts for each of the plurality of refinements to a user.

12. The system of claim 9, wherein the refining engine further displays the counts for each of the plurality of refinements to a user in combination with search results associated with the search query.

13. The system of claim 9, wherein at least one of the plurality of refinements is a brand of an item.

14. The method of claim 9, wherein at least one of the plurality of refinements is a price range.

15. The method of claim 9, wherein the refinement engine further receives a selection of at least one refinement of the plurality of refinements.

16. The method of claim 15, wherein the refinement engine further displays narrowed refinement results in response to receiving the selection of the at least one refinement.

17. One or more computer-storage media having computer-executable instructions embodied thereon that, when executed by one or more computing devices, perform a method of refining results, the method comprising:

receiving a search query input;

identifying a plurality of refinements associated with the search query, wherein a refinement is an identifier that narrows the search query;

identifying an upper bound for each refinement of the plurality of refinements, wherein the upper bound is a predetermined maximum threshold of items to identify as associated with at least one of the plurality of refinements;

removing at least one refinement of the plurality of refinements from the plurality of refinements to be counted when the upper bound is exceeded such that counts for the at least one refinement are no longer updated; and

updating counts for each of the remaining refinements until one of an expiration of a predetermined time period or exceeding the upper bound.

18. The media of claim 17, wherein a second refinement is removed from the plurality of refinements to be updated upon reaching the upper bound for the second refinement such that counts for the second refinement are no longer updated.

19. The media of claim 18, wherein each of the remaining refinements, excluding the at least one refinement and the second refinement, are updated until expiration of the predetermined time period.

20. The media of claim 17, wherein at least one of the plurality of refinements is a brand of an item.