会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Maintaining views of cube-based operations in a database system
    • 在数据库系统中维护基于立方体的操作的视图
    • US07933867B1
    • 2011-04-26
    • US10706656
    • 2003-11-12
    • Hong GuiAmbuj ShatdalCurt J. Ellmann
    • Hong GuiAmbuj ShatdalCurt J. Ellmann
    • G06F17/00
    • G06F17/30592
    • A database system includes a storage to store a view containing results of a cube-based operation on at least one base table, with the view containing a first result set for a group-by on a first grouping set, and a second result set for a group-by on a second grouping set. In response to a change to the at least one base table, a controller updates the first result set by computing a change to the first result set based on a change in the at least one base table, and updates the second result set by computing a change to the second result set based on the change to the first result set.
    • 数据库系统包括存储器,用于存储包含至少一个基表的基于立方体的操作的结果的视图,其中该视图包含针对第一分组集合上的分组的第一结果集,以及第二结果集, 在第二组集合上的组合。 响应于对所述至少一个基表的改变,控制器基于所述至少一个基表的改变计算对所述第一结果集的改变来更新所述第一结果集,并且通过计算所述第二结果集来更新所述第二结果集 根据对第一个结果集的更改,更改为第二个结果集。
    • 2. 发明授权
    • Query costing in a multidimensional database
    • 在多维数据库中查询成本核算
    • US07392242B1
    • 2008-06-24
    • US10863313
    • 2004-06-07
    • Jonathan M. BaccashIgor NazarenkoUri RodnyAmbuj Shatdal
    • Jonathan M. BaccashIgor NazarenkoUri RodnyAmbuj Shatdal
    • G06F7/00G06F17/30
    • G06F17/30592G06F17/30457Y10S707/99933Y10S707/99934Y10S707/99935
    • The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting tuple is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.
    • 可以使用过程因素标准来估计在多维数据库上运行查询(具有查询范围)的成本,而不仅仅是受影响记录的数量。 首先,数据库的物化视图可以被表示为按键排序的元组的容器。 然后,键可以逐步通过,每个键表示来自容器的元组的组合的映射。 在每个步骤中,该过程可以在大于或等于当前步骤的密钥的请求范围内请求下一个最小的密钥,这导致数据库中的密钥最小,大于或等于所请求密钥的元组 ,并确定生成的元组是否在查询范围内。 然后可以将查询的成本估计为执行范围检查的元组的数量。
    • 5. 发明授权
    • View selection for a multidimensional database
    • 查看多维数据库的选择
    • US07467127B1
    • 2008-12-16
    • US10863870
    • 2004-06-07
    • Jonathan M. BaccashIgor NazarenkoUri RodnyAmbuj Shatdal
    • Jonathan M. BaccashIgor NazarenkoUri RodnyAmbuj Shatdal
    • G06F7/00G06F17/00
    • G06F17/30592Y10S707/99932
    • Selection of certain views of a multidimensional database to materialize may be accomplished using an efficient and effective solution. A set of all potential views may be stored in a structure. A path in the structure may then be traversed in an indicated direction through the structure, the path including two or more potential views and beginning at an indicated view. Then two or more immaterialized views in the path may be compared to each other to determine which immaterialized view is the optimum choice for maximizing benefit if selected to be materialized. Then the traversing and comparing may be continually iterated through, each iteration utilizing an indicated direction different than the last, each iteration also utilizing an indicated view set at the optimum choice determined by the last iteration, the iterating continuing until it converges on a single view. That single view may then be selected for materialization.
    • 可以使用有效和有效的解决方案来实现多维数据库的某些视图的实现。 一组所有可能的视图可以存储在结构中。 然后,结构中的路径可以沿着指示的方向穿过结构,该路径包括两个或更多个潜在视图,并从指示的视图开始。 然后可以将路径中的两个或多个非物质化视图相互比较,以确定哪个非物质视图是选择实现后最大化效益的最佳选择。 然后可以连续迭代遍历和比较,每次迭代利用与最后一个不同的指示方向,每次迭代也利用由最后一次迭代确定的最佳选择设置的指示视图,迭代继续直到其收敛于单个视图 。 然后可以选择单一视图进行实现。
    • 7. 发明授权
    • Calculating aggregates of multiple combinations of a given set of columns
    • 计算给定列列的多个组合的聚合
    • US08943058B1
    • 2015-01-27
    • US12637274
    • 2009-12-14
    • Ambuj Shatdal
    • Ambuj Shatdal
    • G06F7/00G06F17/30
    • G06F17/30445
    • In a database system having processing units, a request is received to calculate aggregates of multiple combinations of a given set of columns. The processing units are divided into multiple groups, where each of the multiple groups includes a corresponding subset of the processing units. Within each of the groups, data of each processing unit in the group is replicated to other one or more processing units in the group. Within each of the groups, aggregates of at least some of the multiple combinations of the given set of columns are calculated by the processing units in the group using the replicated data.
    • 在具有处理单元的数据库系统中,接收请求以计算给定列列的多个组合的聚合。 处理单元被分成多个组,其中多个组中的每个组包括处理单元的相应子集。 在每个组内,组中的每个处理单元的数据被复制到组中的其他一个或多个处理单元。 在每个组中,给定列组的多个组合中的至少一些组合的聚合由使用复制数据的组中的处理单元计算。