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

1. 发明申请

WO2014176754A1 HISTOGRAM CONSTRUCTION FOR STRING DATA 审中-公开
标题翻译：用于数据的组织结构
公开(公告)号：WO2014176754A1
公开(公告)日：2014-11-06
申请号：PCT/CN2013/075033
申请日：2013-04-30
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , LUO, Ge , JIAO, Li-Mei , CAO, Zhao , CHEN, Shimin , GUO, Meng
发明人： LUO, Ge , JIAO, Li-Mei , CAO, Zhao , CHEN, Shimin , GUO, Meng
IPC分类号： G06F17/21 , G06F9/45
CPC分类号： G06F17/30516 , G06F17/21 , G06F17/30327 , G06F17/30345 , G06F17/3053
摘要： 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.
摘要翻译：描述了生成字符串直方图的方法和系统。在一个实现中，生成具有表示字符串的前缀的节点的前缀树。对于前缀树，根据基于节点的子树节点表示的前缀的长度和由子树节点表示其前缀的字符串的频率，将部署权重分配给节点。一个节点的每个部署权重表示在使用由根节点在该一个节点处的子树节点表示的至少一个前缀来填充桶时保留的最大权重。确定预定义数量的顶部前缀以填充预定义数量的桶。顶部前缀是基于最大化由桶中的前缀保留的总重量以及最大数量的字符串来确定的。基于与顶部前缀相关联的部署权重生成直方图。

2. 发明申请

WO2014117297A1 APPROXIMATE QUERY PROCESSING 审中-公开
标题翻译：近似查询处理
公开(公告)号：WO2014117297A1
公开(公告)日：2014-08-07
申请号：PCT/CN2013/000107
申请日：2013-01-31
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , CAO, Zhao , JIAO, Limei , CHEN, Shimin , WANG, Min , GUO, Meng
发明人： CAO, Zhao , JIAO, Limei , CHEN, Shimin , WANG, Min , GUO, Meng
IPC分类号： G06F17/30
CPC分类号： G06F17/30448 , G06F17/30498 , G06F17/30528 , G06F17/30536 , G06F17/30864
摘要： A method for obtaining an approximate answer for a query on a database is provided. A query is converted into a set of sub queries with a canonical form. An approximate answer is generated for each of said sub queries, and approximate answers for the sub queries are combined to obtain an approximate answer for said query.
摘要翻译：提供了一种用于获取关于数据库的查询的近似答案的方法。查询被转换成一组具有规范形式的子查询。对于每个所述子查询生成近似答案，并且组合子查询的近似答案以获得所述查询的近似答案。

3. 发明申请

WO2014117298A1 EVENT LOG SYSTEM 审中-公开
标题翻译：活动纪录系统
公开(公告)号：WO2014117298A1
公开(公告)日：2014-08-07
申请号：PCT/CN2013/000108
申请日：2013-01-31
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , CAO, Zhao , CHEN, Shimin , LI, Feifei , WANG, Min , WANG, Xiaoyang
发明人： CAO, Zhao , CHEN, Shimin , LI, Feifei , WANG, Min , WANG, Xiaoyang
IPC分类号： G06F17/30 , H04L12/26 , H04L29/08
CPC分类号： G06F17/30312 , G06F11/0709 , G06F11/0778 , G06F17/2705 , G06F21/552 , H04L67/10 , H04L67/22
摘要： An event log system and method are disclosed. The system includes a plurality of worker nodes to receive and store event log records from a plurality of log sources, and a coordinator node to maintain information about mapping from the plurality of log sources to the plurality of worker nodes. Each worker node comprises an IngestKV module to temporarily store event log records from the log sources and a TimeRangeKV module to permanently store the event log records.
摘要翻译：公开了事件日志系统和方法。该系统包括多个工作节点，用于从多个日志源接收和存储事件日志记录，以及协调器节点来维护关于从多个日志源到多个工作节点的映射的信息。每个工作节点包括一个IngestKV模块，用于临时存储来自日志源的事件日志记录和一个TimeRangeKV模块来永久存储事件日志记录。

4. 发明申请

WO2014117296A1 GENERATING A HINT FOR A QUERY 审中-公开
标题翻译：产生一个查询的提示
公开(公告)号：WO2014117296A1
公开(公告)日：2014-08-07
申请号：PCT/CN2013/000106
申请日：2013-01-31
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , JIAO, Limei , CAO, Zhao , CHEN, Shimin , WANG, Min
发明人： JIAO, Limei , CAO, Zhao , CHEN, Shimin , WANG, Min
IPC分类号： G06F17/30
CPC分类号： G06F17/30507 , G06F17/30312 , G06F17/30958
摘要： A method, system, and non-transitory computer readable medium for generating a hint for a query are disclosed. A model which represents relevance between attributes in a dataset is constructed based on historical data associated with the dataset. According to said model, statistics about the attributes are computed. And in response to a query input by a user, a hint is generated for the query based on the model and statistics.
摘要翻译：公开了一种用于生成查询提示的方法，系统和非暂时计算机可读介质。基于与数据集相关联的历史数据构建表示数据集中属性之间相关性的模型。根据所述模型，计算关于属性的统计。并且响应于用户输入的查询，基于模型和统计信息为查询生成提示。

5. 发明申请

WO2014117295A1 PERFORMING AN INDEX OPERATION IN A MAPREDUCE ENVIRONMENT 审中-公开
标题翻译：在MAPREDUCE环境中执行索引操作
公开(公告)号：WO2014117295A1
公开(公告)日：2014-08-07
申请号：PCT/CN2013/000105
申请日：2013-01-31
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , CAO, Zhao , MA, Dongzhe , CHEN, Shimin , WANG, Min
发明人： CAO, Zhao , MA, Dongzhe , CHEN, Shimin , WANG, Min
IPC分类号： G06F17/30
CPC分类号： G06F17/30474 , G06F17/30336 , G06F17/30457 , G06F17/30587
摘要： A method for performing an index operation in a MapReduce environment is provided. An execution plan is generated based on a conceptual job input by a user, wherein said conceptual job comprises an index operator, a mapper and a reducer and said execution plan is generated to minimize an execution cost based on characteristics of the index operator. The execution plan is converted to MapReduce jobs and the MapReduce jobs are provided to a runtime component for execution.
摘要翻译：提供了一种在MapReduce环境中执行索引操作的方法。基于由用户输入的概念作业生成执行计划，其中所述概念作业包括索引操作符，映射器和缩小器，并且生成所述执行计划，以基于索引运算符的特性来最小化执行成本。将执行计划转换为MapReduce作业，并将MapReduce作业提供给运行时组件以供执行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式