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

21. 发明申请

US20070143363A1 Label-aware B-tree-like index for efficient queries in a versioning system 有权
标题翻译：用于在版本控制系统中进行高效查询的标签感知B树状索引
公开(公告)号：US20070143363A1
公开(公告)日：2007-06-21
申请号：US11313526
申请日：2005-12-20
申请人： Nipun Agarwal , Sam Idicula , Thomas Baby , Eric Sedlar
发明人： Nipun Agarwal , Sam Idicula , Thomas Baby , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99954
摘要： A mechanism for querying a label-aware index in the context of versioning is provided. The key of the label-aware index is a composite key and includes a unique label identifier, corresponding to a specific label, and the key of the original index, which key itself may be a composite key. The label-aware index may be implemented as an index-organized table. The label-aware index is organized on disk first by the label identifier and then by the original index key so that queries of versions of resources within a particular label are as efficient as queries on an index of an unversioned repository with the same number of resources.
摘要翻译：提供了一种用于在版本控制的上下文中查询标签感知索引的机制。标签感知索引的密钥是复合密钥，并且包括对应于特定标签的唯一标签标识符和原始索引的密钥，该密钥本身可以是复合密钥。标签感知索引可以被实现为索引组织表。标签感知索引首先由标签标识符组织，然后由原始索引键组织，以便特定标签内的资源版本的查询与具有相同数量资源的未版本化存储库的索引上的查询一样有效。

22. 发明申请

US20070136382A1 Efficient path-based operations while searching across versions in a repository 有权
标题翻译：高效的基于路径的操作，同时在存储库中的版本中进行搜索
公开(公告)号：US20070136382A1
公开(公告)日：2007-06-14
申请号：US11304414
申请日：2005-12-14
申请人： Sam Idicula , Thomas Baby , Nipun Agarwal , Ravi Murthy
发明人： Sam Idicula , Thomas Baby , Nipun Agarwal , Ravi Murthy
IPC分类号： G06F17/30
CPC分类号： G06F17/30235 , G06F17/30533
摘要： A technique and mechanism for efficiently searching across multiple versions of a resource is provided. New operators are provided that take into account the versions of a particular resource. The query engine evaluates the new operators using either an index-based approach or a functional approach. Under an index-based implementation, a hierarchical index is traversed to find a particular resource (or resources) associated with a specified path and the version history identifier associated with the particular resource(s). A version history table containing references to all versions of the particular resource(s) are then obtained. Under the functional implementation, a link table, which contains all paths in a user's workspace, is examined to determine whether the version history identifier of a particular resource matches a version history identifier of a resource specified in the link table and whether the path to the resource in the link table is related to the path specified.
摘要翻译：提供了一种有效地搜索资源的多个版本的技术和机制。提供新的运营商，考虑到特定资源的版本。查询引擎使用基于索引的方法或功能方法来评估新的运算符。在基于索引的实现下，遍历分层索引以找到与指定路径相关联的特定资源（或资源）以及与特定资源相关联的版本历史标识符。然后获得包含对特定资源的所有版本的引用的版本历史表。在功能实现下，检查包含用户工作空间中的所有路径的链接表，以确定特定资源的版本历史标识符是否与链接表中指定的资源的版本历史标识符是否匹配，链接表中的资源与指定的路径相关。

23. 发明授权

US09244979B2 Determining predicate selectivity in query costing 有权
标题翻译：确定查询成本计算中的谓词选择性
公开(公告)号：US09244979B2
公开(公告)日：2016-01-26
申请号：US12127971
申请日：2008-05-28
申请人： Ning Zhang , Thomas Baby , Nipun Agarwal
发明人： Ning Zhang , Thomas Baby , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30469
摘要： Techniques for estimating a cost of executing a query are provided. A query includes multiple predicates, each of which is associated with a selectivity value that indicates a percentage of input that satisfies the condition of the corresponding predicate. The selectivity values are used to determine an estimated cost of executing the query. In one technique, a group of multiple predicates of a query are treated as a single predicate. Thus, a single selectivity value, rather than multiple selectivity values, is determined for that group. In a related technique, instead of determining a selectivity value of a predicate in isolation with respect to other predicates of a query, the selectivity value of a set of one or more predicates in a query is generated based on other predicates in the query.
摘要翻译：提供了用于估计执行查询的成本的技术。查询包括多个谓词，每个谓词与选择性值相关联，该选择性值指示满足相应谓词条件的输入百分比。选择性值用于确定执行查询的估计成本。在一种技术中，一组查询的多个谓词被视为单个谓词。因此，为该组确定单个选择性值，而不是多个选择性值。在相关技术中，代替相对于查询的其他谓词来隔离地确定谓词的选择性值，而不是基于查询中的其他谓词生成查询中的一个或多个谓词的选择性值。

