-
公开(公告)号：US07062479B2
公开(公告)日：2006-06-13
申请号：US10016262
申请日：2001-11-02
CPC分类号： G06F17/246 , G06Q10/06 , Y10S707/958 , Y10S707/99931 , Y10S707/99934 , Y10S707/99936
摘要： This invention addresses the need for dealing with complex planning calculations based on data warehouse or Planning Data Repository (PDR) data where some aggregated data or forecast data might be changed without directly manipulating the underlying data, and where there may be several relationships linking the data. The system is able to deal with complex relationships along more than one axis or dimension. A number of iterations are typically used involving both back-solving and ‘forward-solving’. The subset of cells that needs to be recalculated is identified before steps of back-solving and/or forward-solving using parent/child tables. The scanning of these tables looking for potential dependencies is much simpler and faster than to looking at the actual formulae or functions relating the cells. The step of creating the parent/child tables is carried out in advance of the actual calculation by parsing all the relationships (formulae and functions) and summarising the dependencies between cells in the parent/child tables.
摘要翻译： 本发明解决了处理基于数据仓库或规划数据存储库（PDR）数据的复杂规划计算的需要，其中可以改变一些聚合数据或预测数据而不直接操纵底层数据，以及可能存在几个关联数据的关系 。 该系统能够处理沿着多个轴或维度的复杂关系。 通常使用多次迭代，包括反求解和“前向解决”。 需要重新计算的单元的子集在使用父/子表的反求解和/或前向解析的步骤之前被识别。 寻找潜在依赖关系的这些表的扫描比查看与单元格相关的实际公式或功能更简单和更快。 通过解析所有关系（公式和函数）并总结父/子表中的单元格之间的依赖关系，在实际计算之前执行创建父/子表的步骤。
-
公开(公告)号：US07937363B2
公开(公告)日：2011-05-03
申请号：US11405152
申请日：2006-04-17
IPC分类号： G06F7/00
CPC分类号： G06F17/30539
摘要： This invention addresses the need for dealing with complex planning calculations based on data warehouse or Planning Data Repository (PDR) data where some aggregated data or forecast data might be changed without directly manipulating the underlying data, and where there may be several relationships linking the data. The system is able to deal with complex relationships along more than one axis or dimension. A number of iterations are typically used involving both back-solving and ‘forward-solving’. The subset of cells that needs to be recalculated is identified before steps of back-solving and/or forward-solving using parent/child tables. The scanning of these tables looking for potential dependencies is much simpler and faster than to looking at the actual formulae or functions relating the cells. The step of creating the parent/child tables is carried out in advance of the actual calculation by parsing all the relationships (formulae and functions) and summarising the dependencies between cells in the parent/child tables.
摘要翻译： 本发明解决了处理基于数据仓库或规划数据存储库（PDR）数据的复杂规划计算的需要，其中可以改变一些聚合数据或预测数据而不直接操纵底层数据，以及可能存在几个关联数据的关系 。 该系统能够处理沿着多个轴或维度的复杂关系。 通常使用多次迭代，包括反求解和“前向解决”。 需要重新计算的单元的子集在使用父/子表的反求解和/或前向解析的步骤之前被识别。 寻找潜在依赖关系的这些表的扫描比查看与单元格相关的实际公式或功能更简单和更快。 通过解析所有关系（公式和函数）并总结父/子表中的单元格之间的依赖关系，在实际计算之前执行创建父/子表的步骤。
-
搜索结果
2 条记录 (耗时 0.009 秒)
