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

1. 发明申请

US20190121891A1 COMPUTING COLUMNAR INFORMATION DURING JOIN ENUMERATION 审中-公开
公开(公告)号：US20190121891A1
公开(公告)日：2019-04-25
申请号：US15791712
申请日：2017-10-24
申请人： Oracle International Corporation
发明人： Pit Fender , Benjamin Schlegel , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F16/24544 , G06F16/24535 , G06F16/24537 , G06F16/24545
摘要： Techniques are described herein for computing columnar information during join enumeration in a database system. The computation occurs in two phases: the first phase involves a pre-computational phase that is only run once per query block to initialize and prepare a set of data structures. The second phase is an incremental approach that takes place for every query sub-plan. Upon completion of the second phase, the generated projected attributes of a query sub-plan are associated as columnar information associated with the query sub-plan, and used to compute the query execution cost. Subsequently, based on the computed query execution cost, the query sub-plan may be executed as part of the query execution plan.

2. 发明授权

US10083207B2 Cardinality estimation of a join predicate 有权
公开(公告)号：US10083207B2
公开(公告)日：2018-09-25
申请号：US15889528
申请日：2018-02-06
申请人： International Business Machines Corporation
发明人： Sahana H. Anantharajaiah , Harjindersingh G. Mistry , Ajay M. Patil
IPC分类号： G06F17/30 , G06F17/18 , G06F17/17
CPC分类号： G06F16/24544 , G06F16/211 , G06F16/24535 , G06F17/175 , G06F17/18
摘要： In one embodiment, a method for improving cardinality estimation of a join predicate between a fact table and an overloaded dimension table is provided. The method includes receiving a dimension table and a fact table in a join predicate of one or more SQL statements. The method further includes identifying a majority of records in the fact table that refer to a subset of records in the dimension table. The method further includes computing a filter factor of the join predicate between the dimension table and the fact table. The method further includes creating a statistical view using one or more relevant portions of the dimension table that are referred to by the fact table.

4. 发明申请

US20180089312A1 MULTI-LAYER PARTITION ALLOCATION FOR QUERY EXECUTION 审中-公开
公开(公告)号：US20180089312A1
公开(公告)日：2018-03-29
申请号：US15665159
申请日：2017-07-31
申请人： Splunk Inc.
发明人： Sourav Pal , Arindam Bhattacharjee , Kishore Reddy Ramasayam , Alexander Douglas James
IPC分类号： G06F17/30
CPC分类号： G06F16/335 , G06F16/24535 , G06F16/2465 , G06F16/2471 , G06F16/26 , G06F16/328
摘要： Systems and methods are disclosed for processing and executing queries against one or more dataset sources, where the queries identify a set of data to be processed and a manner of processing the set of data. To query the dataset sources, a query coordinator generates a query processing scheme that includes a dynamic allocation of multiple layers of partitions. The query is then executed based on the query processing scheme.

5. 发明申请

US20180089306A1 QUERY ACCELERATION DATA STORE 审中-公开
公开(公告)号：US20180089306A1
公开(公告)日：2018-03-29
申请号：US15665279
申请日：2017-07-31
申请人： Splunk Inc.
发明人： Sourav Pal , Arindam Bhattacharjee , Asha Andrade
IPC分类号： G06F17/30
CPC分类号： G06F16/3334 , G06F16/24535 , G06F16/24554 , G06F16/2465 , G06F16/3349
摘要： Systems and methods for a data index and query system that utilize a query acceleration data store. An example method includes receiving a query identifying a set of data to be processed and a manner of processing the set of data. A query processing scheme for obtaining and processing the set of data is defined. First partial results of the query stored in a data store are identified, with the first partial results corresponding to a first portion of the set of data. One or more partitions are dynamically allocated to obtain a second portion of the set of data from different data sources. The second portion of the set of data is processed to obtain second partial results. The first partial results and second partial results are combined. The query is executed based on the query processing scheme.

6. 发明申请

US20180089264A1 EVALUATION OF QUERY FOR DATA ITEM HAVING MULTIPLE REPRESENTATIONS IN GRAPH BY EVALUATING SUB-QUERIES 审中-公开
公开(公告)号：US20180089264A1
公开(公告)日：2018-03-29
申请号：US15278639
申请日：2016-09-28
申请人： International Business Machines Corporation
发明人： Scott N. Gerard
IPC分类号： G06F17/30
CPC分类号： G06F16/24535 , G06F16/9024
摘要： A query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Sub-queries for the query each correspond to a different representation in which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in satisfaction or fulfillment of the query.

7. 发明申请

