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

91. 发明授权

US08752100B2 Systems and methods for distributing video on demand 有权
标题翻译：按需分发视频的系统和方法
公开(公告)号：US08752100B2
公开(公告)日：2014-06-10
申请号：US12201844
申请日：2008-08-29
申请人： Kadangode Ramakrishnan , Rittwik Jana , Divesh Srivastava , Vijay Gopalakrishnan , Samrat Bhattacharjee
发明人： Kadangode Ramakrishnan , Rittwik Jana , Divesh Srivastava , Vijay Gopalakrishnan , Samrat Bhattacharjee
IPC分类号： H04N7/173
CPC分类号： H04N21/458 , H04N7/17318 , H04N21/262 , H04N21/4331 , H04N21/47202 , H04N21/4788 , H04N21/4856 , H04N21/6405 , H04N21/6408
摘要： A method of receiving content includes joining an in-progress multicast stream to receive a first portion of a content. The method further includes sending a request to a peer for a catch-up portion of the content, the request including a deadline for delivery of the content, and receiving the catch-up portion of the content from the peer prior to the deadline.
摘要翻译：接收内容的方法包括加入正在进行的多播流以接收内容的第一部分。所述方法还包括向所述对等体发送对所述内容的追赶部分的请求，所述请求包括用于传送内容的截止日期，以及在截止日期之前从对等体接收内容的追赶部分。

92. 发明授权

US08649382B2 Methods and systems for content access and distribution 有权
标题翻译：内容访问和分发的方法和系统
公开(公告)号：US08649382B2
公开(公告)日：2014-02-11
申请号：US12575016
申请日：2009-10-07
申请人： Kadangode Ramakrishnan , William Fenner , Michael Rabinovich , Divesh Srivastava , Yin Zhang
发明人： Kadangode Ramakrishnan , William Fenner , Michael Rabinovich , Divesh Srivastava , Yin Zhang
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L67/02 , H04L67/104 , H04L67/1097 , H04L67/12
摘要： Distribution of content between publishers and consumers is accomplished using an overlay network that may make use of XML language to facilitate content identification. The overlay network includes a plurality of routers that may be in communication with each other and the publishers and consumers on the Internet. Content and queries are identified by content descriptors that are routed from the originator to a nearest router in the overlay network. The nearest router, for each unique content descriptor, generates a hash identification of the content descriptor which is used by remaining routers in the overlay network to provide the appropriate functions with respect to the content descriptor. In particular, this allows all routers in the overlay network except the nearest router to properly route content without processing every content descriptor.
摘要翻译：发布商和消费者之间的内容分发是通过覆盖网络实现的，该网络可以利用XML语言来促进内容识别。覆盖网络包括可以彼此通信的多个路由器以及因特网上的发布者和消费者。内容和查询由从发起者路由到覆盖网络中最近的路由器的内容描述符来标识。对于每个唯一的内容描述符，最近的路由器生成内容描述符的散列标识符，该标识由覆盖网络中的剩余路由器使用以提供关于内容描述符的适当的功能。特别地，这允许除了最近的路由器之外的覆盖网络中的所有路由器正确路由内容而不处理每个内容描述符。

93. 发明授权

US08649377B2 Methods and systems to store state used to forward multicast traffic 失效
标题翻译：存储用于转发组播流量的状态的方法和系统
公开(公告)号：US08649377B2
公开(公告)日：2014-02-11
申请号：US13277865
申请日：2011-10-20
申请人： Kadangode Ramakrishnan , Divesh Srivastava , Tae W. Cho , Yin Zhang , Michael Rabinovich
发明人： Kadangode Ramakrishnan , Divesh Srivastava , Tae W. Cho , Yin Zhang , Michael Rabinovich
IPC分类号： H04L12/28
CPC分类号： H04L12/1886 , H04L45/16 , H04L45/48
摘要： A method and system are described to multicast with an adaptive dual state. The system receives multicast traffic over a membership tree including a first plurality of nodes connected in a first topology destined for a plurality of multicast members of a first multicast group. Next, the system determines a rate of multicast traffic that exceeds a predetermined threshold based on the receiving the multicast traffic. Next, the system generates a dissemination tree including a second plurality of nodes connected in a second topology to reduce a number of hops to communicate the multicast traffic to the plurality of multicast members of the first multicast group. Finally, the system forwards the multicast traffic to the plurality of multicast members of the first multicast group over the dissemination tree.
摘要翻译：一种方法和系统被描述为具有自适应双状态的多播。系统通过隶属树接收组播流量，该成员树包括连接在第一个拓扑中的第一个多个节点，目的地是第一组播组的多个组播成员。接下来，系统基于接收到多播业务来确定超过预定阈值的多播业务速率。接下来，系统生成包括在第二拓扑中连接的第二多个节点的传播树，以减少将多播流量传送到第一多播组的多个多播成员的跳数。最后，系统通过传播树将组播流量转发给第一组播组的多个组播成员。

