发明申请
US20080040367A1 METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR USING GRAPHS TO SOLVE CIRCULAR DEPENDENCY IN OBJECT PERSISTENCE
有权
方法,系统和计算机程序产品,用于使用图形来解决对象持久性中的循环依赖
- 专利标题: METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR USING GRAPHS TO SOLVE CIRCULAR DEPENDENCY IN OBJECT PERSISTENCE
- 专利标题(中): 方法,系统和计算机程序产品,用于使用图形来解决对象持久性中的循环依赖
-
申请号: US11462727申请日: 2006-08-07
-
公开(公告)号: US20080040367A1公开(公告)日: 2008-02-14
- 发明人: Thomas F. Bitonti , Yang Lei
- 申请人: Thomas F. Bitonti , Yang Lei
- 申请人地址: US NY Armonk
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY Armonk
- 主分类号: G06F7/00
- IPC分类号: G06F7/00
摘要:
A method, system, and computer program product for reducing dependency calculation time in object persistence with circular referential integrity dependency is provided. The method includes building a graph using foreign key dependency from object to relational mapping, where nodes of the graph are object types and connected directionally from a source containing a foreign key to a target of a foreign key reference. The method further comprises topologically sorting the graph to order dependencies among the nodes including circular dependencies. The method also includes encapsulating the circular dependencies as a complex node. Furthermore, the method comprises performing object dependency calculations on the nodes and the complex node in the graph. The results of the object dependency calculations are used to generate a sequence in which the objects can be modified in a relational database.
公开/授权文献
信息查询