On-demand cache management of derived cache

    公开(公告)号:US11354252B2

    公开(公告)日:2022-06-07

    申请号:US16144926

    申请日:2018-09-27

    Abstract: Techniques related to automatic cache management are disclosed. In some embodiments, one or more non-transitory storage media store instructions which, when executed by one or more computing devices, cause performance of an automatic cache management method when a determination is made to store a first set of data in a cache. The method involves determining whether an amount of available space in the cache is less than a predetermined threshold. When the amount of available space in the cache is less than the predetermined threshold, a determination is made as to whether a second set of data has a lower ranking than the first set of data by at least a predetermined amount. When the second set of data has a lower ranking than the first set of data by at least the predetermined amount, the second set of data is evicted. Thereafter, the first set of data is cached.

    Policy driven data placement and information lifecycle management

    公开(公告)号:US11556505B2

    公开(公告)日:2023-01-17

    申请号:US17159070

    申请日:2021-01-26

    Abstract: A method, apparatus, and system for policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative policies that define the movement and transformation of stored database objects. The policies are associated with a database object and may also be inherited. A policy defines, for a database object, an archiving action to be taken, a scope, and a condition before the archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. Conditions based on access statistics can be specified at the row level and may use segment or block level heatmaps. Policy evaluation occurs periodically in the background, with actions queued as tasks for a task scheduler.

    Evaluating SQL expressions on dictionary encoded vectors

    公开(公告)号:US11294816B2

    公开(公告)日:2022-04-05

    申请号:US15397714

    申请日:2017-01-03

    Abstract: Techniques are described herein for reducing the number of redundant evaluations that occur when an expression is evaluated against an encoded column vector by caching results of expression evaluations. When executing a query that includes an expression that references columns for which dictionary-encoded column vectors exist, the database server performs a cost-based analysis to determine which expressions (or sub-expressions) would benefit from caching the expression's evaluation result. For each such expression, the database server performs the necessary computations and caches the results for each of the possible distinct input values. When evaluating an expression for a row with a particular set of input codes, a look-up is performed based on the input code combination to retrieve the pre-computed results of that evaluation from the cache.

    EVALUATING SQL EXPRESSIONS ON DICTIONARY ENCODED VECTORS

    公开(公告)号:US20170116242A1

    公开(公告)日:2017-04-27

    申请号:US15397714

    申请日:2017-01-03

    CPC classification number: G06F12/0875 G06F7/24 G06F16/2452 G06F2212/60

    Abstract: Techniques are described herein for reducing the number of redundant evaluations that occur when an expression is evaluated against an encoded column vector by caching results of expression evaluations. When executing a query that includes an expression that references columns for which dictionary-encoded column vectors exist, the database server performs a cost-based analysis to determine which expressions (or sub-expressions) would benefit from caching the expression's evaluation result. For each such expression, the database server performs the necessary computations and caches the results for each of the possible distinct input values. When evaluating an expression for a row with a particular set of input codes, a look-up is performed based on the input code combination to retrieve the pre-computed results of that evaluation from the cache.

    AUTOMATED INFORMATION LIFECYCLE MANAGEMENT USING LOW ACCESS PATTERNS
    9.
    发明申请
    AUTOMATED INFORMATION LIFECYCLE MANAGEMENT USING LOW ACCESS PATTERNS 有权
    自动化信息使用低访问模式的生物管理

    公开(公告)号:US20140095448A1

    公开(公告)日:2014-04-03

    申请号:US13826075

    申请日:2013-03-14

    Abstract: A method, apparatus, and system for automated information lifecycle management using low access patterns in a database management system are provided. A user or the database can store policy data that defines an archiving action when meeting an activity-level condition on one or more database objects. The archiving actions may include compression, data movement, and other actions to place the database object in an appropriate storage tier for a lifecycle phase of the database object. The activity-level condition may specify the database object meeting a low access pattern, optionally for a minimum time period. Various criteria including access statistics for the database object and cost characteristics of current and target compression levels or storage tiers may be considered to determine the meeting of the activity-level condition. The policies may be evaluated on an adjustable periodic basis and may utilize a task scheduler for minimal performance impact.

    Abstract translation: 提供了一种在数据库管理系统中使用低访问模式的自动信息生命周期管理的方法,装置和系统。 用户或数据库可以存储在满足一个或多个数据库对象上的活动级别条件时定义归档操作的策略数据。 归档操作可以包括压缩,数据移动和其他动作,以将数据库对象放置在数据库对象的生命周期阶段的适当的存储层中。 活动级别条件可以指定满足低访问模式的数据库对象,可选地在最短时间段内。 可以考虑包括数据库对象的访问统计和当前和目标压缩级别或存储层的成本特征的各种标准来确定活动级别条件的会议。 这些策略可以在可调周期的基础上进行评估,并且可以利用任务调度器来最小的性能影响。

    POLICY DRIVEN DATA PLACEMENT AND INFORMATION LIFECYCLE MANAGEMENT

    公开(公告)号:US20210149847A1

    公开(公告)日:2021-05-20

    申请号:US17159070

    申请日:2021-01-26

    Abstract: A method, apparatus, and system for policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative policies that define the movement and transformation of stored database objects. The policies are associated with a database object and may also be inherited. A policy defines, for a database object, an archiving action to be taken, a scope, and a condition before the archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. Conditions based on access statistics can be specified at the row level and may use segment or block level heatmaps. Policy evaluation occurs periodically in the background, with actions queued as tasks for a task scheduler.

Patent Agency Ranking