94. 发明授权

US08463768B2 Method and apparatus for using tag topology 有权
标题翻译：使用标签拓扑的方法和装置
公开(公告)号：US08463768B2
公开(公告)日：2013-06-11
申请号：US13620465
申请日：2012-09-14
申请人： Divesh Srivastava , Suresh Venkatasubramanian
发明人： Divesh Srivastava , Suresh Venkatasubramanian
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30861 , G06F17/30283 , G06F17/30864 , G06F17/30882 , G06F17/30997
摘要： A method and apparatus for using tag topology for enhancing search capabilities, e.g., searching over the web, are disclosed. For example, the present method receives a user query contain a search term from a user. The method then generates a search result containing at least one entity, wherein the at least one entity is found based on a plurality of user provided tags that is associated with the at least one entity.
摘要翻译：公开了一种使用标签拓扑来提高搜索能力的方法和装置，例如在网上搜索。例如，本方法从用户接收包含搜索项的用户查询。该方法然后生成包含至少一个实体的搜索结果，其中基于与至少一个实体相关联的多个用户提供的标签来找到至少一个实体。

95. 发明授权

US08316000B2 Method and apparatus for using tag topology 有权
标题翻译：使用标签拓扑的方法和装置
公开(公告)号：US08316000B2
公开(公告)日：2012-11-20
申请号：US11608142
申请日：2006-12-07
申请人： Divesh Srivastava , Suresh Venkatasubramanian
发明人： Divesh Srivastava , Suresh Venkatasubramanian
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30861 , G06F17/30283 , G06F17/30864 , G06F17/30882 , G06F17/30997
摘要： A method and apparatus for using tag topology for enhancing search capabilities, e.g., searching over the web, are disclosed. For example, the present method receives a user query contain a search term from a user. The method then generates a search result containing at least one entity, wherein the at least one entity is found based on a plurality of user provided tags that is associated with the at least one entity.
摘要翻译：公开了一种使用标签拓扑来提高搜索能力的方法和装置，例如在网上搜索。例如，本方法从用户接收包含搜索项的用户查询。该方法然后生成包含至少一个实体的搜索结果，其中基于与至少一个实体相关联的多个用户提供的标签来找到至少一个实体。

96. 发明授权

US08176036B2 Join paths across multiple databases 有权
标题翻译：连接多个数据库的路径
公开(公告)号：US08176036B2
公开(公告)日：2012-05-08
申请号：US12605038
申请日：2009-10-23
申请人： Divesh Srivastava , Ioannis Kotidis
发明人： Divesh Srivastava , Ioannis Kotidis
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30442 , Y10S707/99933
摘要： Methods, systems and computer instructions on computer readable media are disclosed for optimizing a query, including a first join path, a second join path, and an optimizer, to efficiently provide high quality information from large, multiple databases. The methods and systems include evaluating a schema graph identifying the join paths between a field X and a field Y, and a value X=x, to identify the top-few values of Y=y that are reachable from a specified X=x value when using the join paths. Each data path that instantiates the schema join paths can be scored and evaluated as to the quality of the data with respect to specified integrity constraints to alleviate data quality problems. Agglomerative scoring methodologies can be implemented to compute high quality information in the form of a top-few answers to a specified problem as requested by the query.
摘要翻译：公开了用于优化包括第一连接路径，第二连接路径和优化器的查询的方法，系统和计算机指令，以有效地从大型多个数据库提供高质量信息。方法和系统包括评估标识场X和场Y之间的连接路径的模式图，以及值X = x，以识别从指定的X = x值可达到的Y = y的最低值当使用连接路径时。实例化模式连接路径的每个数据路径可以根据指定的完整性约束对数据的质量进行评分和评估，以减轻数据质量问题。可以实施聚集评分方法，以按照查询请求的特定问题的最佳答案形式计算高质量信息。

97. 发明申请

