专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明申请

US20080114672A1 METHOD AND SYSTEM FOR BIDDING ON ADVERTISEMENTS 审中-公开
标题翻译：招标广告的方法和制度
公开(公告)号：US20080114672A1
公开(公告)日：2008-05-15
申请号：US11734294
申请日：2007-04-12
申请人： Sihem Amer Yahia , Raghu Ramakrishnan , Michael Schwarz , Jayavel Shanmugasundaram , Andrew Tomkins
发明人： Sihem Amer Yahia , Raghu Ramakrishnan , Michael Schwarz , Jayavel Shanmugasundaram , Andrew Tomkins
IPC分类号： G06Q40/00
CPC分类号： G06Q30/02 , G06Q40/04
摘要： A system and method for bidding on advertisements. The system includes a query engine and an advertisement engine. The query engine receives a query from the user. The query engine analyzes the query to determine a query intent that is matched to a predetermined domain. A translated query is generated including the domain type. Once a domain is selected, the query may be further analyzed to determine generic domain information. The domain and associated information may then be matched to a list of advertisements. The advertisement may be assigned a score based on a bid price and a quality of the advertisement.
摘要翻译：广告投标系统和方法。该系统包括查询引擎和广告引擎。查询引擎从用户接收查询。查询引擎分析查询以确定与预定域匹配的查询意图。生成包含域类型的翻译查询。一旦选择了域，则可以进一步分析查询以确定通用域信息。然后可以将域和相关联的信息与广告列表进行匹配。该广告可以基于投标价格和广告的质量而被分配。

52. 发明授权

US07016915B2 Method for processing XML queries over relational data and meta-data using a relational database system 失效
标题翻译：使用关系数据库系统处理关系数据和元数据的XML查询的方法
公开(公告)号：US07016915B2
公开(公告)日：2006-03-21
申请号：US10331740
申请日：2002-12-28
申请人： Jayavel Shanmugasundaram , Eugene Jon Shekita
发明人： Jayavel Shanmugasundaram , Eugene Jon Shekita
IPC分类号： G06F17/30
CPC分类号： G06F17/30917 , G06F17/30929 , Y10S707/954 , Y10S707/99943
摘要： A system, method, and computer program product for processing XML queries over relational data and meta-data using a relational database system. The invention runs a query to generate a view definition, so a regular query processor can handle queries on a mix of data and meta-data. Names of desired tables are data-dependent, so the invention represents a default XML view as an XML query over the relational tables, gets the table names and table data by recursively invoking the query processor (first by querying the catalog table, and then querying base data according to a new construct). The invention thus processes queries over table names in addition to table values.
摘要翻译：用于使用关系数据库系统处理关系数据和元数据的XML查询的系统，方法和计算机程序产品。本发明运行查询以生成视图定义，因此常规查询处理器可以处理对数据和元数据的混合的查询。所需表的名称依赖于数据，因此本发明将XML视图作为关系表的XML查询表示，通过递归调用查询处理器来获取表名和表数据（首先通过查询目录表，然后查询基础数据根据新的构造）。因此，本发明除了表值之外处理对表名的查询。

53. 发明授权

US06934712B2 Tagging XML query results over relational DBMSs 失效
标题翻译：在关系数据库管理系统上标记XML查询结果
公开(公告)号：US06934712B2
公开(公告)日：2005-08-23
申请号：US09810167
申请日：2001-03-19
申请人： Gerald George Kiernan , Jayavel Shanmugasundaram , Eugene Jon Shekita
发明人： Gerald George Kiernan , Jayavel Shanmugasundaram , Eugene Jon Shekita
IPC分类号： G06F17/30
CPC分类号： G06F17/30917 , G06F17/30595 , G06F17/30932 , G06F17/30941 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99943
摘要： A method for publishing relational data as XML by translating XML queries into queries against a relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables. The intermediate representation is also used to generate a tagger graph, which the tagger runtime ‘walks’ to generate the tagged, structured XML output. Each of the nodes of the tagger graph are operators which perform processing on the results of the SQL query. The SQL query is executed, and the SQL query results are then provided to the tagger. The tagger runtime applies the operators of each node to the inputs at that node to produce the structured XML document as a query result, guided by the structure of the tagger graph.
摘要翻译：通过将XML查询转换为关系数据库的查询来将关系数据发布为XML的方法。不需要将关系数据库转换为XML数据库。每个关系表映射到一个虚拟XML文档，并通过这些虚拟文档发出XML查询。解析XML查询并将其转换为语言中立的中间表示，它是描述输出文档如何从底层关系表导出的操作序列。然后将中间表示形式转换为基础关系表中的SQL查询。中间表示也用于生成标记图，标记运行时“走”来生成标记的结构化XML输出。标记图中的每个节点都是对SQL查询结果执行处理的操作符。执行SQL查询，然后将SQL查询结果提供给标记器。标记运行时将每个节点的运算符应用于该节点的输入，以便通过标记器图的结构来指导结构化的XML文档作为查询结果。

54. 发明授权

