利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

256 条记录 (耗时 0.027 秒)

    Efficient migration of binary XML across databases
    3.
    发明授权
    Efficient migration of binary XML across databases 有权
    跨数据库高效迁移二进制XML

    公开(公告)号：US08909599B2

    公开(公告)日：2014-12-09

    申请号：US11601116

    申请日：2006-11-16

    申请人： Bhushan Khaladkar ,  Nipun Agarwal ,  Asha Tarachandani ,  Sivansankaran Chandrasekar ,  Sabina Petride

    发明人： Bhushan Khaladkar ,  Nipun Agarwal ,  Asha Tarachandani ,  Sivansankaran Chandrasekar ,  Sabina Petride

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30908

    摘要： Techniques are provided for transporting subset of databases containing binary XML data. In one embodiment, a method is provided that allows transporting binary XML data that conforms to schema by also transporting the schema entries that are necessary to derive the binary XML. In another embodiment, a method is provided that allows transporting binary XML data that does not conform to schema by also transporting the token tables that contain the mapping for the binary XML.

    摘要翻译： 提供了用于传输包含二进制XML数据的数据库的子集的技术。 在一个实施例中，提供了一种方法，其允许传送符合模式的二进制XML数据，还传送导出二进制XML所必需的模式条目。 在另一个实施例中，提供了一种方法，其允许通过还传送包含二进制XML的映射的令牌表来传输不符合模式的二进制XML数据。

    Efficient migration of binary XML across databases
    4.
    发明申请
    Efficient migration of binary XML across databases 有权
    跨数据库高效迁移二进制XML

    公开(公告)号：US20080120351A1

    公开(公告)日：2008-05-22

    申请号：US11601116

    申请日：2006-11-16

    申请人： Bhushan Khaladkar ,  Nipun Agarwal ,  Asha Tarachandani ,  Sivansankaran Chandrasekar ,  Sabina Petride

    发明人： Bhushan Khaladkar ,  Nipun Agarwal ,  Asha Tarachandani ,  Sivansankaran Chandrasekar ,  Sabina Petride

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30908

    摘要： Techniques are provided for transporting subset of databases containing binary XML data. In one embodiment, a method is provided that allows transporting binary XML data that conforms to schema by also transporting the schema entries that are necessary to derive the binary XML. In another embodiment, a method is provided that allows transporting binary XML data that does not conform to schema by also transporting the token tables that contain the mapping for the binary XML.

    摘要翻译： 提供了用于传输包含二进制XML数据的数据库的子集的技术。 在一个实施例中，提供了一种方法，其允许传送符合模式的二进制XML数据，还传送导出二进制XML所必需的模式条目。 在另一个实施例中，提供了一种方法，其允许通过还传送包含二进制XML的映射的令牌表来传输不符合模式的二进制XML数据。

    EFFICIENT FILE ACCESS IN A LARGE REPOSITORY USING A TWO-LEVEL CACHE
    5.
    发明申请
    EFFICIENT FILE ACCESS IN A LARGE REPOSITORY USING A TWO-LEVEL CACHE 有权
    使用两级高速缓存的大型报表中的高效文件访问

    公开(公告)号：US20110113036A1

    公开(公告)日：2011-05-12

    申请号：US12615090

    申请日：2009-11-09

    申请人： Sam Idicula ,  Sabina Petride ,  Bhushan Khaladkar ,  Nipun Agarwal

    发明人： Sam Idicula ,  Sabina Petride ,  Bhushan Khaladkar ,  Nipun Agarwal

    IPC分类号： G06F17/30 ,  G06F12/00 ,  G06F12/08

    CPC分类号： G06F17/30097 ,  G06F12/0811 ,  G06F12/084 ,  G06F17/30929

    摘要： A two-level cache to facilitate resolving resource path expressions for a hierarchy of resources is described, which includes a system-wide shared cache and a session-level cache. The shared cache is organized as a hierarchy of hash tables that mirrors the structure of a repository hierarchy. A particular hash table in a shared cache includes information for the child resources of a particular resource. A database management system that manages a shared cache may control the amount of memory used by the cache by implementing a replacement policy for the cache based on one or more characteristics of the resources in the repository. The session-level cache is a single level cache in which information for target resources of resolved path expressions may be tracked. In the session-level cache, the resource information is associated with the entire path expression of the associated resource.

    摘要翻译： 描述了用于促进解决资源层级的资源路径表达式的两级缓存，其包括系统范围共享高速缓存和会话级缓存。 共享缓存被组织为映射存储库层次结构的散列表的层次结构。 共享缓存中的特定哈希表包括特定资源的子资源的信息。 管理共享高速缓存的数据库管理系统可以基于存储库中的资源的一个或多个特性来实现对高速缓存的替换策略来控制高速缓存所使用的存储器量。 会话级缓存是单级缓存，其中可以跟踪解析的路径表达式的目标资源的信息。 在会话级缓存中，资源信息与相关资源的整个路径表达式相关联。

    Technique to gather statistics on very large hierarchical collections in a scalable and efficient manner
    6.
    发明授权
    Technique to gather statistics on very large hierarchical collections in a scalable and efficient manner 有权
    以可扩展和高效的方式收集关于非常大的分层收藏的统计数据的技术

    公开(公告)号：US09582525B2

    公开(公告)日：2017-02-28

    申请号：US12555198

    申请日：2009-09-08

    申请人： Sam Idicula ,  Asha Tarachandani ,  Bhushan Khaladkar ,  Nipun Agarwal

    发明人： Sam Idicula ,  Asha Tarachandani ,  Bhushan Khaladkar ,  Nipun Agarwal

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30306

    摘要： Techniques are provided for efficiently collecting statistics for hierarchically-organized collections of data. A database system leverages container-level modification time stamps and stored subtree-level change information to gather statistical information from only those resources in a hierarchical collection for which the statistics have changed since the last time that statistics were gathered for the collection. A lockless data structure is also described for storing the subtree-level change information in which an identifier corresponding to each subtree in a collection containing a changed resource may be stored. This data structure may be a table that is distinct from one or more tables representing the collection. In one embodiment of the invention, the immediate parent resource of a particular modified resource may be omitted from the subtree table by leveraging modification time stamps while gathering statistics based on tracked subtree-level information.

    摘要翻译： 提供了技术来高效地收集分层组织的数据集合的统计数据。 数据库系统利用容器级修改时间戳和存储的子树级别更改信息，从上次收集统计信息以来统计信息已经更改的分层收集中的那些资源中收集统计信息。 还描述了一种无锁数据结构，用于存储子树级别改变信息，其中可以存储与包含改变的资源的集合中的每个子树对应的标识符。 该数据结构可以是与表示集合的一个或多个表不同的表。 在本发明的一个实施例中，可以通过在基于跟踪的子树级别信息收集统计信息的同时利用修改时间戳从子树表中省略特定修改资源的直接父资源。

    Techniques for efficient queries on a file system-like repository
    7.
    发明授权
    Techniques for efficient queries on a file system-like repository 有权
    用于在文件系统状态库上进行高效查询的技术

    公开(公告)号：US09146961B2

    公开(公告)日：2015-09-29

    申请号：US12618356

    申请日：2009-11-13

    申请人： Asha Tarachandani ,  Bhushan Khaladkar ,  Sam Idicula ,  Adiel Yoaz ,  Nipun Agarwal

    发明人： Asha Tarachandani ,  Bhushan Khaladkar ,  Sam Idicula ,  Adiel Yoaz ,  Nipun Agarwal

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30471 ,  G06F17/30477

    摘要： Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query.

    摘要翻译： 提供了技术来实现基于路径的分层数据访问和利用可扩展索引框架的性能改进。 可以通过使用本机对数据库系统的功能来评估操作员而不是使用通过可扩展索引机制定义的功能来优化可扩展运算符。 此外，当查询被编译时，数据库系统可以解析查询的资源路径，并且可以将资源路径的映射存储到用于查询执行计划的游标中的一个或多个资源，以避免在每次 游标用于运行查询。 光标可以依赖于在编译时资源路径所指的一个或多个资源。 这充分利用了对特定查询的评估之间的资源路径映射到特定资源的观察很少。

    Technique for efficiently evaluating a security policy
    8.
    发明授权
    Technique for efficiently evaluating a security policy 有权
    有效评估安全策略的技术

    公开(公告)号：US08584196B2

    公开(公告)日：2013-11-12

    申请号：US12114915

    申请日：2008-05-05

    申请人： Mohammed Irfan Rafiq ,  Sabina Petride ,  Sam Idicula ,  Ashwini Surpur ,  Nipun Agarwal ,  Bhushan Khaladkar ,  Tim Wing Yu

    发明人： Mohammed Irfan Rafiq ,  Sabina Petride ,  Sam Idicula ,  Ashwini Surpur ,  Nipun Agarwal ,  Bhushan Khaladkar ,  Tim Wing Yu

    IPC分类号： G06F21/00

    CPC分类号： G06F21/604

    摘要： One embodiment of the present invention provides a system for efficiently evaluating a security policy. During operation, the system retrieves one or more roles associated with the user. Next, the system checks if a session-level cache exists for a set of Access Control Entries (ACEs) which is associated with the one or more roles. If this session-level cache exists, the system returns the set of ACEs from the session-level cache. Otherwise, the system generates the set of ACEs associated with the one or more roles from an Access Control List (ACL). During operation, the system can also update the one or more roles associated with the user and update the set of ACEs based on the updated one or more roles and the ACL. The system subsequently updates the session level cache with the updated set of ACEs and updated one or more roles.

    摘要翻译： 本发明的一个实施例提供了一种用于有效评估安全策略的系统。 在操作期间，系统检索与用户相关联的一个或多个角色。 接下来，系统检查与一个或多个角色相关联的一组访问控制条目（ACE）是否存在会话级缓存。 如果此会话级缓存存在，系统会从会话级缓存中返回一组ACE。 否则，系统将从访问控制列表（ACL）生成与一个或多个角色相关联的一组ACE。 在操作期间，系统还可以更新与用户相关联的一个或多个角色，并根据更新的一个或多个角色和ACL更新ACE集合。 系统随后使用更新的一组ACE更新会话级缓存并更新一个或多个角色。

    TECHNIQUE FOR EFFICIENTLY EVALUATING A SECURITY POLICY
    9.
    发明申请
    TECHNIQUE FOR EFFICIENTLY EVALUATING A SECURITY POLICY 有权
    有效评估安全政策的技术

    公开(公告)号：US20090276824A1

    公开(公告)日：2009-11-05

    申请号：US12114915

    申请日：2008-05-05

    申请人： Mohammed Irfan Rafiq ,  Sabina Petride ,  Sam Idicula ,  Ashwini Surpur ,  Nipun Agarwal ,  Bhushan Khaladkar ,  Tim Wing Yu

    发明人： Mohammed Irfan Rafiq ,  Sabina Petride ,  Sam Idicula ,  Ashwini Surpur ,  Nipun Agarwal ,  Bhushan Khaladkar ,  Tim Wing Yu

    IPC分类号： G06F21/00

    CPC分类号： G06F21/604

    摘要： One embodiment of the present invention provides a system for efficiently evaluating a security policy. During operation, the system retrieves one or more roles associated with the user. Next, the system checks if a session-level cache exists for a set of Access Control Entries (ACEs) which is associated with the one or more roles. If this session-level cache exists, the system returns the set of ACEs from the session-level cache. Otherwise, the system generates the set of ACEs associated with the one or more roles from an Access Control List (ACL). During operation, the system can also update the one or more roles associated with the user and update the set of ACEs based on the updated one or more roles and the ACL. The system subsequently updates the session level cache with the updated set of ACEs and updated one or more roles.

    摘要翻译： 本发明的一个实施例提供了一种用于有效评估安全策略的系统。 在操作期间，系统检索与用户相关联的一个或多个角色。 接下来，系统检查与一个或多个角色相关联的一组访问控制条目（ACE）是否存在会话级缓存。 如果此会话级缓存存在，系统会从会话级缓存中返回一组ACE。 否则，系统将从访问控制列表（ACL）生成与一个或多个角色相关联的一组ACE。 在操作期间，系统还可以更新与用户相关联的一个或多个角色，并根据更新的一个或多个角色和ACL更新ACE集合。 系统随后使用更新的一组ACE更新会话级缓存并更新一个或多个角色。

    Techniques for efficient queries on a file system-like repository
    10.
    发明授权
    Techniques for efficient queries on a file system-like repository 有权

    公开(公告)号：US09043308B2

    公开(公告)日：2015-05-26

    申请号：US13351448

    申请日：2012-01-17

    申请人： Asha Tarachandani ,  Bhushan Khaladkar ,  Sam Idicula ,  Adiel Yoaz ,  Nipun Agarwal

    发明人： Asha Tarachandani ,  Bhushan Khaladkar ,  Sam Idicula ,  Adiel Yoaz ,  Nipun Agarwal

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30471 ,  G06F17/30477

    摘要： Techniques are provided to achieve performance improvements for path-based access to hierarchical data and for utilizing an extensible indexing framework. Extensible operators may be optimized by evaluating the operators using functions native to the database system instead of using functions defined through an extensible indexing mechanism. Furthermore, the database system may resolve a resource path of a query when the query is compiled, and may store the mapping of the resource path to one or more resources in a cursor for the query execution plan to avoid resolving the resource path each time the cursor is used to run the query. The cursor may be made dependent on the one or more resources to which the resource path refers at compile time. This takes advantage of the observation that the mapping of the resource path to particular resources rarely changes between evaluations of a particular query.