会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Multi-user system with dynamic data source selection
    • 具有动态数据源选择的多用户系统
    • US08799489B2
    • 2014-08-05
    • US10186328
    • 2002-06-27
    • Edward Shaw-Lee SuenSunil Prabhakar Dixit
    • Edward Shaw-Lee SuenSunil Prabhakar Dixit
    • G06F15/16
    • G06F17/30522
    • Techniques to dynamically select data sources for users and to direct queries for the users to the proper data sources. Initially, user information (e.g., user name) for each user is received and used to determine a data source designated for the user. The designated data source may be determined via a look-up table or by running a query with the user information to obtain the identity (e.g., the logical name) of the data source. A data source variable for each user can then be set to the identity of the designated data source. Thereafter, queries for each user are directed to the user's designated data source by determining database connection information for the designated data source based on the data source variable and using this information to direct the queries.
    • 为用户动态选择数据源的技术,并将用户的查询引导到正确的数据源。 最初,接收每个用户的用户信息(例如,用户名),并用于确定为用户指定的数据源。 指定的数据源可以通过查找表来确定,或者通过运行具有用户信息的查询来获得数据源的身份(例如,逻辑名称)。 然后可以将每个用户的数据源变量设置为指定数据源的标识。 此后,通过基于数据源变量确定指定数据源的数据库连接信息并使用该信息来指导查询,将针对每个用户的查询定向到用户的指定数据源。
    • 3. 发明授权
    • Optimization for aggregate navigation for distinct count metrics
    • 不同计数指标的汇总导览优化
    • US07707144B2
    • 2010-04-27
    • US10994905
    • 2004-11-22
    • Ashish MittalEdward Shaw-Lee Suen
    • Ashish MittalEdward Shaw-Lee Suen
    • G06F17/30
    • G06F17/30457G06F17/30489Y10S707/99933
    • A method and apparatus for performing a distinct count metric by utilizing aggregate navigation. For a distinct count query of an identifier of a detail table, where the query specifies zero or more restrictions, an aggregate table associated with the detail table is identified. It is then determined whether the aggregate table contains the identifier that is being distinct counted, and if so, whether the identifier is different in every row of the aggregate table. If it is, then the rows of the aggregate table that satisfy the specified restrictions are plain counted to obtain a result for the distinct count query. If the identifier is not different in every row of the aggregate table, a distinct count operation is performed on the rows of the aggregate table that satisfy the specified restrictions to obtain a result for the distinct count query.
    • 一种通过利用聚合导航来执行不同计数度量的方法和装置。 对于详细表的标识符的不同计数查询,其中查询指定零个或多个限制,则识别与详细表相关联的聚合表。 然后确定聚合表是否包含不同的计数的标识符,如果是,则标识符在聚合表的每一行中是否不同。 如果是,那么满足指定限制的聚合表的行被简单地计数,以获得不同的计数查询的结果。 如果标识符在聚合表的每一行中都不相同,则对满足指定限制的聚合表的行执行不同的计数操作,以获取不同计数查询的结果。
    • 4. 发明授权
    • Detecting and processing cache hits for queries with aggregates
    • 检测和处理具有聚合的查询的缓存命中
    • US07499910B2
    • 2009-03-03
    • US10186344
    • 2002-06-27
    • Donovan Alfred SchneiderEdward Shaw-Lee SuenKazi Atif-Uz Zaman
    • Donovan Alfred SchneiderEdward Shaw-Lee SuenKazi Atif-Uz Zaman
    • G06F17/30
    • G06F17/30483Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/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.
    • 通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术,通过允许不精确的匹配来提高缓存命中率。 首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。 此列表可能包括所有缓存的查询,包含精选列表项的精确匹配的缓存查询,或包含精确和/或不精确匹配的缓存查询。 然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中,其指示候选查询可以用于回答新查询。 评估是使用一组规则执行的,这些规则允许在新查询中聚合的不精确匹配(如果有)。 基于具有高速缓存命中的特定候选查询,为新查询生成查询计划。
    • 5. 发明授权
    • Detecting and processing cache hits for queries with aggregates
    • 检测和处理具有聚合的查询的缓存命中
    • US09563662B2
    • 2017-02-07
    • US11931947
    • 2007-10-31
    • Donovan Alfred SchneiderEdward Shaw-Lee SuenKazi Atif-Uz Zaman
    • Donovan Alfred SchneiderEdward Shaw-Lee SuenKazi Atif-Uz Zaman
    • G06F7/00G06F17/30
    • G06F17/30483Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/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.
    • 通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术,通过允许不精确的匹配来提高缓存命中率。 首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。 此列表可能包括所有缓存的查询,包含精选列表项的精确匹配的缓存查询,或包含精确和/或不精确匹配的缓存查询。 然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中,其指示候选查询可以用于回答新查询。 评估是使用一组规则执行的,这些规则允许在新查询中聚合的不精确匹配(如果有)。 基于具有高速缓存命中的特定候选查询,为新查询生成查询计划。