US06721730B2 Left outer join elimination on key 失效
标题翻译：关键的左外连接消除
公开(公告)号：US06721730B2
公开(公告)日：2004-04-13
申请号：US09887582
申请日：2001-06-21
申请人： Gerald George Kiernan , Jayavel Shanmugasundaram
发明人： Gerald George Kiernan , Jayavel Shanmugasundaram
IPC分类号： G06F1730
CPC分类号： G06F17/30454 , Y10S707/99933 , Y10S707/99934
摘要： A query optimization technique that determines whether any column from a right quantifier of a left outer join query is projected out of the query. If not, then all predicates in an ON clause are removed from the left outer join query, the right quantifier is removed from the left outer join query, and the left outer join query is converted to a simple select query. A number of steps are performed to determine whether any of the columns quantified by the right quantifier participate in a projection list of the query. A set of equivalence class columns is computed for the query, wherein the equivalence classes are derived from equi-join predicates in the query. A set of columns quantified by the right quantifier across the computed set of equivalence classes is computed. A determination is made whether a subset of the set of columns form a key for the right quantifier. If the right quantifier columns are not projected out of the query, then the optimization may be performed.
摘要翻译：一种查询优化技术，用于确定来自左侧外部连接查询的右侧定量器的任何列是否从该查询中投射出来。如果没有，那么ON子句中的所有谓词将从左外连接查询中删除，右侧的量词会从左外连接查询中删除，左外连接查询将转换为简单的选择查询。执行多个步骤以确定由右侧量词库量化的任何列是否参与查询的投影列表。为查询计算一组等价类列，其中等价类是从查询中的等连接谓词导出的。计算通过所计算的等价类集合的正确量词量化的一组列。确定一组列的一个子集是否形成正确的量词的键。如果正确的量词列不会从查询中投射出来，则可以执行优化。

55. 发明授权

US06633882B1 Multi-dimensional database record compression utilizing optimized cluster models 有权
标题翻译：利用优化的集群模型进行多维数据库记录压缩
公开(公告)号：US06633882B1
公开(公告)日：2003-10-14
申请号：US09606964
申请日：2000-06-29
申请人： Usama Fayyad , Jayavel Shanmugasundaram
发明人： Usama Fayyad , Jayavel Shanmugasundaram
IPC分类号： G06F1730
CPC分类号： G06F17/30592 , Y10S707/99936 , Y10S707/99942
摘要： Apparatus and method for use in querying a database containing data records. The database is characterized by a compression scheme to provide data clustering information. In accordance with a exemplary embodiment of the invention a functional representation of data clustering is a Gaussian and the queries are performing by integrating the Gaussian corresponding to each of the data clusters over the ranges to determine the sum or the count of data records from the database that fall within the selected ranges. The process chooses a value for the cluster number K. The cluster model is next broken up into areas (tiles) based on user defined parameters. Data from the database is then classified based on the tiling information. A sorted version of the classified data, ordered by cluster number and then by the tile number within the cluster is generated. This data is then evaluated to test the sufficiency of the model created during the clustering.
摘要翻译：用于查询包含数据记录的数据库的装置和方法。数据库的特征在于提供数据聚类信息的压缩方案。根据本发明的示例性实施例，数据聚类的功能表示是高斯，并且通过在范围上对与每个数据集合相对应的高斯进行积分来执行查询，以确定来自数据库的数据记录的和或计数在所选范围内。该过程选择簇号K的值。根据用户定义的参数，将聚类模型分解为区域（瓦片）。然后根据平铺信息对来自数据库的数据进行分类。生成分类数据的排序版本，按簇号排序，然后由群集中的瓦片号排序。然后评估该数据以测试在聚类期间创建的模型的充分性。

56. 发明授权

US06549907B1 Multi-dimensional database and data cube compression for aggregate query support on numeric dimensions 有权
标题翻译：多维数据库和数据立方体压缩，用于在数字维度上的聚合查询支持
公开(公告)号：US06549907B1
公开(公告)日：2003-04-15
申请号：US09296831
申请日：1999-04-22
申请人： Usama Fayyad , Jayavel Shanmugasundaram
发明人： Usama Fayyad , Jayavel Shanmugasundaram
IPC分类号： G06F1730
CPC分类号： G06F17/30489 , G06F17/30324 , G06F17/30592 , G06F17/30598 , Y10S707/99933 , Y10S707/99942 , Y10S707/99953
摘要： An apparatus and method for efficiently compressing contents of a database system to support ad hoc querying and OLAP type aggregation queries. This invention consists of a new compressed representation of the data cube that (a) drastically reduces storage requirements, (b) does not require the discretization hierarchy along each query dimension to be fixed beforehand and (c) treats each dimension as a potential target measure and supports multiple aggregation functions without additional storage costs. The tradeoff is approximate, yet relatively accurate, answers to queries. We outline mechanisms to reduce the error in the approximation. Our performance evaluation indicates that our compression technique effectively addresses the limitation of existing approaches. The basic method relies on representing the contents of the database by a probability distribution consisting of a mixture of Gaussians. Aggregation queries, be they multi-dimensional, conjunctive, or disjunctive, can be answered by performing integration over the probability distribution.
摘要翻译：一种用于高效地压缩数据库系统的内容以支持即席查询和OLAP类型聚合查询的装置和方法。本发明由数据立方体的新的压缩表示形式组成，（a）大大减少存储需求，（b）不需要预先固定每个查询维度的离散化层级，并且（c）将每个维度视为潜在的目标度量并支持多个聚合功能，无需额外的存储成本。权衡是大概的，但相对准确的是查询的答案。我们概述了减少近似误差的机制。我们的绩效评估表明，我们的压缩技术有效地解决了现有方法的局限性。基本方法依赖于通过由高斯混合组成的概率分布来表示数据库的内容。可以通过对概率分布进行集成来回答聚合查询（无论是多维的，连接的还是分离的）。

