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

1. 发明授权

US09563662B2 Detecting and processing cache hits for queries with aggregates 有权
标题翻译：检测和处理具有聚合的查询的缓存命中
公开(公告)号：US09563662B2
公开(公告)日：2017-02-07
申请号：US11931947
申请日：2007-10-31
申请人： Donovan Alfred Schneider , Edward Shaw-Lee Suen , Kazi Atif-Uz Zaman
发明人： Donovan Alfred Schneider , Edward Shaw-Lee Suen , Kazi Atif-Uz Zaman
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30483 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
摘要翻译：通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术，通过允许不精确的匹配来提高缓存命中率。首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。此列表可能包括所有缓存的查询，包含精选列表项的精确匹配的缓存查询，或包含精确和/或不精确匹配的缓存查询。然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中，其指示候选查询可以用于回答新查询。评估是使用一组规则执行的，这些规则允许在新查询中聚合的不精确匹配（如果有）。基于具有高速缓存命中的特定候选查询，为新查询生成查询计划。

2. 发明授权

US07499910B2 Detecting and processing cache hits for queries with aggregates 有权
标题翻译：检测和处理具有聚合的查询的缓存命中
公开(公告)号：US07499910B2
公开(公告)日：2009-03-03
申请号：US10186344
申请日：2002-06-27
申请人： Donovan Alfred Schneider , Edward Shaw-Lee Suen , Kazi Atif-Uz Zaman
发明人： Donovan Alfred Schneider , Edward Shaw-Lee Suen , Kazi Atif-Uz Zaman
IPC分类号： G06F17/30
CPC分类号： G06F17/30483 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
摘要翻译：通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术，通过允许不精确的匹配来提高缓存命中率。首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。此列表可能包括所有缓存的查询，包含精选列表项的精确匹配的缓存查询，或包含精确和/或不精确匹配的缓存查询。然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中，其指示候选查询可以用于回答新查询。评估是使用一组规则执行的，这些规则允许在新查询中聚合的不精确匹配（如果有）。基于具有高速缓存命中的特定候选查询，为新查询生成查询计划。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式