公开(公告)号：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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：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合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。 具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。 合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

公开(公告)号：US20100082542A1

公开(公告)日：2010-04-01

申请号：US12242502

申请日：2008-09-30

申请人： Andrew Feng ,  Rohit Chandra ,  Srihari Venkatesan

发明人： Andrew Feng ,  Rohit Chandra ,  Srihari Venkatesan

IPC分类号： G06F17/30

CPC分类号： G06Q30/02

摘要： The subject matter disclosed herein relates to initiating a comparison of a source snapshot including current source advertising data with a destination snapshot including current destination advertising data taken at the same logical time as such a source snapshot.

摘要翻译： 本文公开的主题涉及启动包括当前源广告数据与目的地快照的源快照的比较，该目的地快照包括在与这样的源快照相同的逻辑时间拍摄的当前目的地广告数据。