会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Summary-based routing for content-based event distribution networks
    • 基于内容的事件分发网络的基于摘要的路由
    • US20070168550A1
    • 2007-07-19
    • US11702856
    • 2007-02-06
    • Yi-Min WangLili QiuChad VerbowskiDemetrios AchlioptasGautam DasPer-Ake Larson
    • Yi-Min WangLili QiuChad VerbowskiDemetrios AchlioptasGautam DasPer-Ake Larson
    • G06F15/173
    • H04L29/06H04L12/1859H04L67/327H04L69/329
    • A system arid method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription. Where event space partitioning is desirable, an over-partitioning scheme is described that enables load balancing without repartitioning.
    • 一种用于通过使用基于摘要的路由,特别是使用基于内容的发布/订阅模型来分发信息的事件分发网络来实现高度可扩展的多节点事件分发网络的系统和方法。 通过允许事件路由器使用由匹配器节点托管的订阅的不精确的摘要,事件路由器可以将自身消除为瓶颈,从而改善整体事件分发网络吞吐量,即使使用不精确的摘要导致一些假阳性事件流量。 通过使用在每个匹配器节点处提供良好订阅集位置的过滤器集分割来减少假正事件流量,同时避免任何一个匹配器节点的过载。 通过将新的订阅路由到具有最佳覆盖新订阅的订阅摘要的匹配器节点来维护良好的订阅集位置。 在需要事件空间分区的情况下,描述了能够进行负载均衡而不进行重新分区的过分配方案。
    • 4. 发明授权
    • Summary-based routing for content-based event distribution networks
    • 基于内容的事件分发网络的基于摘要的路由
    • US07200675B2
    • 2007-04-03
    • US10389623
    • 2003-03-14
    • Yi-Min WangLili QiuChad E. VerbowskiDemetrios AchlioptasGautam DasPer-Ake Larson
    • Yi-Min WangLili QiuChad E. VerbowskiDemetrios AchlioptasGautam DasPer-Ake Larson
    • G06F15/173G06F15/16
    • H04L29/06H04L12/1859H04L67/327H04L69/329
    • A system and method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription. Where event space partitioning is desirable, an over-partitioning scheme is described that enables load balancing without repartitioning.
    • 一种通过使用基于摘要的路由,特别是使用基于内容的发布/订阅模型来分发信息的事件分发网络来实现高度可扩展的多节点事件分发网络的系统和方法。 通过允许事件路由器使用由匹配器节点托管的订阅的不精确的摘要,事件路由器可以将自身消除为瓶颈,从而改善整体事件分发网络吞吐量,即使使用不精确的摘要导致一些假阳性事件流量。 通过使用在每个匹配器节点处提供良好订阅集位置的过滤器集分割来减少假正事件流量,同时避免任何一个匹配器节点的过载。 通过将新的订阅路由到具有最佳覆盖新订阅的订阅摘要的匹配器节点来维护良好的订阅集位置。 在需要事件空间分区的情况下,描述了能够进行负载均衡而不进行重新分区的过分配方案。
    • 6. 发明授权
    • Just-in-time analytics on large file systems
    • 大型文件系统的即时分析
    • US09244975B2
    • 2016-01-26
    • US13328810
    • 2011-12-16
    • Gautam DasHao H. HuangSandor SzalayNan Zhang
    • Gautam DasHao H. HuangSandor SzalayNan Zhang
    • G06F17/30
    • G06F17/30442
    • As file systems reach the petabytes scale, users and administrators are increasingly interested in acquiring high-level analytical information for file management and analysis. Two particularly important tasks are the processing of aggregate and top-k queries which, unfortunately, cannot be quickly answered by hierarchical file systems such as ext3 and NTFS. Existing pre-processing based solutions, e.g., file system crawling and index building, consume a significant amount of time and space (for generating and maintaining the indexes) which in many cases cannot be justified by the infrequent usage of such solutions. User interests can often be sufficiently satisfied by approximate (i.e., statistically accurate) answers. A just-in-time sampling-based system can, after consuming a small number of disk accesses, produce extremely accurate answers for a broad class of aggregate and top-k queries over a file system without the requirement of any prior knowledge. The system is efficient, accurate and scalable.
    • 随着文件系统达到PB级,用户和管理员越来越有兴趣获取用于文件管理和分析的高级分析信息。 两个特别重要的任务是处理聚合和top-k查询,不幸的是不能通过分层文件系统(如ext3和NTFS)快速回答。 现有的基于预处理的解决方案,例如文件系统爬行和索引构建,消耗了大量的时间和空间(用于生成和维护索引),这在许多情况下不能被这种解决方案的频繁使用所证明。 用户兴趣通常可以通过近似(即统计准确的)答案来充分满足。 基于时间抽样的系统可以在消耗少量磁盘访问后,通过文件系统为广泛的聚合和顶级查询提供非常准确的答案,而无需任何先前的知识。 该系统是高效,准确和可扩展的。
    • 9. 发明授权
    • Just-in-time analytics on large file systems and hidden databases
    • 大型文件系统和隐藏数据库的即时分析
    • US09244976B1
    • 2016-01-26
    • US13402764
    • 2012-02-22
    • Nan ZhangGautam Das
    • Nan ZhangGautam Das
    • G06F17/30
    • G06F17/30442
    • A just-in-time sampling-based system can, after consuming a small number of disk accesses or queries, produce extremely accurate answers for a broad class of aggregate and top-k queries over a file system or database without the requirement of prior knowledge. The system is efficient, accurate, and scalable. The system performs aggregate estimations of a hidden database through its web interface by employing techniques that use a small number of queries to produce unbiased estimates with small variance. It conducts domain discovery over a hidden database through its web interface by employing techniques which provide effective guarantees on the effectiveness of domain discovery. Systems and methods enhance forms used by mobile devices to access hidden databases. It employs data analytics to improve the usage of form fields, including providing context-sensitive auto-completion suggestions, highlighting selections in drop-down boxes and eliminating suggestions in drop-down boxes.
    • 基于时间抽样的系统可以在消耗少量磁盘访问或查询后,通过文件系统或数据库为广泛类型的聚合和顶级查询提供非常准确的答案,而无需事先知识 。 该系统是高效,准确和可扩展的。 系统通过使用少量查询的技术来生成具有小差异的无偏估计,通过其Web界面执行隐藏数据库的总体估计。 它通过其Web界面通过隐藏的数据库进行域发现,采用技术为域发现的有效性提供有效的保证。 系统和方法增强了移动设备访问隐藏数据库所使用的形式。 它采用数据分析来改进表单域的使用,包括提供上下文相关的自动完成建议,在下拉框中突出显示选择,并在下拉框中删除建议。
    • 10. 发明申请
    • Ranking database query results
    • 排名数据库查询结果
    • US20050289102A1
    • 2005-12-29
    • US10879450
    • 2004-06-29
    • Gautam DasSurajit ChaudhuriVagelis HristidisGerhard Weikum
    • Gautam DasSurajit ChaudhuriVagelis HristidisGerhard Weikum
    • G06F7/00G06Q30/00G06Q50/00
    • G06Q30/0603G06Q50/16Y10S707/99937
    • A system and methods rank results of database queries. An automated approach for ranking database query results is disclosed that leverages data and workload statistics and associations. Ranking functions are based upon the principles of probabilistic models from Information Retrieval that are adapted for structured data. The ranking functions are encoded into an intermediate knowledge representation layer. The system is generic, as the ranking functions can be further customized for different applications. Benefits of the disclosed system and methods include the use of adapted probabilistic information retrieval (PIR) techniques that leverage relational/structured data, such as columns, to provide natural groupings of data values. This permits the inference and use of pair-wise associations between data values across columns, which are usually not possible with text data.
    • 系统和方法对数据库查询的结果进行排序。 披露了一种用于排名数据库查询结果的自动化方法,它利用数据和工作量统计信息和关联。 排名函数基于适用于结构化数据的信息检索的概率模型的原理。 排序函数被编码为中间知识表示层。 该系统是通用的,因为排序功能可以针对不同的应用进一步定制。 所公开的系统和方法的优点包括使用适应的概率信息检索(PIR)技术来利用诸如列的关系/结构化数据来提供数据值的自然分组。 这允许推断和使用跨列之间的数据值之间的成对关联,这通常不可能与文本数据。