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

21. 发明授权

US09576015B1 Domain-specific language for dataset transformations 有权
标题翻译：用于数据集转换的域专用语言
公开(公告)号：US09576015B1
公开(公告)日：2017-02-21
申请号：US14874690
申请日：2015-10-05
申请人： Palantir Technologies, Inc.
发明人： David Tolnay , Punyashloka Biswal , Andrew Colombi , Yupeng Fu , Ashar Fuadi , Mingyu Kim , Paul Nepywoda , Akshay Pundle , Juan Tamayo
IPC分类号： G06F17/30
CPC分类号： G06F17/30569 , G06F17/30339 , G06F17/30345 , G06F17/30457 , G06F17/30563 , G06F17/30958 , G06F17/30961
摘要： Techniques related to a domain-specific language for dataset transformations are disclosed. A server computer may process a table definition composed in a domain-specific language. The table definition may include a sequence of one or more dataset transformations to be performed on one or more source tables to generate a target table. The sequence may include a customized transformation. A source dataset may be provided as input to an implementation of the customized transformation. An output dataset may be generated as a result of executing the implementation. An intermediate table may be generated based on performing at least one dataset transformation on a particular source table. A supplemental portion for the intermediate table may be generated based on performing the at least one dataset transformation on an appended portion of the particular source table. The target table may be generated based on combining the supplemental portion with the intermediate table.
摘要翻译：公开了与数据集转换的领域专用语言相关的技术。服务器计算机可以处理以域特定语言组成的表定义。表定义可以包括要在一个或多个源表上执行以生成目标表的一个或多个数据集变换的序列。序列可以包括定制的变换。源数据集可以被提供为定制变换的实现的输入。作为执行实现的结果，可以生成输出数据集。可以基于对特定源表执行至少一个数据集变换来生成中间表。可以基于在特定源表的附加部分上执行至少一个数据集变换来生成中间表的补充部分。可以基于将补充部分与中间表组合来生成目标表。

22. 发明授权

US09529849B2 Online hash based optimizer statistics gathering in a database 有权
标题翻译：数据库中基于在线哈希的优化器统计信息收集
公开(公告)号：US09529849B2
公开(公告)日：2016-12-27
申请号：US14145759
申请日：2013-12-31
申请人： Edwin Seputis
发明人： Edwin Seputis
IPC分类号： G06F17/30
CPC分类号： G06F17/30469 , G06F17/30457
摘要： Disclosed herein are system, method, and computer program product embodiments for generating a histogram used to optimize a query plan. An embodiment operates by initializing a first thread and a second thread, such that the first thread processes a first section of a column and the second thread processes a second section of the column, concurrently with the first thread. The first thread generates a first hash table and the second thread generates a second hash table. The first and second hash tables represent data distribution stored in the respective first and second sections of the column. The first and second tables are merged into a histogram that represents data distribution in the column.
摘要翻译：本文公开了用于生成用于优化查询计划的直方图的系统，方法和计算机程序产品实施例。实施例通过初始化第一线程和第二线程来操作，使得第一线程处理列的第一部分，并且第二线程与第一线程同时处理列的第二部分。第一个线程生成第一个哈希表，第二个线程生成第二个哈希表。第一和第二散列表表示存储在列的相应第一和第二部分中的数据分布。第一个和第二个表被合并到表示列中的数据分布的直方图中。

23. 发明申请

US20160357813A1 INFORMATION RETRIEVAL AND NAVIGATION USING A SEMANTIC LAYER AND DYNAMIC OBJECTS 审中-公开
公开(公告)号：US20160357813A1
公开(公告)日：2016-12-08
申请号：US15237948
申请日：2016-08-16
申请人： Oracle International Corporation
发明人： Adam FERRARI , Joshua William KAPELL , Jason FURTADO , Matthew L. BRANDWEIN , Spiro MICHAYLOV , Omri TRAUB , Vladimir ZELEVINSKY , John HUFFAKER
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , G06F17/30595
摘要： Systems and methods for information retrieval are provided that permit users and/or processing entities to access and define synthetic data, synthetic objects, and/or synthetic groupings of data in one or more collections of information. In one embodiment, data access on an information retrieval system can occur through an interpretation layer which interprets any synthetic data against data physically stored in the collection. Synthetic data can define virtual data objects, virtual data elements, virtual data attributes, virtual data groupings, and/or data entities that can be interpreted against data that may be stored physically in the collection of information. The system and methods for information retrieval can return results from the one or more collections of information based not only on the data stored, but also on the virtual data generated from interpretation of the stored data.

24. 发明申请

