公开(公告)号：US08229933B2

公开(公告)日：2012-07-24

申请号：US12714142

申请日：2010-02-26

申请人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

发明人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

IPC分类号： G06F7/00

CPC分类号： G06Q30/08

摘要： 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.

摘要翻译： 库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。 通过合同索引​​处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。 接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：US20110213767A1

公开(公告)日：2011-09-01

申请号：US12714142

申请日：2010-02-26

申请人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

发明人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

IPC分类号： G06F17/30

CPC分类号： G06Q30/08

摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. 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 the 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.

摘要翻译： 使用固定长度的复合谓词表示自动匹配合同到库存的方法。 库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。 通过合同索引​​处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。 接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：US20110213660A1

公开(公告)日：2011-09-01

申请号：US12714051

申请日：2010-02-26

申请人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

发明人： Marcus Fontoura ,  Suhas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

IPC分类号： G06Q30/00 ,  G06N5/02

CPC分类号： G06Q30/02 ,  G06Q30/0254

摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. 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 the 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.

摘要翻译： 使用固定长度的复合谓词表示自动匹配合同到库存的方法。 库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。 通过合同索引​​处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。 接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：US20110213659A1

公开(公告)日：2011-09-01

申请号：US12714046

申请日：2010-02-26

申请人： Marcus Fontoura ,  Subas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

发明人： Marcus Fontoura ,  Subas Sadanandan ,  Jayavel Shanmugasundaram ,  Sergei Vassilvitskii ,  Erik Vee ,  Srihari Venkatesan ,  Jason Zien

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0254 ,  G06Q30/0273

摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. 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 the 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.

摘要翻译： 使用固定长度的复合谓词表示自动匹配合同到库存的方法。 库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。 通过合同索引​​处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。 接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：US20110225038A1

公开(公告)日：2011-09-15

申请号：US12724415

申请日：2010-03-15

申请人： Marcus Fontoura ,  Jayavel Shanmugasundaram ,  Serguel Vassilvitskii ,  Erik Vee ,  Jason Zien

发明人： Marcus Fontoura ,  Jayavel Shanmugasundaram ,  Serguel Vassilvitskii ,  Erik Vee ,  Jason Zien

IPC分类号： G06F17/30 ,  G06Q30/00

CPC分类号： G06Q30/0251 ,  G06F16/24561 ,  G06Q30/02

摘要： An improved system and method for efficiently evaluating complex Boolean expressions is provided. Leaf nodes of Boolean expression trees for objects represented by Boolean expressions of attribute-value pairs may be assigned a positional identifier that indicates the position of a node in the Boolean expression tree. The positional identifiers of each object may be indexed by attribute-value pairs of the leaf nodes of the Boolean expression trees in an inverted index. Given an input set of attribute-value pairs, a list of positional identifiers for leaf nodes of virtual Boolean expression trees may be found in the index matching the attribute-value pairs of the input set. The list of positional identifiers of leaf nodes may be sorted in order by positional identifier for each contract. An expression evaluator may then verify whether a virtual Boolean expression tree for each contract is satisfied by the list of positional identifiers.

摘要翻译： 提供了一种用于有效评估复杂布尔表达式的改进的系统和方法。 可以为布尔表达式树中的节点的位置分配位置标识符，该对象由布尔值属性值对表示的对象的布尔表达式树的叶节点分配。 每个对象的位置标识符可以由反向索引中的布尔表达式树的叶节点的属性值对索引。 给定属性值对的输入集合，可以在匹配输入集合的属性值对的索引中找到虚拟布尔表达式树的叶节点的位置标识符的列表。 叶节点的位置标识符的列表可以按照每个合同的位置标识符按顺序排序。 然后，表达式求值器可以验证每个契约的虚拟布尔表达式树是否被位置标识符列表所满足。

公开(公告)号：US20110208559A1

公开(公告)日：2011-08-25

申请号：US12711873

申请日：2010-02-24

申请人： Marcus Fontoura ,  Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Andrei Broder ,  Shirshanka Das ,  Bhaskar Ghosh ,  Vanja Josifovski

发明人： Marcus Fontoura ,  Sergei Vassilvitskii ,  Jayavel Shanmugasundaram ,  Andrei Broder ,  Shirshanka Das ,  Bhaskar Ghosh ,  Vanja Josifovski

IPC分类号： G06Q10/00 ,  G06Q50/00 ,  G06T11/20

CPC分类号： G06Q30/02 ,  G06Q10/06316 ,  G06Q30/0201 ,  G06T11/206

摘要： Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable.

摘要翻译： 在广告服务器网络中自动管理网络发布者 - 订户关系。 该方法包括用于构建包括至少一个发布者节点（例如，因特网属性），至少一个订户节点（例如，因特网广告商），至少一个中间节点（例如，因特网广告代理）以及在 至少一个边缘（例如，广告目标谓词），其中边缘中的任何一个与至少一个目标谓词直接相关联。 有向图表示与用于检索仅包括至少一个与至少一个事件谓词匹配的目标谓词的节点的有效节点列表结合使用。 事件谓词（以及任何目标谓词）是任意复杂的布尔表达式，并且用于生成结果节点列表，其中仅包含与广告目标谓词并发匹配事件谓词并且可访问的节点。

公开(公告)号：US20070282829A1

公开(公告)日：2007-12-06

申请号：US11840881

申请日：2007-08-17

申请人： Marcus Fontoura ,  Reiner Kraft ,  Tony Leung ,  John McPherson ,  Andreas Neumann ,  Runping Qi ,  Sridhar Rajagopalan ,  Eugene Shekita ,  Jason Zien

发明人： Marcus Fontoura ,  Reiner Kraft ,  Tony Leung ,  John McPherson ,  Andreas Neumann ,  Runping Qi ,  Sridhar Rajagopalan ,  Eugene Shekita ,  Jason Zien

IPC分类号： G06F17/30

CPC分类号： G06F17/30864 ,  Y10S707/99931 ,  Y10S707/99943

摘要： Disclosed is a technique for building an index. A new indexi+1 is built and an anchor text tablei+1 and a duplicates tableti+1 are output using a storesi, a delta store, and previously generated global analysis computationsi, wherein the previously generated global analysis computationsi include an anchor text tablei, a rank tablei, and a duplicates tablei. New global analysis computationsi+1 are generated using the anchor text tablei+1, the duplicates tablei+1, and the previously generated global analysis computationsi.

摘要翻译： 公开了一种构建索引的技术。 构建新的索引 1 + 1 ，并且使用存储 1输出锚文本表 1 + 1 增量存储和先前生成的全局分析计算，其中先前生成的全局分析计算包括锚文本表 i ，一个等级表和一个复制表。 新的全局分析计算 1 + 1 使用锚文本表 1 + 1 ，复制表 1 + 1> 全局分析计算。