-
公开(公告)号：US07401090B2
公开(公告)日：2008-07-15
申请号：US10015983
申请日：2001-11-02
CPC分类号： G06Q10/06 , G06Q10/0637 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945
摘要： The invention allows several users to manipulate complex data interactively, but separately, and then have the results of their inputs merged. It is based on hierarchical planning which matches typical business environments. The planning process is distributed over the management hierarchy and each level may contribute one or more alternative plans for consideration by a superior level. The distribution of the process is carried out using computer-enabled ‘delegation’. Relationships are specified between a dimensional structure and a responsibility structure such that sub-plans and plans using the dimensional structure of a planning data repository (PDR) may be partitioned into components corresponding to the responsibility structure. Part of ‘delegation’ is the process of setting up the conditions, requirements, etc. for a subordinate to draft one or more sub-plans for their particular area. The subordinate then submits one or more of these sub-plans based on these conditions and information in the PDR, as well as on their specific experience and other (local) input. On ‘submission’, this sub-plan is able to be incorporated into higher level sub-plans. During the submission process sub-plans are integrated into a single plan, ensuring overall consistency of the data, and conformance with any constraints defined by users. The process is iterative in nature.
摘要翻译： 本发明允许多个用户以交互方式操作复杂数据，但是分开地将其输入的结果合并。 它基于与典型业务环境相匹配的分级规划。 规划过程分布在管理层次上，每个层级都可以提供一个或多个替代计划供上级审议。 该过程的分发是使用计算机启用的“授权”进行的。 在尺寸结构和责任结构之间指定关系，使得使用规划数据库（PDR）的维度结构的子计划和计划可以被划分为与责任结构相对应的组件。 “代表团”的一部分是为下属制定其特定地区的一个或多个子计划的条件，要求等的过程。 下属然后根据PDR中的这些条件和信息，以及其具体经验和其他（本地）输入提交一个或多个这些子计划。 在“提交”上，该子计划可以纳入上级子计划。 在提交过程中，子计划被集成到单一计划中，确保数据的整体一致性，并符合用户定义的任何限制。 这个过程本质上是迭代的。
-
公开(公告)号：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）数据的复杂规划计算的需要，其中可以改变一些聚合数据或预测数据而不直接操纵底层数据，以及可能存在几个关联数据的关系 。 该系统能够处理沿着多个轴或维度的复杂关系。 通常使用多次迭代，包括反求解和“前向解决”。 需要重新计算的单元的子集在使用父/子表的反求解和/或前向解析的步骤之前被识别。 寻找潜在依赖关系的这些表的扫描比查看与单元格相关的实际公式或功能更简单和更快。 通过解析所有关系（公式和函数）并总结父/子表中的单元格之间的依赖关系，在实际计算之前执行创建父/子表的步骤。
-
-
搜索结果
3 条记录 (耗时 0.011 秒)
