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

1. 发明授权

US07627547B2 Processing path-based database operations 有权
标题翻译：处理基于路径的数据库操作
公开(公告)号：US07627547B2
公开(公告)日：2009-12-01
申请号：US10999864
申请日：2004-11-29
申请人： Namit Jain , Fei Ge , Ravi Murthy , Subramanian Muralidhar , Nipun Agarwal , Eric Sedlar
发明人： Namit Jain , Fei Ge , Ravi Murthy , Subramanian Muralidhar , Nipun Agarwal , Eric Sedlar
IPC分类号： G06F7/00
CPC分类号： G06F17/30091 , G06F17/30233 , Y10S707/99931
摘要： A method and apparatus for processing path-based database operations is provided. According to one aspect, a “parent row ID” column is added to a directory links table. For each row in the table, the value of the “parent row ID” column indicates the row ID, in the table, of the node that is that row's node's parent in the file hierarchy. To determine whether a particular node is within a specified path of the file hierarchy, the particular node's pathname is derived by visiting child-to-parent links indicated in the table and prepending, to the front of a pathname being constructed for the particular node, node names indicated in the visited rows. Each parent node's row in the directory links table is located using the “parent row ID” column of the child node's row. The resulting pathname is compared with the specified path to determine whether the particular node exists therein.
摘要翻译：提供了一种用于处理基于路径的数据库操作的方法和装置。根据一个方面，将“父行ID”列添加到目录链接表。对于表中的每一行，“父行ID”列的值表示表中该行的文件层次结构中该节点的父节点的行ID。为了确定特定节点是否在文件层次结构的指定路径内，特定节点的路径名是通过访问表中指示的前后的子对象链接导出到为特定节点构建的路径名的前面，访问行中指示的节点名称。目录链接表中的每个父节点的行都使用子节点行的“父行ID”列进行定位。将得到的路径名与指定的路径进行比较，以确定特定节点是否存在于其中。

2. 发明申请

US20060117049A1 Processing path-based database operations 有权
公开(公告)号：US20060117049A1
公开(公告)日：2006-06-01
申请号：US10999864
申请日：2004-11-29
申请人： Namit Jain , Fei Ge , Ravi Murthy , Subramanian Muralidhar , Nipun Agarwal , Eric Sedlar
发明人： Namit Jain , Fei Ge , Ravi Murthy , Subramanian Muralidhar , Nipun Agarwal , Eric Sedlar
IPC分类号： G06F17/00
CPC分类号： G06F17/30091 , G06F17/30233 , Y10S707/99931
摘要： A method and apparatus for processing path-based database operations is provided. According to one aspect, a “parent row ID” column is added to a directory links table. For each row in the table, the value of the “parent row ID” column indicates the row ID, in the table, of the node that is that row's node's parent in the file hierarchy. To determine whether a particular node is within a specified path of the file hierarchy, the particular node's pathname is derived by visiting child-to-parent links indicated in the table and prepending, to the front of a pathname being constructed for the particular node, node names indicated in the visited rows. Each parent node's row in the directory links table is located using the “parent row ID” column of the child node's row. The resulting pathname is compared with the specified path to determine whether the particular node exists therein.

3. 发明授权

US07028037B1 Operators for accessing hierarchical data in a relational system 有权
标题翻译：用于访问关系系统中层次数据的操作员
公开(公告)号：US07028037B1
公开(公告)日：2006-04-11
申请号：US10260138
申请日：2002-09-27
申请人： Nipun Agarwal , Ravi Murthy , Eric Sedlar , Sivasankaran Chandrasekar , Fei Ge
发明人： Nipun Agarwal , Ravi Murthy , Eric Sedlar , Sivasankaran Chandrasekar , Fei Ge
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30421 , G06F17/30595 , G06F17/30607 , G06F17/30917 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99945
摘要： Techniques and systems are provided for efficiently managing hierarchical relational data stored in object-relational database system by extending the syntax of the database language supported by the database system (e.g. SQL) to incorporate several new “hierarchical” operators. These operators are evaluated based on the hierarchical relationship defined for hierarchical relational data. The operators maybe incorporated in SQL queries along with relational operators.
摘要翻译：提供了技术和系统，用于通过扩展数据库系统支持的数据库语言（例如SQL）来有效地管理存储在对象关系数据库系统中的分层关系数据，以结合几个新的“分层”运算符。这些运算符是基于层次关系数据定义的层次关系进行评估的。运算符可能与关系运算符一起纳入SQL查询。

4. 发明授权

