发明申请
- 专利标题: Method, computer program product, and system of optimized data translation from relational data storage to hierarchical structure
- 专利标题(中): 方法,计算机程序产品和从关系数据存储到分层结构的优化数据转换系统
-
申请号: US10744424申请日: 2003-12-22
-
公开(公告)号: US20050138073A1公开(公告)日: 2005-06-23
- 发明人: Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
- 申请人: Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
- 申请人地址: US NY ARMONK
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY ARMONK
- 主分类号: G06F17/00
- IPC分类号: G06F17/00 ; G06F17/30
摘要:
A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.
公开/授权文献
信息查询