会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • TOP-K Prefix Histogram Construction for String Data
    • TOP-K字符串数据的前缀直方图构造
    • US20160154854A1
    • 2016-06-02
    • US14787548
    • 2013-04-30
    • Ge LOULi-Mei JIAOZhao CAOShimin CHENMeng GUOHEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
    • Ge LUOLi-Mei JIAOZhao CAOShimin CHENWeng GUO
    • G06F17/30
    • G06F16/24568G06F16/2246G06F16/23G06F16/24578G06F17/21
    • Methods and systems of generation of histograms for strings are described. In one implementation, a prefix tree having nodes representing prefixes of the strings is generated. For the prefix tree, deploy weights are assigned to the nodes based on lengths of the prefixes represented by sub-tree nodes rooted at the nodes and frequencies of the strings whose prefixes are represented by the sub-tree nodes. Each of the deploy weights of one node is indicative of a maximum weight preserved upon filling the buckets with at least one prefix represented by the sub-tree nodes rooted at that one node. A predefined number of Top-prefixes are determined for filling up the predefined number of buckets. The Top-prefixes are determined based on maximizing a total weight preserved by the prefixes in the buckets and over a maximum number of strings. A histogram is generated based on the deploy weights associated with the Top-prefixes.
    • 描述了生成字符串直方图的方法和系统。 在一个实现中,生成具有表示字符串的前缀的节点的前缀树。 对于前缀树,根据基于节点的子树节点表示的前缀的长度和由子树节点表示其前缀的字符串的频率,将部署权重分配给节点。 一个节点的每个部署权重表示在使用由根节点在该一个节点处的子树节点表示的至少一个前缀来填充桶时保留的最大权重。 确定预定义数量的顶部前缀以填充预定义数量的桶。 顶部前缀是基于最大化由桶中的前缀保留的总重量以及最大数量的字符串来确定的。 基于与顶部前缀相关联的部署权重生成直方图。