24. 发明授权

US07814117B2 Accessing data from asynchronously maintained index 有权
标题翻译：从异步维护的索引访问数据
公开(公告)号：US07814117B2
公开(公告)日：2010-10-12
申请号：US11784341
申请日：2007-04-05
申请人： Thomas Baby , Sivasankaran Chandrasekar , Nipun Agarwal
发明人： Thomas Baby , Sivasankaran Chandrasekar , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30911 , G06F17/30368 , G06F17/30938
摘要： A method and apparatus for computing queries in a way that is consistent with an index and the underlying base table is provided. A query is computed such that it is consistent with the state of an index and base table as of the last point at which the index and table were synchronized. For example, if an index is maintained asynchronously then it is not necessarily consistent with its base table when a query is to be run against the table and the index. Therefore, the query is computed such that it will be consistent with the last point at which the index and the table were synchronized. In one embodiment, a System Change Number (SCN) of the last successful synchronization operation is used to perform a flashback query on the table.
摘要翻译：提供了一种以与索引和底层基表一致的方式计算查询的方法和装置。计算一个查询，使得它与索引和基表的状态一致，该索引和基表与索引和表同步的最后一个点相同。例如，如果异步维护索引，则当要对表和索引运行查询时，它不一定与其基表一致。因此，计算查询使其与索引和表同步的最后一个点一致。在一个实施例中，使用上一次成功同步操作的系统更改编号（SCN）来对表执行闪回查询。

25. 发明申请

US20100030727A1 Technique For Using Occurrence Constraints To Optimize XML Index Access 审中-公开
标题翻译：使用发生约束优化XML索引访问的技术
公开(公告)号：US20100030727A1
公开(公告)日：2010-02-04
申请号：US12181745
申请日：2008-07-29
申请人： Sivasankaran Chandrasekar , Thomas Baby , Asha Tarachandani , Nipun Agarwal
发明人： Sivasankaran Chandrasekar , Thomas Baby , Asha Tarachandani , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F16/81 , G06F16/8365
摘要： Approaches are provided for improving the performance of certain database queries that operate on binary-encoded XML. In particular, the approach uses occurrence and type constraint information about XML data stored in the database for optimizing the relational rewrite of a query. Constraint information can be obtained in several different ways including through a formal language specification such as an XML Schema or DTD, through discovery of a user-provided secondary index on a an XML path table, or through a structural summary that is derived from statistical analysis on a set of XML documents stored in the database.
摘要翻译：提供了一些方法来提高对二进制编码的XML进行操作的某些数据库查询的性能。特别地，该方法使用关于存储在数据库中的XML数据的出现和类型约束信息来优化查询的关系重写。约束信息可以通过几种不同的方式获得，包括通过诸如XML模式或DTD的形式语言规范，通过在XML路径表上发现用户提供的辅助索引，或通过从统计分析得出的结构性摘要来获得约束信息在一组存储在数据库中的XML文档中。

26. 发明授权

US07958112B2 Interleaving query transformations for XML indexes 有权
标题翻译：交织XML索引的查询变换
公开(公告)号：US07958112B2
公开(公告)日：2011-06-07
申请号：US12189007
申请日：2008-08-08
申请人： Sivasankaran Chandrasekar , Asha Tarachandani , Thomas Baby , Nipun Agarwal
发明人： Sivasankaran Chandrasekar , Asha Tarachandani , Thomas Baby , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30935
摘要： During query optimization, XML index and view merge transformations may be interleaved.
摘要翻译：在查询优化期间，XML索引和视图合并转换可能会被交错。

27. 发明申请

US20100036825A1 Interleaving Query Transformations For XML Indexes 有权
标题翻译：交织XML索引的查询转换
公开(公告)号：US20100036825A1
公开(公告)日：2010-02-11
申请号：US12189007
申请日：2008-08-08
申请人： Sivasankaran Chandrasekar , Asha Tarachandani , Thomas Baby , Nipun Agarwal
发明人： Sivasankaran Chandrasekar , Asha Tarachandani , Thomas Baby , Nipun Agarwal
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30935
摘要： During query optimization, XML index and view merge transformations may be interleaved.
摘要翻译：在查询优化期间，XML索引和视图合并转换可能会被交错。

28. 发明授权