US20180089263A1 EVALUATION OF QUERY FOR DATA ITEM HAVING MULTIPLE REPRESENTATIONS IN GRAPH ON A SUB-QUERY BY SUB-QUERY BASIS UNTIL DATA ITEM HAS BEEN RETRIEVED 审中-公开
公开(公告)号：US20180089263A1
公开(公告)日：2018-03-29
申请号：US15278601
申请日：2016-09-28
申请人： International Business Machines Corporation
发明人： Scott N. Gerard
IPC分类号： G06F17/30
CPC分类号： G06F16/24535 , G06F16/9024
摘要： Sub-queries for a query are ordered. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Each sub-query corresponds to a different representation in which the data graph stores the data item. The sub-queries are ordered in an ordered list according to likelihood that evaluation thereof will yield an appropriate or selected representation of the data item that is correct for the query and that correctly answers the query. The sub-queries within the ordered list are evaluated on a sub-query by sub-query basis, until the data item has been retrieved.

8. 发明申请

US20170322973A1 System and Method to Optimize Queries on a View 审中-公开
公开(公告)号：US20170322973A1
公开(公告)日：2017-11-09
申请号：US15646818
申请日：2017-07-11
申请人： Huawei Technologies Co., Ltd.
发明人： Nirmala Sreekantaiah , Dilip Kumar , Kumar Rajeev Rastogi
IPC分类号： G06F17/30
CPC分类号： G06F16/24535 , G06F16/212 , G06F16/24539 , G06F16/24542
摘要： A system and method to optimize queries on a view comprise a processor coupled to a memory storing a plurality of instructions for directing the processor to receive a query comprising a part of query on view, check, based on the part of query on view, in system table, wherein the system table comprises a status associated with the view indicating the compilation of the view, and if the part of query on view found in the system table, fetch a shared object file storing at least one compilation function associated with the part of query on view, use the compilation function as a part of a query execution plan, and execute the query execution plan to display the result.

9. 发明申请

US20170293653A1 FAIR SCHEDULING FOR MIXED-QUERY LOADS 审中-公开
公开(公告)号：US20170293653A1
公开(公告)日：2017-10-12
申请号：US15634422
申请日：2017-06-27
申请人： Palantir Technologies, Inc.
发明人： Michael Harris , John Carrino , Eric Wong
IPC分类号： G06F17/30
CPC分类号： G06F16/24535 , G06F16/2453 , G06F16/24542 , G06F16/2455 , G06F16/951
摘要： A fair scheduling system with methodology for scheduling queries for execution by a database management system in a fair manner. The system obtains query jobs for execution by the database management system and cost estimates to execute the query jobs. Based on the cost estimates, the system causes the database management system to execute the query jobs as separate sub-query tasks in a round-robin fashion. By doing so, the execution latency of low cost query jobs that return few results is reduced when the query jobs are concurrently executed with high cost query jobs that return many results.

10. 发明申请

US20170052976A1 DYNAMIC CACHING SYSTEM 审中-公开
标题翻译：动态缓存系统
公开(公告)号：US20170052976A1
公开(公告)日：2017-02-23
申请号：US15008679
申请日：2016-01-28
申请人： MAKEMYTRIP (INDIA) PRIVATE LIMITED
发明人： AKSHAT VERMA , ZAFAR ANSARI , ANIRBAN BASU , ABHILASH JAIN , PAWAN KUMAR , SUNIL KUMAR , VINEET PANDITA , DHAWAL PATEL , RAKESH RANJAN , SHUBHAM SRIVASTAVA , SHARAT SINGH
IPC分类号： G06F17/30
CPC分类号： G06F16/1748 , G06F16/162 , G06F16/24535 , G06F16/24552 , G06F16/9574
摘要： A computer implemented system and method for implementing a dynamically correcting cache is disclosed. The dynamically correcting cache is capable of correcting itself by dynamically reflecting any modifications inflicted upon the data/information to be stored in the cache memory. Further, the cache memory is refreshed at predetermined time intervals and also based on predetermined criteria, thereby ensuring a high cache hit rate. The dynamically correcting cache memory is bypassed for certain user queries prioritized based on a predetermined criteria. The dynamically correcting cache manages an inventory shared between multiple non-cooperative web-based, computer-implemented platforms. The dynamically correcting cache is directed to reducing caching errors in web based computer implemented platforms. The dynamically correcting cache responds to rapid changes associated with (online) behavior of users accessing web based computer implemented platforms by dynamically configuring TTL (Time-To-Live) values, in order to ensure that the data/information stored in cache memory remains accurate.
摘要翻译：公开了一种用于实现动态校正高速缓存的计算机实现的系统和方法。动态校正高速缓存能够通过动态地反映对要存储在高速缓冲存储器中的数据/信息进行的任何修改来校正自身。此外，高速缓冲存储器以预定的时间间隔并且还基于预定标准刷新，从而确保高缓存命中率。基于预定标准优先考虑某些用户查询，绕过动态校正高速缓冲存储器。动态校正缓存管理在多个非合作的基于网络的计算机实现的平台之间共享的库存。动态校正缓存旨在减少基于Web的计算机实现平台中的缓存错误。动态校正缓存响应于通过动态配置TTL（生存时间）值来访问基于Web的计算机实现的平台的用户的（在线）行为的相关快速变化，以便确保存储在高速缓冲存储器中的数据/信息保持准确。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式