US07930277B2 Cost-based optimizer for an XML data repository within a database 有权
标题翻译：数据库中XML数据存储库的基于成本的优化器
公开(公告)号：US07930277B2
公开(公告)日：2011-04-19
申请号：US10830211
申请日：2004-04-21
申请人： Fei Ge , Sivasankaran Chandrasekar , Nipun Agarwal , Ravi Murthy , Eric Sedlar
发明人： Fei Ge , Sivasankaran Chandrasekar , Nipun Agarwal , Ravi Murthy , Eric Sedlar
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30935
摘要： Cost-based optimizer functionality for an XML database repository provides means for optimizing the execution of database queries that access XML resources in the database repository. Statistics about XML resources that are stored in the database repository are gathered, stored and utilized by a query optimizer to compute computational costs associated with each of multiple methods of accessing particular XML resources requested in a database query. Hence, the optimizer is able to select the most efficient query execution plan based on the costs of possible access paths. In one embodiment, specific statistics about the hierarchical structure of XML resources stored in the XML database repository are gathered, stored in a relational table in the database management system, and used to compute the selectivity of query predicates and the index cost associated with traversing one or more indexes to access requested XML resources.
摘要翻译：用于XML数据库的基于成本的优化器功能提供了优化访问数据库存储库中的XML资源的数据库查询的执行的方法。存储在数据库存储库中的关于XML资源的统计信息由查询优化器收集，存储和使用，以计算与访问数据库查询中请求的特定XML资源的多种方法中的每一种相关联的计算成本。因此，优化器能够基于可能的访问路径的成本来选择最有效的查询执行计划。在一个实施例中，收集存储在XML数据库存储库中的XML资源的层次结构的具体统计信息，存储在数据库管理系统中的关系表中，并用于计算查询谓词的选择性和与遍历一个相关联的索引成本或更多的索引来访问所请求的XML资源。

5. 发明授权

US06965903B1 Techniques for managing hierarchical data with link attributes in a relational database 有权
标题翻译：用于使用关系数据库中的链接属性来管理分层数据的技术
公开(公告)号：US06965903B1
公开(公告)日：2005-11-15
申请号：US10306485
申请日：2002-11-26
申请人： Nipun Agarwal , Fei Ge , Sivasankaran Chandrasekar , Ravi Murthy , Eric Sedlar
发明人： Nipun Agarwal , Fei Ge , Sivasankaran Chandrasekar , Ravi Murthy , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945 , Y10S707/99948
摘要： Techniques for managing hierarchical data include managing a link table in a relational database. The hierarchical data includes data about a hierarchy of nodes related by multiple links. The link table includes first information, second information and link information, for each link. First information indicates a first node in the hierarchical data. Second information indicates a second node that is associated with the first node by the link. Link information indicates values for link attributes of the link between the first node and the second node, and does not indicate a value for any attribute of the first node alone or any attribute of the second node alone. The techniques support directing a single SQL statement to a path database object, constructed based on the link table, in order to obtain paths that satisfy a search on link attributes.
摘要翻译：用于管理分级数据的技术包括管理关系数据库中的链接表。层次数据包括关于多个链路相关节点的层次结构的数据。链路表包括每个链路的第一信息，第二信息和链路信息。第一信息表示层次数据中的第一节点。第二信息指示通过链路与第一节点相关联的第二节点。链接信息指示第一节点和第二节点之间的链接的链接属性的值，并且不指示单独的第一节点的任何属性或仅第二节点的任何属性的值。这些技术支持将单个SQL语句定向到基于链接表构建的路径数据库对象，以便获得满足链接属性搜索的路径。

6. 发明申请

US20050240624A1 Cost-based optimizer for an XML data repository within a database 有权
标题翻译：数据库中XML数据存储库的基于成本的优化器
公开(公告)号：US20050240624A1
公开(公告)日：2005-10-27
申请号：US10830211
申请日：2004-04-21
申请人： Fei Ge , Sivasankaran Chandrasekar , Nipun Agarwal , Ravi Murthy , Eric Sedlar
发明人： Fei Ge , Sivasankaran Chandrasekar , Nipun Agarwal , Ravi Murthy , Eric Sedlar
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30935
摘要： Cost-based optimizer functionality for an XML database repository provides means for optimizing the execution of database queries that access XML resources in the database repository. Statistics about XML resources that are stored in the database repository are gathered, stored and utilized by a query optimizer to compute computational costs associated with each of multiple methods of accessing particular XML resources requested in a database query. Hence, the optimizer is able to select the most efficient query execution plan based on the costs of possible access paths. In one embodiment, specific statistics about the hierarchical structure of XML resources stored in the XML database repository are gathered, stored in a relational table in the database management system, and used to compute the selectivity of query predicates and the index cost associated with traversing one or more indexes to access requested XML resources.
摘要翻译：用于XML数据库的基于成本的优化器功能提供了优化访问数据库存储库中的XML资源的数据库查询的执行的方法。存储在数据库存储库中的关于XML资源的统计信息由查询优化器收集，存储和利用，以计算与访问数据库查询中请求的特定XML资源的多种方法中的每一种相关联的计算成本。因此，优化器能够基于可能的访问路径的成本来选择最有效的查询执行计划。在一个实施例中，收集存储在XML数据库存储库中的XML资源的层次结构的具体统计信息，存储在数据库管理系统中的关系表中，并用于计算查询谓词的选择性和与遍历一个相关联的索引成本或更多的索引来访问所请求的XML资源。

