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

1. 发明授权

US6052689A Computer method, apparatus and programmed medium for more efficient database management using histograms with a bounded error selectivity estimation 失效
标题翻译：计算机方法，设备和编程介质，用于使用具有有界误差选择性估计的直方图进行更有效的数据库管理
公开(公告)号：US6052689A
公开(公告)日：2000-04-18
申请号：US62589
申请日：1998-04-20
申请人： Shanmugavelayut Muthukrishnan , Viswanath Poosala , Torsten Suel
发明人： Shanmugavelayut Muthukrishnan , Viswanath Poosala , Torsten Suel
IPC分类号： G06F17/30
CPC分类号： G06F17/30536 , Y10S707/99932 , Y10S707/99942
摘要： A computer method, apparatus and programmed medium for optimizing the number of buckets, and thus minimizing the necessary amount of memory space, needed to construct a histogram of a data distribution contained within a computer database with a cumulative error bounded by a specified threshold. The method according to the present invention allows a user to determine the near-minimal memory space necessary to store an approximation of a database with a maximum error measure at most three times that specified by the user to allow the user to maximize computer resources.
摘要翻译：一种计算机方法，设备和编程介质，用于优化桶的数量，从而最小化必需的存储器空间量，以构成包含在具有由特定阈值限定的累积误差的计算机数据库内的数据分布的直方图。根据本发明的方法允许用户确定存储数据库近似值所需的近似最小存储器空间，其中最大误差量度最多为用户指定的三倍，以允许用户最大化计算机资源。

2. 发明授权

US06282533B1 System and method for performing I/O-efficient join processing 失效
标题翻译：用于执行I / O高效联接处理的系统和方法
公开(公告)号：US06282533B1
公开(公告)日：2001-08-28
申请号：US09164041
申请日：1998-09-30
申请人： Sridhar Ramaswamy , Torsten Suel
发明人： Sridhar Ramaswamy , Torsten Suel
IPC分类号： G06F1730
CPC分类号： G06F17/30498 , G06F17/30241 , Y10S707/957 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： I/O-efficient methods and apparatus are provided for the d-dimensional join problem in one, two, and three dimensions, and are also generalized for arbitrary higher dimensions. Let N be the total number of rectangles in the two sets to be joined, M the total amount of memory available, B the disk block size, and T the total number of pairs in the output of the join. Define n=N/B, m=M/B, and t=T/B. For one and two dimensions, I/O-optimal join methods are provided that run in O(nlogmn+t) I/O operations and have utility to temporal and spatial database systems. For dimensions d≧3, methods are provided that run in O(nlogm(d−1) n+t) I/O operations, which is within a logm(d−2)n factor of the currently known lower bounds.
摘要翻译：为一维，二维和三维的二维连接问题提供了I / O有效的方法和装置，并且也被推广用于任意更高的维度。令N为要连接的两组中的矩形总数，M为可用内存总量，B为磁盘块大小，T为连接输出中的总数。定义n = N / B，m = M / B，t = T / B。对于一维和二维，提供在O（nlogmn + t）I / O操作中运行的I / O最优连接方法，并且可用于时间和空间数据库系统。对于尺寸d> = 3，提供了运行在当前已知下限的log（d-2）n因子内的O（nlogm（d-1）n + t）I / O操作的方法。

3. 发明申请