US20160335361A1 HISTORICAL DATA REPLAY UTILIZING A COMPUTER SYSTEM 审中-公开
标题翻译：历史数据重复利用计算机系统
公开(公告)号：US20160335361A1
公开(公告)日：2016-11-17
申请号：US15155010
申请日：2016-05-14
申请人： Walleye Software, LLC
发明人： Radu Teodorescu , Ryan Caudy , David R. Kent, IV , Charles Wright , Oleg Vydrov
IPC分类号： G06F17/30
CPC分类号： G06F17/30368 , G06F3/0481 , G06F3/0482 , G06F3/0483 , G06F3/04847 , G06F3/0485 , G06F3/04895 , G06F3/0605 , G06F3/0656 , G06F3/067 , G06F8/30 , G06F8/41 , G06F8/427 , G06F8/60 , G06F11/1451 , G06F11/1464 , G06F11/1469 , G06F12/0261 , G06F12/084 , G06F12/1483 , G06F15/17331 , G06F17/2235 , G06F17/24 , G06F17/245 , G06F17/246 , G06F17/2715 , G06F17/276 , G06F17/30117 , G06F17/30283 , G06F17/30303 , G06F17/30312 , G06F17/30315 , G06F17/30321 , G06F17/30324 , G06F17/30327 , G06F17/30333 , G06F17/30336 , G06F17/30339 , G06F17/30342 , G06F17/30345 , G06F17/30371 , G06F17/30374 , G06F17/30377 , G06F17/30398 , G06F17/30424 , G06F17/30448 , G06F17/30451 , G06F17/30454 , G06F17/30457 , G06F17/30477 , G06F17/30483 , G06F17/30498 , G06F17/30522 , G06F17/30528 , G06F17/30554 , G06F17/30563 , G06F17/30584 , G06F17/30598 , G06F17/30864 , G06F17/30867 , G06F17/30887 , G06F17/30902 , G06F17/30958 , G06F17/30997 , G06F17/40 , G06F21/00 , G06F21/6209 , G06F2201/805 , G06F2201/84 , G06F2212/1052 , G06F2212/154 , G06F2212/163 , G06F2212/60 , H04L12/18 , H04L51/046 , H04L51/12 , H04L61/2069 , H04L63/101 , H04L63/102 , H04L67/1002 , H04L67/141 , H04L67/28 , H04L67/2833 , H04L67/2842 , H04L67/2847 , H04L67/34 , H04L67/42 , H04L69/16
摘要： Described are methods, systems and computer readable media for simulated replay of data using a computer system.
摘要翻译：描述了使用计算机系统来模拟数据重放的方法，系统和计算机可读介质。

25. 发明申请

US20160335352A1 QUERY DISPATCH AND EXECUTION ARCHITECTURE 审中-公开
标题翻译： QUERY DISPATCH和执行架构
公开(公告)号：US20160335352A1
公开(公告)日：2016-11-17
申请号：US15154995
申请日：2016-05-14
申请人： Walleye Software, LLC
发明人： Radu Teodorescu , Ryan Caudy , David R. Kent, IV , Charles Wright , Nathan Dorfman
IPC分类号： G06F17/30 , H04L29/08
CPC分类号： H04L67/42 , G06F3/0481 , G06F3/0482 , G06F3/0483 , G06F3/04847 , G06F3/0485 , G06F3/04895 , G06F3/0605 , G06F3/0656 , G06F3/067 , G06F8/30 , G06F8/41 , G06F8/427 , G06F8/60 , G06F11/1451 , G06F11/1464 , G06F11/1469 , G06F12/0261 , G06F12/084 , G06F12/1483 , G06F15/17331 , G06F17/2235 , G06F17/24 , G06F17/245 , G06F17/246 , G06F17/2715 , G06F17/276 , G06F17/30117 , G06F17/30283 , G06F17/30303 , G06F17/30312 , G06F17/30315 , G06F17/30321 , G06F17/30324 , G06F17/30327 , G06F17/30333 , G06F17/30336 , G06F17/30339 , G06F17/30342 , G06F17/30345 , G06F17/30368 , G06F17/30371 , G06F17/30374 , G06F17/30377 , G06F17/30398 , G06F17/30424 , G06F17/30448 , G06F17/30451 , G06F17/30454 , G06F17/30457 , G06F17/30477 , G06F17/30483 , G06F17/30498 , G06F17/30522 , G06F17/30528 , G06F17/30554 , G06F17/30563 , G06F17/30584 , G06F17/30598 , G06F17/30864 , G06F17/30867 , G06F17/30887 , G06F17/30902 , G06F17/30958 , G06F17/30997 , G06F17/40 , G06F21/00 , G06F21/6209 , G06F2201/805 , G06F2201/84 , G06F2212/1052 , G06F2212/154 , G06F2212/163 , G06F2212/60 , H04L12/18 , H04L51/046 , H04L51/12 , H04L61/2069 , H04L63/101 , H04L63/102 , H04L67/1002 , H04L67/141 , H04L67/28 , H04L67/2833 , H04L67/2842 , H04L67/2847 , H04L67/34 , H04L69/16
摘要： Described are methods, systems and computer readable media for providing a query dispatch and execution architecture.
摘要翻译：描述了用于提供查询分派和执行架构的方法，系统和计算机可读介质。

