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

1. 发明授权

US09020892B2 Efficient metadata storage 有权
标题翻译：高效的元数据存储
公开(公告)号：US09020892B2
公开(公告)日：2015-04-28
申请号：US13178748
申请日：2011-07-08
申请人： Kevin Andrew Chan , Bruce Wayne Copeland , Aakash Kambuj
发明人： Kevin Andrew Chan , Bruce Wayne Copeland , Aakash Kambuj
IPC分类号： G06F17/30
CPC分类号： G06F17/30132
摘要： One or more techniques and/or systems are disclosed for efficiently storing metadata of partitioned data (e.g., directed to a specific individual/user). A first subset of data is identified from the set of partitioned data. The first subset of data comprises data that has a high frequency of access, and may be identified, at least in part, by frequency of access metadata that is associated with the data in the set. Metadata, such as discovery information, permissions, version info, etc., that is associated with the data in the first subset can be stored in low latency (e.g., fast) storage, proving more efficient access. Metadata associated with data from the set of partitioned data that is not in the first subset (e.g., that is not accessed frequently) can be stored in higher latency (e.g., slower, less expensive) storage.
摘要翻译：公开了一种或多种技术和/或系统，用于有效地存储分区数据的元数据（例如，定向到特定个人/用户）。数据的第一子集从分割数据集中识别。数据的第一子集包括具有高频率访问的数据，并且可以至少部分地通过与集合中的数据相关联的访问元数据的频率来识别。与第一子集中的数据相关联的诸如发现信息，许可，版本信息等的元数据可以以低延迟（例如，快速）存储来存储，从而证明更有效的访问。与来自不在第一子集（例如，不被频繁访问）的分组数据集合的数据相关联的元数据可以以较高等待时间（例如较慢，较便宜）的存储存储。

2. 发明申请

US20050177556A1 Systems and methods for transforming SQL syntax trees into relational algebra representations 审中-公开
标题翻译：将SQL语法树转换为关系代数表示的系统和方法
公开(公告)号：US20050177556A1
公开(公告)日：2005-08-11
申请号：US10776895
申请日：2004-02-10
申请人： Jun Fang , Aakash Kambuj , Evgueni Zabokritski , Honggang Zhang , Peter Carlin
发明人： Jun Fang , Aakash Kambuj , Evgueni Zabokritski , Honggang Zhang , Peter Carlin
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F16/24526
摘要： The SQL Algebrizer of the present invention comprises a plurality of algorithms to “algebrize” SQL Trees to QP Algebra using an approach that is more consistent and much more efficient than typical algebrizers. More specifically, the Algebrizer of the present invention processes a SQL Tree using a reduced number of recursive depth-first passes by performing multiple operations in a single pass. Furthermore, the Algebrizer of the present invention also performs the operation of constant folding in this single, multi-operation pass so that the QP, upon receiving the QP Algebra, needs not perform this operation at all.
摘要翻译：本发明的SQL代理器包括使用比典型的代数器更一致和更有效的方法来将“SQL树”组合到QP代数的多种算法。更具体地说，本发明的代理者通过在单程中执行多个操作，使用减少数量的递归深度优先遍历来处理SQL树。此外，本发明的代理还在该单次多操作遍中进行恒定折叠的操作，使得在接收到QP代数时，QP根本不需要执行该操作。

3. 发明申请

US20130013561A1 EFFICIENT METADATA STORAGE 有权
标题翻译：有效的元数据存储
公开(公告)号：US20130013561A1
公开(公告)日：2013-01-10
申请号：US13178748
申请日：2011-07-08
申请人： Kevin Andrew Chan , Bruce Wayne Copeland , Aakash Kambuj
发明人： Kevin Andrew Chan , Bruce Wayne Copeland , Aakash Kambuj
IPC分类号： G06F17/30
CPC分类号： G06F17/30132
摘要： One or more techniques and/or systems are disclosed for efficiently storing metadata of partitioned data (e.g., directed to a specific individual/user). A first subset of data is identified from the set of partitioned data. The first subset of data comprises data that has a high frequency of access, and may be identified, at least in part, by frequency of access metadata that is associated with the data in the set. Metadata, such as discovery information, permissions, version info, etc., that is associated with the data in the first subset can be stored in low latency (e.g., fast) storage, proving more efficient access. Metadata associated with data from the set of partitioned data that is not in the first subset (e.g., that is not accessed frequently) can be stored in higher latency (e.g., slower, less expensive) storage.
摘要翻译：公开了一种或多种技术和/或系统，用于有效地存储分区数据的元数据（例如，定向到特定个人/用户）。数据的第一子集从分割数据集中识别。数据的第一子集包括具有高频率访问的数据，并且可以至少部分地通过与集合中的数据相关联的访问元数据的频率来识别。与第一子集中的数据相关联的诸如发现信息，许可，版本信息等的元数据可以以低延迟（例如，快速）存储来存储，从而证明更有效的访问。与来自不在第一子集（例如，不被频繁访问）的分组数据集合的数据相关联的元数据可以以较高等待时间（例如较慢，较便宜）的存储存储。

4. 发明申请

US20050187980A1 Systems and methods for hosting the common language runtime in a database management system 审中-公开
标题翻译：在数据库管理系统中托管公共语言运行库的系统和方法
公开(公告)号：US20050187980A1
公开(公告)日：2005-08-25
申请号：US10776371
申请日：2004-02-10
申请人： Peter Carlin , Jose Blakeley , Balaji Rathakrishnan , Beysim Sezgin , Mason Bendixen , Xiaowei Jiang , Aakash Kambuj , Alazel Acheson
发明人： Peter Carlin , Jose Blakeley , Balaji Rathakrishnan , Beysim Sezgin , Mason Bendixen , Xiaowei Jiang , Aakash Kambuj , Alazel Acheson
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F16/252
摘要： The present invention the is directed to systems and methods for hosting the CLR in a DBMS in order to achieve reliability, scalability, security, and robustness for enabled DBMS programming features. Integrating the CLR with a DBMS enables programming features in the database such as stored procedures, functions, triggers, types, and aggregates to be written in any of the programming languages that are compiled into IL code supported by the CLR. For the various embodiments of the present invention, the CLR is hosted inside the DBMS and, instead of making requests directly to the server operating system, the CLR instead interfaces with the DBMS via DBMS APIs for such requests, and only the DBMS directly interfaces with the server operating system to access the server.
摘要翻译：本发明涉及用于在DBMS中托管CLR以便实现启用的DBMS编程特征的可靠性，可扩展性，安全性和鲁棒性的系统和方法。将CLR与DBMS集成，可以使数据库中的编程功能（例如存储过程，函数，触发器，类型和聚合）以任何编译为CLR支持的IL代码的编程语言编写。对于本发明的各种实施例，CLR托管在DBMS内部，而不是直接向服务器操作系统提出请求，而是通过用于这种请求的DBMS API而与DBMS接口，而不是DBMS直接与服务器操作系统访问服务器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式