US07836098B2 Accelerating value-based lookup of XML document in XQuery 有权
标题翻译：在XQuery中加速基于价值的XML文档查找
公开(公告)号：US07836098B2
公开(公告)日：2010-11-16
申请号：US11827801
申请日：2007-07-13
申请人： Thomas Baby , Sivasankaran Chandrasekar , Asha Tarachandani , Nipun Agarwal
发明人： Thomas Baby , Sivasankaran Chandrasekar , Asha Tarachandani , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30938
摘要： A method and apparatus for accelerating value-based lookups of XML documents in XQuery is provided. XML indices can help to optimize SQL queries of XML documents stored in object-relational databases. Certain SQL/XML functions such as XMLTABLE( ) use XQuery expressions to query XML documents. Previously, such queries could not use the XML index because the PATH table of the XML index was not defined for XQuery semantics. Techniques described herein extend the XML index for use with queries that require evaluation of XQuery expressions. Consequently, techniques described herein accelerate value-based lookups of XML documents in XQuery by introducing the possibility of an index-assisted evaluation of XQuery expressions.
摘要翻译：提供了一种用于在XQuery中加速基于价值的XML文档查找的方法和装置。 XML索引可以帮助优化存储在对象关系数据库中的XML文档的SQL查询。某些SQL / XML函数（如XMLTABLE（））使用XQuery表达式来查询XML文档。以前，这样的查询无法使用XML索引，因为XML索引的PATH表未针对XQuery语义进行定义。本文中描述的技术扩展了XML索引，以便与需要评估XQuery表达式的查询一起使用。因此，本文描述的技术通过引入XQuery表达式的索引辅助评估的可能性来加速XQuery中的XML文档的基于值的查找。

29. 发明申请

US20090299989A1 DETERMINING PREDICATE SELECTIVITY IN QUERY COSTING 有权
标题翻译：确定查询成本中的预测选择
公开(公告)号：US20090299989A1
公开(公告)日：2009-12-03
申请号：US12127971
申请日：2008-05-28
申请人： Ning Zhang , Thomas Baby , Nipun Agarwal
发明人： Ning Zhang , Thomas Baby , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30469
摘要： Techniques for estimating a cost of executing a query are provided. A query includes multiple predicates, each of which is associated with a selectivity value that indicates a percentage of input that satisfies the condition of the corresponding predicate. The selectivity values are used to determine an estimated cost of executing the query. In one technique, a group of multiple predicates of a query are treated as a single predicate. Thus, a single selectivity value, rather than multiple selectivity values, is determined for that group. In a related technique, instead of determining a selectivity value of a predicate in isolation with respect to other predicates of a query, the selectivity value of a set of one or more predicates in a query is generated based on other predicates in the query.
摘要翻译：提供了用于估计执行查询的成本的技术。查询包括多个谓词，每个谓词与选择性值相关联，该选择性值指示满足相应谓词条件的输入百分比。选择性值用于确定执行查询的估计成本。在一种技术中，一组查询的多个谓词被视为单个谓词。因此，为该组确定单个选择性值，而不是多个选择性值。在相关技术中，代替相对于查询的其他谓词来隔离地确定谓词的选择性值，而不是基于查询中的其他谓词生成查询中的一个或多个谓词的选择性值。

30. 发明授权

US07840609B2 Using sibling-count in XML indexes to optimize single-path queries 有权
标题翻译：在XML索引中使用sibling-count来优化单路径查询
公开(公告)号：US07840609B2
公开(公告)日：2010-11-23
申请号：US11888415
申请日：2007-07-31
申请人： Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
发明人： Sivasankaran Chandrasekar , Ravi Murthy , Thomas Baby , Nipun Agarwal
IPC分类号： G06F7/00
CPC分类号： G06F17/30935 , G06F17/30442
摘要： A method and apparatus are provided for using sibling-counts in XML indices to optimize single-path queries. Using a b-tree XML index with a SQL query logarithmically reduces the number of disk accesses by passing over index entries where it is determined that a match will not be found. However, because certain index entries are passed over, it is impossible to ascertain if a path expression occurs more than once in the XML index, as certain queries sometimes require. This hurdle can be overcome by maintaining a sibling count with each node entry in the XML index. Because the sibling count is stored with the index entry, the index will reveal whether the matching node is single or has other siblings. In additional to re-writing the original query for optimization by use of an XML index, it will be re-written to check for a single-path condition in the index.
摘要翻译：提供了一种方法和装置，用于在XML索引中使用同级计数来优化单路径查询。在SQL查询中使用b-tree XML索引对数地减少了通过传递索引条目的磁盘访问次数，确定不会找到匹配项。但是，由于某些索引条目被传递，因此某些查询有时需要，无法确定路径表达式是否在XML索引中多次出现。通过维护XML索引中每个节点条目的兄弟数量，可以克服这个障碍。由于兄弟计数与索引条目一起存储，索引将显示匹配节点是单个节点还是具有其他兄弟节点。除了通过使用XML索引重新编写原始查询进行优化外，还将重新编写索引中的单路径条件。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式