US20120036136A1 SECURING DATABASE CONTENT 有权
标题翻译：安全数据库内容
公开(公告)号：US20120036136A1
公开(公告)日：2012-02-09
申请号：US12852017
申请日：2010-08-06
申请人： Divesh Srivastava , Su Chen , Xin Dong , V. S. Lakshmanan
发明人： Divesh Srivastava , Su Chen , Xin Dong , V. S. Lakshmanan
IPC分类号： G06F17/30
CPC分类号： G06F17/30424 , G06F17/30289 , G06F17/30297 , G06F17/30303
摘要： A method for securing content in a database includes identifying a challenge column associated with a database column referenced in an update query. A challenge value for the challenge column may be received and resolved for a match with a corresponding value stored in the challenge column. In case of a match, the update query may be certified for execution on the database, otherwise, the update query may be prevented from executing. Challenge columns may be determined by an analysis of the database on the basis of discriminating power, description complexity, and/or diversity.
摘要翻译：用于保护数据库中的内容的方法包括识别与更新查询中引用的数据库列相关联的挑战列。可以接收并解决与挑战列中存储的对应值的匹配的挑战列的挑战值。在匹配的情况下，可以认证更新查询以在数据库上执行，否则可以防止更新查询执行。挑战列可以通过基于区分力，描述复杂度和/或多样性的数据库分析来确定。

98. 发明申请

US20110321169A1 Generating Minimality-Attack-Resistant Data 有权
标题翻译：生成最小 - 抗攻击数据
公开(公告)号：US20110321169A1
公开(公告)日：2011-12-29
申请号：US12825466
申请日：2010-06-29
申请人： Graham Cormode , Tiancheng Li , Divesh Srivastava
发明人： Graham Cormode , Tiancheng Li , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F21/6254
摘要： The present disclosure is directed to systems, methods, and computer-readable storage media for generating data and data sets that are resistant to minimality attacks. Data sets having a number of tuples are received, and the tuples are ordered according to an aspect of the tuples. The tuples can be split into groups of tuples, and each of the groups may be analyzed to determine if the group complies with a privacy requirement. Groups that satisfy the privacy requirement may be output as new data sets that are resistant to minimality attacks.
摘要翻译：本公开涉及用于生成抵御最低限度攻击的数据和数据集的系统，方法和计算机可读存储介质。接收到具有多个元组的数据集，并且元组根据元组的一个方面被排序。元组可以分为组元组，并且可以分析每个组以确定组是否符合隐私要求。满足隐私要求的组可以作为抵抗最低限度攻击的新数据集输出。

99. 发明授权

US08024346B2 Method and apparatus for ranked join indices 有权
标题翻译：排名连接索引的方法和装置
公开(公告)号：US08024346B2
公开(公告)日：2011-09-20
申请号：US12647490
申请日：2009-12-26
申请人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
发明人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99942
摘要： A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.
摘要翻译：用于分级连接索引的方法和装置包括当允许对特定连接条件构建排名连接索引的预处理时，提供针对两个关系的top-k连接查询的性能保证的解决方案。在这里提出的排名连接指数的概念也适用于单一关系的情况。在这种情况下，这里的概念提供了对单调线性函数的top-k选择问题的解决方案，对于两个排序的属性和任意偏好向量的情况，保证了最差情况搜索性能。

100. 发明授权

US08005817B1 System and method for providing structure and content scoring for XML 失效
标题翻译：为XML提供结构和内容评分的系统和方法
公开(公告)号：US08005817B1
公开(公告)日：2011-08-23
申请号：US11290858
申请日：2005-11-30
申请人： Sihem Amer-Yahia , Nikolas Koudas , Amelie Marian , Divesh Srivastava , David Toman
发明人： Sihem Amer-Yahia , Nikolas Koudas , Amelie Marian , Divesh Srivastava , David Toman
IPC分类号： G06F17/30
CPC分类号： G06F17/30929
摘要： A system, method and computer readable medium are disclosed. The method embodiment relates to a method of computing score of candidate answers to a database query. The method comprises receiving a database query, assigning a first score to a match to the query, the first score being associated with a relative importance of an individual keyword in a collection of documents based on all structural and content predicates in the query, assigning a second score to the match, the second score being associated with a relative importance of a keyword in an individual document and using the assigned first score and second score to compute an answer score for the query.
摘要翻译：公开了一种系统，方法和计算机可读介质。方法实施例涉及一种计算数据库查询的候选答案的分数的方法。所述方法包括：接收数据库查询，将第一分数分配给所述查询的匹配，所述第一分数基于所述查询中的所有结构和内容谓词，在文档集合中与个别关键字的相对重要性相关联，分配所述第二分数与所述单个文档中的关键字的相对重要性相关联，并且使用所分配的第一分数和第二分数来计算所述查询的答案分数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式