会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Index-only tables with nested group keys
    • 具有嵌套组密钥的仅索引表
    • US5852822A
    • 1998-12-22
    • US764112
    • 1996-12-09
    • Jagannathan SrinivasanSamuel DeFazioJayanta BanerjeeChuck FreiwaldSouripriya Das
    • Jagannathan SrinivasanSamuel DeFazioJayanta BanerjeeChuck FreiwaldSouripriya Das
    • G06F17/30G06F17/00
    • G06F17/30327Y10S707/99933Y10S707/99934Y10S707/99936Y10S707/99952
    • A method and apparatus for building, maintaining, and using a multi-level index is provided. The multi-level index is accessed using a key. The key is divided into multiple portions referred to as sub-keys. The first level of the multi-level index is built on a first-level sub-key. Each index entry at the first-level is for a particular first-level sub-key value, and either includes sub-entries associated with second-level sub-key values or a reference to a second-level data retrieval structure. All second-level data retrieval structures are built on the portion of the key that has been designated as the second-level sub-key. As the vocabulary of the first-level sub-key becomes exhausted, fewer maintenance operations will have to be performed to maintain the first-level data retrieval structure. This decreases the overhead and increases the concurrency in a database system that uses the multiple-level index. The multi-level index structure is especially suited for queries that retrieve all values for a given first-level sub-key. The structure also has reduced storage costs compared to a single-level index structure, since first-level sub-key values are stored only once for each nested group.
    • 提供了一种用于构建,维护和使用多级索引的方法和装置。 使用密钥访问多级索引。 密钥分为多个部分,称为子密钥。 多级索引的第一级建立在一级子密钥上。 第一级的每个索引条目用于特定的一级子密钥值,并且包括与二级子密钥值相关联的子条目或对二级数据检索结构的引用。 所有二级数据检索结构都建立在已被指定为二级子密钥的密钥部分上。 由于第一级子密钥的词汇量已经耗尽,因此维护第一级数据检索结构将不得不执行较少的维护操作。 这降低了开销,并增加了使用多级索引的数据库系统中的并发性。 多级索引结构特别适用于检索给定一级子密钥的所有值的查询。 与单级索引结构相比,结构也降低了存储成本,因为对于每个嵌套组,一级子键值只存储一次。
    • 4. 发明申请
    • Access control for graph data
    • 图形数据访问控制
    • US20100268722A1
    • 2010-10-21
    • US12386560
    • 2009-04-20
    • Aravind YalamanchiJayanta BanerjeeSouripriya Das
    • Aravind YalamanchiJayanta BanerjeeSouripriya Das
    • G06F17/30
    • G06F17/30958
    • Systems, methods, and other embodiments associated with access control for graph data at the instance-level are described. One example method includes accepting data access constraints that are expressed as match and apply pattern pairs to enforce security policies. A user query on graph data with a security policy restricts the returned data to data that the user is authorized to access. For this purpose, a user query that includes query selection criteria corresponding to one or more match pattern criteria based on the resource referenced in the query is rewritten to include security conditions specified in the associated apply pattern to restrict access to the graph data.
    • 描述了与在实例级别的图形数据的访问控制相关联的系统,方法和其他实施例。 一个示例性方法包括接受表示为匹配的数据访问约束,并应用模式对以执行安全策略。 对具有安全策略的图形数据的用户查询将返回的数据限制为用户被授权访问的数据。 为此,重写包括基于查询中引用的资源的与一个或多个匹配模式标准相对应的查询选择标准的用户查询,以包括在相关联的应用模式中指定的安全条件以限制对图形数据的访问。
    • 6. 发明授权
    • Access control for graph data
    • 图形数据访问控制
    • US08250048B2
    • 2012-08-21
    • US12386560
    • 2009-04-20
    • Aravind YalamanchiJayanta BanerjeeSouripriya Das
    • Aravind YalamanchiJayanta BanerjeeSouripriya Das
    • G06F7/00
    • G06F17/30958
    • Systems, methods, and other embodiments associated with access control for graph data at the instance-level are described. One example method includes accepting data access constraints that are expressed as match and apply pattern pairs to enforce security policies. A user query on graph data with a security policy restricts the returned data to data that the user is authorized to access. For this purpose, a user query that includes query selection criteria corresponding to one or more match pattern criteria based on the resource referenced in the query is rewritten to include security conditions specified in the associated apply pattern to restrict access to the graph data.
    • 描述了与在实例级别的图形数据的访问控制相关联的系统,方法和其他实施例。 一个示例性方法包括接受表示为匹配的数据访问约束,并应用模式对以执行安全策略。 对具有安全策略的图形数据的用户查询将返回的数据限制为用户被授权访问的数据。 为此,重写包括基于查询中引用的资源的与一个或多个匹配模式标准相对应的查询选择标准的用户查询,以包括在相关联的应用模式中指定的安全条件以限制对图形数据的访问。
    • 8. 发明授权
    • Database system that provides for history-enabled tables
    • 提供启用历史记录的表的数据库系统
    • US09384222B2
    • 2016-07-05
    • US13440702
    • 2012-04-05
    • Jayanta BanerjeeRobert HanckelSiva Ravada
    • Jayanta BanerjeeRobert HanckelSiva Ravada
    • G06F17/30
    • G06F17/30306
    • Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The start time field's value in a row of the history-enabled table indicates when the contents of the row last changed. The rows of the history table are copies of rows of the history-enabled table that have been deleted or updated. The rows include end time fields whose values indicate when the row was updated or deleted. A history table's row thus indicates a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table.
    • 用于历史的技术,使数据库系统中的表能够使历史启用的表的行的历史版本可用于时间查询。 通过向表中添加开始时间列并为启用历史记录的表创建历史记录表来启用表。 历史使能表中的行的起始时间字段的值指示行的内容何时更改。 历史记录表的行是已经被删除或更新的启用历史记录的表的行的副本。 这些行包括结束时间字段,其值指示行何时更新或删除。 历史表格的行因此表示历史记录表的行在启用历史记录的表中的一段时间。 时间查询是在具有历史记录功能的表和历史记录表的联合的视图上执行的。
    • 9. 发明申请
    • Database system that provides for history-enabled tables
    • 提供启用历史记录的表的数据库系统
    • US20070130226A1
    • 2007-06-07
    • US11291446
    • 2005-12-01
    • Jayanta BanerjeeRobert HanckelSiva Ravada
    • Jayanta BanerjeeRobert HanckelSiva Ravada
    • G06F17/30
    • G06F17/30306
    • Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The start time field's value in a row of the history-enabled table indicates when the contents of the row last changed. The rows of the history table are copies of rows of the history-enabled table that have been deleted or updated. The rows include end time fields whose values indicate when the row was updated or deleted. A history table's row thus indicates a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table.
    • 用于历史的技术,使数据库系统中的表能够使历史启用的表的行的历史版本可用于时间查询。 通过向表中添加开始时间列并为启用历史记录的表创建历史记录表来启用表。 历史使能表中的行的起始时间字段的值指示行的内容何时更改。 历史记录表的行是已经被删除或更新的启用历史记录的表的行的副本。 这些行包括结束时间字段,其值指示行何时更新或删除。 历史表格的行因此表示历史记录表的行在启用历史记录的表中的一段时间。 时间查询是在具有历史记录功能的表和历史记录表的联合的视图上执行的。
    • 10. 发明授权
    • Buffering a hierarchical index of multi-dimensional data
    • 缓冲多维数据的分层索引
    • US06470344B1
    • 2002-10-22
    • US09384648
    • 1999-08-27
    • Ravi KothuriSiva RavadaJayant SharmaJayanta BanerjeeAmbuj Singh
    • Ravi KothuriSiva RavadaJayant SharmaJayanta BanerjeeAmbuj Singh
    • G06F1730
    • G06F17/30327G06F17/30333G06F17/30592Y10S707/957Y10S707/99945
    • Methods are provided for buffering nodes of a hierarchical index (e.g., R-tree, bang file, hB-tree) during operations on multi-dimensional data represented by the index. The methods are particularly suited for query operations, and a different method may be more suitable for one pattern of queries than another. Where queries are distributed in a relatively uniform manner across the domain or dataspace of an index, a node-area buffering method is provided. In this method nodes are cached or buffered in order of their respective areas (e.g., their minimum bounding areas), and a node having a smaller area will be replaced in cache before a node having a larger area. When, however, queries are not uniformly distributed, then a least frequently accessed buffering technique may be applied. According to this method statistics are maintained concerning the frequency with which individual index nodes are accessed. Those accessed less frequently are replaced in cache before those accessed more frequently. Yet another, generic, buffering strategy is provided that is suitable for all patterns of query distribution. In accordance with this method, whenever a node must be removed from cache in order to make room for a newly accessed node, cached nodes are compared to each other to determine which provides the least caching benefit and may therefore be ejected. A comparison may involve three factors—the difference in the nodes' areas, the difference in the frequency with which they have been accessed and the difference between their latest access times. These factors may be weighted to give them more or less effect in relation to each other.
    • 提供了用于在由索引表示的多维数据的操作期间缓冲分层索引(例如,R-tree,bang文件,hB-树)的节点的方法。 这些方法特别适用于查询操作,并且不同的方法可能比另一种更适合于一种查询模式。 在索引的域或数据空间中以相对均匀的方式分布查询的情况下,提供了节点区域缓冲方法。 在这种方法中,节点按照它们各自的区域(例如,它们的最小边界区域)的顺序进行缓存或缓冲,并且具有较小区域的节点将在具有较大面积的节点之前在高速缓存中被替换。 然而,当查询不是均匀分布时,则可以应用最不频繁访问的缓冲技术。 根据该方法,关于访问各个索引节点的频率来维持统计。 访问次数较少的用户在更频繁访问的缓存中被替换。 提供了另一种适用于所有查询分发模式的通用缓冲策略。 根据该方法,每当节点必须从高速缓存中移除以便为新访问的节点腾出空间时,将缓存的节点彼此进行比较,以确定哪个节点提供最小的缓存优点并且因此可以被弹出。 比较可能涉及三个因素 - 节点区域的差异,访问频率的差异以及其最新访问时间之间的差异。 这些因素可能被加权,以使他们或多或少相互影响。