US20110054999A1 SYSTEM AND METHOD FOR PREDICTING USER NAVIGATION WITHIN SPONSORED SEARCH ADVERTISEMENTS 审中-公开
标题翻译：在赞助的搜索广告中预测用户导航的系统和方法
公开(公告)号：US20110054999A1
公开(公告)日：2011-03-03
申请号：US12547473
申请日：2009-08-25
申请人： Joshua Attenberg , Sandeep Pandey , Torsten Suel
发明人： Joshua Attenberg , Sandeep Pandey , Torsten Suel
IPC分类号： G06Q30/00 , G06F17/30
CPC分类号： G06Q30/02 , G06F16/951 , G06Q30/0244 , G06Q30/0251 , G06Q30/0254
摘要： An improved system and method for predicting user navigation within sponsored search advertisements is provided. A list of sponsored advertisements for display on a web page of search results may be received. A click prediction classifier may be applied to predict a click probability of each sponsored advertisement and a dwell time prediction classifier may be applied to predict a dwell time probability on web pages of a website of each sponsored advertisement. A probability of user navigation may be predicted for each sponsored advertisement using a probability of a click on each sponsored advertisement and a probability of a dwell time on web pages of a website of each sponsored advertisement. The list of the sponsored advertisements may be ranked in part by the probability of user navigation and served to a web browser executing on a client device for display on a web page of search results.
摘要翻译：提供了一种用于在赞助的搜索广告中预测用户导航的改进的系统和方法。可以接收在搜索结果的网页上显示的赞助广告的列表。可以应用点击预测分类器来预测每个赞助广告的点击概率，并且可以应用停留时间预测分类器来预测每个赞助广告的网站的网页上的驻留时间概率。可以使用每个赞助广告点击的概率以及在每个赞助广告的网站的网页上的停留时间的概率来为每个赞助广告预测用户导航的概率。赞助广告的列表可以部分地被用户导航的概率排列并且被提供给在客户端设备上执行以在搜索结果的网页上显示的网络浏览器。

4. 发明申请

US20100082607A1 SYSTEM AND METHOD FOR AGGREGATING A LIST OF TOP RANKED OBJECTS FROM RANKED COMBINATION ATTRIBUTE LISTS USING AN EARLY TERMINATION ALGORITHM 审中-公开
标题翻译：使用早期终止算法从排名合并属性列表中聚集顶级排名对象列表的系统和方法
公开(公告)号：US20100082607A1
公开(公告)日：2010-04-01
申请号：US12238401
申请日：2008-09-25
申请人： Kunal Punera , Shanmugasundaram Ravikumar , Torsten Suel , Serguei Vassilvitskii
发明人： Kunal Punera , Shanmugasundaram Ravikumar , Torsten Suel , Serguei Vassilvitskii
IPC分类号： G06F7/10 , G06F17/30
CPC分类号： G06F16/358 , G06F16/9535
摘要： An improved system and method for aggregating a list of top ranked objects from ranked combination lists using an early termination algorithm is provided. Ranked lists of individual object attributes may be aggregated into ranked lists of combination object attributes. The ranked lists of object attributes, including ranked lists of individual object attributes as well as ranked lists of combination object attributes, may be scanned in parallel. A fixed number of top scoring objects may be stored in a results list of top ranked objects. An upper bound of best possible aggregation scores of unseen object in the ranked lists of object attributes may be computed to incorporate the extra information given by the combination lists of attributes. If the upper bound computed is less than the score of top scoring objects in the results list, then the top scoring objects in the results list may be output.
摘要翻译：提供了一种改进的系统和方法，用于使用早期终止算法聚合来自排名组合列表的顶级对象的列表。单个对象属性的排名列表可以聚合成组合对象属性的排名列表。可以平行扫描对象属性的排名列表，包括单个对象属性的排名列表以及组合对象属性的排名列表。固定数量的顶级评分对象可以存储在排名最高的对象的结果列表中。可以计算排序的对象属性列表中未被看见的对象的最佳可能聚集分数的上限，以包含属性组合列表给出的额外信息。如果计算的上限小于结果列表中的最高评分对象的得分，则可以输出结果列表中的最高评分对象。

5. 发明授权

