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:
Jul. 24, 2012
Filed:
Feb. 26, 2010
Marcus Fontoura, Mountain View, CA (US);
Suhas Sadanandan, Sunnyvale, CA (US);
Jayavel Shanmugasundaram, Santa Clara, CA (US);
Sergei Vassilvitskii, New York, NY (US);
Erik Vee, San Mateo, CA (US);
Srihari Venkatesan, Sunnyvale, CA (US);
Jason Zien, Mountain View, CA (US);
Marcus Fontoura, Mountain View, CA (US);
Suhas Sadanandan, Sunnyvale, CA (US);
Jayavel Shanmugasundaram, Santa Clara, CA (US);
Sergei Vassilvitskii, New York, NY (US);
Erik Vee, San Mateo, CA (US);
Srihari Venkatesan, Sunnyvale, CA (US);
Jason Zien, Mountain View, CA (US);
Yahoo! Inc., Sunnyvale, CA (US);
Abstract
An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.