57. 发明申请

US20120054027A1 NETWORK BASED ADVERTISEMENT SYSTEM 审中-公开
标题翻译：基于网络的广告系统
公开(公告)号：US20120054027A1
公开(公告)日：2012-03-01
申请号：US12871240
申请日：2010-08-30
申请人： Randolph Preston McAfee , Vijay Krishna Narayanan , Jayavel Shanmugasundaram , Rajesh G. Parekh
发明人： Randolph Preston McAfee , Vijay Krishna Narayanan , Jayavel Shanmugasundaram , Rajesh G. Parekh
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0251
摘要： A network based advertisement system includes an optimizer configured to forecast a supply of opportunities, forecast a supply of guaranteed contracts, and forecast a supply of non-guaranteed contracts. Each opportunity represents a user visiting a webpage. Each guaranteed contract guarantees the matching of an advertisement to a number of opportunities. Each non-guaranteed contract guarantees a user event associated with an advertisement. The optimizer then generates a plan for matching contracts to opportunities based on the forecasted supply of opportunities, the forecasted supply of guaranteed contracts, the forecasted supply of non-guaranteed contracts, and an objective function that balances a group of parameters that define the representativeness of contracts, a cost associated with not serving non-guaranteed contracts, and performance objectives associated with contracts.
摘要翻译：基于网络的广告系统包括优化器，其被配置为预测机会供应，预测保证合同的供应以及预测非保证合同的供应。每个机会代表访问网页的用户。每个保证合同保证广告与许多机会的匹配。每个非保证合同保证与广告相关联的用户事件。然后，优化者根据预测的机会供应，预期的保证合同供应，预期的无担保合同供应，以及平衡一组定义代表性的参数的目标函数，生成一个将契约与机会相匹配的计划。合同，与服务非保证合同相关的成本以及与合同相关的业绩目标。

58. 发明申请

US20120004981A1 ADVERTISEMENT AND CAMPAIGN EVALUATION WITH BUCKET TESTING IN GUARANTEED DELIVERY OF ONLINE ADVERTISING 审中-公开
标题翻译：在线广告的担保交付中的BUCKET测试的广告和考核评估
公开(公告)号：US20120004981A1
公开(公告)日：2012-01-05
申请号：US12830137
申请日：2010-07-02
申请人： Tarun Bhatia , Jayavel Shanmugasundaram
发明人： Tarun Bhatia , Jayavel Shanmugasundaram
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0243
摘要： Techniques are provided relating to conducting bucket testing, relating to advertisement performance or advertisement campaign performance, in connection with guaranteed delivery online advertising associated with an online advertising marketplace. Techniques are provided in which advertising supply, demand, or both are partitioned into buckets. Differing allocation policies are established for each of the buckets. Following serving of advertisements in accordance with the operating policies, difference is measured, between the buckets, and the difference is used to evaluate differing advertisement performance or differing advertisement campaign performance between the buckets.
摘要翻译：提供了涉及与在线广告市场相关联的保证传递在线广告的涉及广告演奏或广告活动性能的桶测试的技术。提供了将广告供应，需求或两者分为桶的技术。为每个桶建立不同的分配策略。在根据运营政策提供广告之后，差异在桶之间进行测量，差异用于评估桶之间的不同广告效果或不同的广告活动性能。

59. 发明申请

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

60. 发明授权

US07890494B2 System and/or method for processing events 有权
标题翻译：用于处理事件的系统和/或方法
公开(公告)号：US07890494B2
公开(公告)日：2011-02-15
申请号：US11932928
申请日：2007-10-31
申请人： Erik N. Vee , Minos Garofalakis , Jayavel Shanmugasundaram , Ashwin Kumar V Machanavajjhala
发明人： Erik N. Vee , Minos Garofalakis , Jayavel Shanmugasundaram , Ashwin Kumar V Machanavajjhala
IPC分类号： G06F17/30
CPC分类号： G06F17/30533
摘要： The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree.
摘要翻译：本文公开的主题涉及处理关于事件的信息。在一个特定示例中，可以响应于事件来制定刺戳查询。一个或多个集合与树的节点相关联和/或映射到树的节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式