US06377544B1 System and method for increasing the speed of distributed single and multi-commodity flow using second order methods 有权
标题翻译：使用二阶方法提高分布式单，多商品流速度的系统和方法
公开(公告)号：US06377544B1
公开(公告)日：2002-04-23
申请号：US09136819
申请日：1998-08-20
申请人： Shanmugavelayut Muthukrishnan , Torsten Suel
发明人： Shanmugavelayut Muthukrishnan , Torsten Suel
IPC分类号： H04L1226
CPC分类号： H04L45/10 , H04L45/38
摘要： A system and method for increasing the speed of flow of a quantity of data or of a plurality of data types through a communication system. The communication system comprises a plurality of switches including a source and a sink, each of the switches connected to a neighboring switch by a communication link having a capacity, each of the links having a pair of queue buffers, and one queue buffer of each pair of queue buffers is located at each switch connected by a link. For a single data type, a flow is computed for each link as a function of a last previous amount of flow across the same link. In the multi-data type case, a weighted queue difference is computed as a function of a last previous amount of flow between the same pair of queues and an amount of flow fi of said data type i is routed across each said link such that &Sgr;1≦i≦Kfi (&Dgr;′i(e)−fi) is maximized. In other embodiments of the invention, the system and method resolves the contention between different data types for the capacity of a communication link with and without a normalization factor, and adjusts flow so as not to exceed the capacity of a communication link or the amount of a data available to be routed by the sending queue buffer.
摘要翻译：一种用于通过通信系统增加数据量或多种数据类型的流量的系统和方法。通信系统包括多个交换机，包括源和接收器，每个交换机通过具有容量的通信链路连接到相邻交换机，每个链路具有一对队列缓冲器，以及每对的一个队列缓冲器队列缓冲区位于通过链路连接的每个交换机。对于单个数据类型，针对每个链路计算流量，作为跨过同一链路的最后一个流量的函数。在多数据类型的情况下，计算加权队列差异作为在同一对队列之间的最后一次流量的函数，并且所述数据类型i的流量fi的数量在每个所述链路上被路由使得SIGMA1 <= i <= Kfi（DELTA'i（e）-fi）被最大化。在本发明的其他实施例中，系统和方法解决了在具有和不具有规范化因素的通信链路的容量的不同数据类型之间的争用，并且调整流程以便不超过通信链路的容量或可用于由发送队列缓冲区路由的数据。

6. 发明授权

US06272498B1 Method for partitioning multi-dimensional data sets into rectangular partitions 有权
标题翻译：将多维数据集划分成矩形分区的方法
公开(公告)号：US06272498B1
公开(公告)日：2001-08-07
申请号：US09358517
申请日：1999-07-22
申请人： Shanmuugavelayut Muthukrishnan , Viswanath Poosala , Torsten Suel
发明人： Shanmuugavelayut Muthukrishnan , Viswanath Poosala , Torsten Suel
IPC分类号： G06F1730
CPC分类号： G06F17/30592 , G06Q40/00 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935 , Y10S707/99942 , Y10S707/99943 , Y10S707/99952
摘要： A method of using an algorithm to partition a multi-dimensional data set into a minimum number of rectangular-shaped partitions that can be processed more quickly than the non-partitioned data set while satisfying certain specified performance constraints.
摘要翻译：一种使用算法将多维数据集划分成最小数量的矩形分区的方法，其可以在满足某些指定的性能约束的情况下比非分区数据集更快地处理。

7. 发明授权

US6065007A Computer method, apparatus and programmed medium for approximating large databases and improving search efficiency 失效
标题翻译：用于近似大型数据库的计算机方法，设备和编程介质，提高搜索效率
公开(公告)号：US6065007A
公开(公告)日：2000-05-16
申请号：US71149
申请日：1998-04-28
申请人： Shanmugavelayut Muthukrishnan , Viswanath Poosala , Torsten Suel
发明人： Shanmugavelayut Muthukrishnan , Viswanath Poosala , Torsten Suel
IPC分类号： G06F17/30 , B06F17/00
CPC分类号： G06F17/30536 , Y10S707/99937 , Y10S707/99942
摘要： A novel and unique method, apparatus and programmed storage medium for approximating large data distributions of a database in order to allow a user to accurately analyze the entire data distribution using a limited amount of memory space in a reasonable amount of time. The approximation is based on partitioning the data domain into a number of regions, approximating each region using any well-known technique, and composing the errors of approximation to optimize suitable criteria for approximating the entire data distribution.
摘要翻译：一种用于近似数据库的大数据分布的新颖且独特的方法，装置和编程存储介质，以便允许用户在合理的时间量内使用有限量的存储器空间来准确地分析整个数据分布。该近似是基于将数据域划分成多个区域，使用任何公知技术近似每个区域，并且组合近似误差以优化用于近似整个数据分布的合适标准。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式