7. 发明申请

US20070198545A1 Efficient processing of path related operations on data organized hierarchically in an RDBMS 有权
标题翻译：对RDBMS中分层组织的数据进行路径相关操作的有效处理
公开(公告)号：US20070198545A1
公开(公告)日：2007-08-23
申请号：US11360792
申请日：2006-02-22
申请人： Fei Ge , Sam Idicula , Namit Jain , Nipun Agarwal
发明人： Fei Ge , Sam Idicula , Namit Jain , Nipun Agarwal
IPC分类号： G06F7/00
CPC分类号： G06F17/30327
摘要： A mechanism is used to improve the efficiency of performing resource-to-path resolution. A hierarchical link structure contains entries and/or records (“link entries”) that each defines a parent-child link within an information hierarchy. A certain linking entry may have data that refers to another link entry representing a link to the parent—a link in which the parent is a child. This data allows resource-to-path resolutions to be performed more efficiently.
摘要翻译：使用一种机制来提高执行资源到路径解析的效率。分级链接结构包含条目和/或记录（“链接条目”），每个条目和/或记录定义信息层次结构中的父子链接。特定链接条目可以具有引用代表到父母的链接的另一链接条目的数据 - 父母是其子节点的链接。该数据允许更有效地执行资源到路径分辨率。

8. 发明授权

US09229967B2 Efficient processing of path related operations on data organized hierarchically in an RDBMS 有权
标题翻译：对RDBMS中分层组织的数据进行路径相关操作的有效处理
公开(公告)号：US09229967B2
公开(公告)日：2016-01-05
申请号：US11360792
申请日：2006-02-22
申请人： Fei Ge , Sam Idicula , Namit Jain , Nipun Agarwal
发明人： Fei Ge , Sam Idicula , Namit Jain , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30327
摘要： A mechanism is used to improve the efficiency of performing resource-to-path resolution. A hierarchical link structure contains entries and/or records (“link entries”) that each defines a parent-child link within an information hierarchy. A certain linking entry may have data that refers to another link entry representing a link to the parent—a link in which the parent is a child. This data allows resource-to-path resolutions to be performed more efficiently.
摘要翻译：使用一种机制来提高执行资源到路径解析的效率。分级链接结构包含条目和/或记录（“链接条目”），每个条目和/或记录定义信息层次结构中的父子链接。特定链接条目可以具有引用代表到父母的链接的另一链接条目的数据 - 父母是其子节点的链接。该数据允许更有效地执行资源到路径分辨率。

9. 发明授权

US06615206B1 Techniques for eliminating database table joins based on a join index 有权
标题翻译：基于连接索引消除数据库表连接的技术
公开(公告)号：US06615206B1
公开(公告)日：2003-09-02
申请号：US10186461
申请日：2002-06-28
申请人： Hakan Jakobsson , Ari Mozes , Andrew Witkowski , Fei Ge
发明人： Hakan Jakobsson , Ari Mozes , Andrew Witkowski , Fei Ge
IPC分类号： G06F1730
CPC分类号： G06F17/30498 , Y10S707/99933 , Y10S707/99934
摘要： Techniques for processing, in a database management system, a query referencing a plurality of tables of a database include determining whether a join should be performed between a first table and a second table. The determination is based on a particular set of one or more columns of the second table referenced in the query and a join index on the first table for an index key column from the second table. If it is determined that the join should not be performed, the query is processed without performing the join between the first table and the second table. By avoiding one or more joins, substantial savings in the consumption of computational resources are achieved.
摘要翻译：在数据库管理系统中处理引用数据库的多个表的查询的技术包括确定是否应当在第一表和第二表之间执行连接。该确定基于查询中引用的第二表的一个或多个列的特定集合，以及来自第二表的索引关键字列的第一表上的连接索引。如果确定不应执行连接，则处理查询而不执行第一个表和第二个表之间的连接。通过避免一个或多个连接，实现了计算资源消耗的显着节省。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式