27. 发明授权

US09495423B2 Prefetching RDF triple data 有权
标题翻译：预取RDF三重数据
公开(公告)号：US09495423B2
公开(公告)日：2016-11-15
申请号：US14049753
申请日：2013-10-09
申请人： International Business Machines Corporation
发明人： Yue Pan , Xing Zhi Sun , Qing Fa Wang , Shuo Wu , Lin Hao Xu
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30457 , G06F17/30477 , G06F17/30495 , G06F17/30533 , G06F17/30902
摘要： Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.
摘要翻译：获得对RDF三元组的查询请求，其中查询请求包含至少一个三重模式; 对于每个三重图案，确定对应的基本图案，并且将每个三重图案转换为加权基本图案。基于加权基本模式计算每个基本图案的出现频率; 至少根据发生频率选择至少一个基本模式; 并且对应于所选择的至少基本图案的RDF三元组被预取到缓冲器中。还提供了相应的装置。利用上述方法和装置，可以确定频繁访问的RDF三元组并将其预取到缓冲器中，这提高了查询效率。

28. 发明申请

US20160328444A1 EFFICIENT MULTI-TENANT SPATIAL AND RELATIONAL INDEXING 审中-公开
标题翻译：有效的多元空间和关系指数
公开(公告)号：US20160328444A1
公开(公告)日：2016-11-10
申请号：US15213726
申请日：2016-07-19
申请人： MICROSOFT TECHNOLOGY LICENSING, LLC
发明人： EUGENE SHINN , HARISH JAYANTI , ABHISHEK PRATEEK
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , G06F17/30241 , G06F17/30312 , G06F17/30867 , G06F17/3087
摘要： Methods, computer systems, and computer-storage media are provided for increasing the efficiency of a multi-tenant geospatial data index. Efficiency is increased by using a multi-tenant model for storing and serving the data, processing raw geospatial data received from tenants into a runtime-optimized format, and by partitioning tenant geospatial data into a processor memory portion and a file system memory portion. Efficiency is also increased by executing a staged upload of the processor memory portion and the file system memory portion to a subset of host machines in order to check for invalid data before uploading the data to the remaining host machines. Additionally, efficiency is increased by optimizing geospatial search queries using query filters stored in a query filter cache, and executing the query filters initially against the processor memory.
摘要翻译：提供了方法，计算机系统和计算机存储介质，以提高多租户地理空间数据索引的效率。通过使用用于存储和服务数据的多租户模型，将从租户接收的原始地理空间数据处理为运行时优化格式，以及将租户地理空间数据分为处理器存储器部分和文件系统存储器部分来提高效率。通过执行将处理器存储器部分和文件系统存储器部分分段上传到主机的子集以便在将数据上传到剩余的主机之前检查无效数据也提高了效率。此外，通过使用存储在查询过滤器高速缓存中的查询过滤器优化地理空间搜索查询，并且最初对处理器存储器执行查询过滤器来提高效率。

29. 发明申请

US20160259838A1 REPORTING AND SUMMARIZING METRICS IN SPARSE RELATIONSHIPS ON AN OLTP DATABASE 有权
公开(公告)号：US20160259838A1
公开(公告)日：2016-09-08
申请号：US15155372
申请日：2016-05-16
申请人： International Business Machines Corporation
发明人： Biswadeep Banerjee , Michael L. Lamb , Mack E. Phelps , Vishnukumar T Santharam
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30292 , G06F17/30339 , G06F17/30424 , G06F17/30457 , G06F17/30477 , G06F17/30498 , G06F17/30557
摘要： Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

30. 发明授权

US09396246B2 Reporting and summarizing metrics in sparse relationships on an OLTP database 有权
标题翻译：报告和汇总OLTP数据库中稀疏关系中的度量标准
公开(公告)号：US09396246B2
公开(公告)日：2016-07-19
申请号：US14075195
申请日：2013-11-08
申请人： International Business Machines Corporation
发明人： Biswadeep Banerjee , Michael L. Lamb , Mack E. Phelps , Vishnukumar T Santharam
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30292 , G06F17/30339 , G06F17/30424 , G06F17/30457 , G06F17/30477 , G06F17/30498 , G06F17/30557
摘要： Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.
摘要翻译：使用以下技术来存储和/或访问事务数据库中的数据：（i）在事务数据库中选择一组基表; 和（ii）创建一个基准表集合具有最大稀疏度的无谓物化查询表。基表集包括至少两个基表。一组基表包括一组键，包括至少两个不同的主键。无事实质化查询表包括与基表集合中的每个记录相关联的一个记录。物化查询表中的每条记录都包含一组基表中每个主键的值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式