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

1. 发明公开

EP2249262A2 Visual hierarchy explorer 审中-公开
标题翻译：可视层次结构
公开(公告)号：EP2249262A2
公开(公告)日：2010-11-10
申请号：EP10162221.5
申请日：2010-05-06
申请人： Business Objects Software Ltd.
发明人： Gan, Jeff , Cannon, Finlay , Richards, Ronald Wade
IPC分类号： G06F17/30
CPC分类号： G06F17/30572 , G06F17/30994
摘要： A method and a system are described that involve generating a graphical tree hierarchy of a data structure and its accompanying metadata. In one embodiment, the method includes building a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes. Further, the method includes aggregating at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level. The method also includes scaling down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels.
摘要翻译：描述了涉及生成数据结构的图形树分层结构及其伴随的元数据的方法和系统。在一个实施例中，该方法包括构建具有多个级别的图形树分层结构，其中该图形树分层结构至少包括根节点，多个非叶节点以及多个叶节点。此外，该方法包括：如果驻留在该级别的多个非叶节点的子集超过每个节点的最大节点数，则在图形树层次的级别聚集多个非叶节点的至少一部分水平。该方法还包括如果图形树层级的多个级别超过最大级别数量，则缩小多个叶节点。

2. 发明公开

EP2249262A3 Visual hierarchy explorer 审中-公开
标题翻译： Visueller Hierarchieerkunder
公开(公告)号：EP2249262A3
公开(公告)日：2011-06-01
申请号：EP10162221.5
申请日：2010-05-06
申请人： Business Objects Software Ltd.
发明人： Gan, Jeff , Cannon, Finlay , Richards, Ronald Wade
IPC分类号： G06F17/30
CPC分类号： G06F17/30572 , G06F17/30994
摘要： A method and a system are described that involve generating a graphical tree hierarchy of a data structure and its accompanying metadata. In one embodiment, the method includes building a graphical tree hierarchy with a plurality of levels, wherein the graphical tree hierarchy includes at least a root node, a plurality of non-leaf nodes, and a plurality of leaf nodes. Further, the method includes aggregating at least a portion of the plurality of non-leaf nodes at a level of the graphical tree hierarchy, if a subset of the plurality of non-leaf nodes residing at the level exceeds a maximum number of nodes per the level. The method also includes scaling down the plurality of leaf nodes, if the plurality of levels of the graphical tree hierarchy exceeds a maximum number of levels.
摘要翻译：描述了涉及生成数据结构及其伴随元数据的图形树层次的方法和系统。在一个实施例中，该方法包括构建具有多个级别的图形树层次结构，其中图形树层次结构至少包括根节点，多个非叶节点和多个叶节点。此外，如果驻留在该级别的多个非叶节点的子集超过每个节点的最大数量的节点，则该方法包括在图形树层级的级别聚集多个非叶节点的至少一部分水平。如果图形树层次的多个级别超过最大级数，则该方法还包括缩小多个叶节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式