公开(公告)号：US5826262A

公开(公告)日：1998-10-20

申请号：US621757

申请日：1996-03-22

申请人： Thuan Quang Bui ,  Scott Dennis Helt ,  Balakrishna Raghavendra Iyer ,  Gary Ross Ricard

发明人： Thuan Quang Bui ,  Scott Dennis Helt ,  Balakrishna Raghavendra Iyer ,  Gary Ross Ricard

IPC分类号： G06F17/30

CPC分类号： G06F17/30625 ,  Y10S707/99932 ,  Y10S707/99937

摘要： A method for partitioning keys onto radix tree logical pages and a parallel index page build algorithm in order to provide radix tree build speedup proportional to the number of processors on the system and controlled efficient page utilization. Also, since keys are intelligently partitioned so that a complete set of keys is inserted into a logical page, there is no page overflow during the tree construction and thus page splitting is eliminated. Since radix index trees are really groups of logical pages in which each logical page contains a small tree, the tree is built (with respect to the logical pages) from the bottom up, while within each individual logical page the tree is constructed from the top down. The space required for a logical page is pre-allocated to allow construction of limbs to begin without waiting for the build of their underlying pages to complete.

摘要翻译： 一种将键分解到基数树逻辑页面的方法和一个并行的索引页构建算法，以便提供与系统上的处理器数量成比例的基数树构建速度，并控制有效的页面利用率。 另外，由于密钥被智能地分割，使得一整套密钥被插入到逻辑页面中，所以在树构造期间没有页面溢出，因此页面拆分被消除。 由于基数索引树是真正的逻辑页面组，其中每个逻辑页面都包含一个小树，所以从底部向上构建树（相对于逻辑页面），而在每个单独的逻辑页面中，树从顶部构建 下。 逻辑页面所需的空间被预先分配，以允许构建四肢开始，而无需等待其底层页面的构建才能完成。

公开(公告)号：US07167969B2

公开(公告)日：2007-01-23

申请号：US10671035

申请日：2003-09-25

申请人： Kevin Curtis Griffin ,  Scott Dennis Helt ,  Glen Warren Nelson ,  Mark Philip Piazza ,  Gary Ross Ricard

发明人： Kevin Curtis Griffin ,  Scott Dennis Helt ,  Glen Warren Nelson ,  Mark Philip Piazza ,  Gary Ross Ricard

IPC分类号： G06F12/00

CPC分类号： G06F12/1441 ,  G06F11/2056

摘要： An apparatus and method provides the capability of mirroring storage from a primary system to a mirrored system in a way that uses parallelism in the mirrored system to maximize the efficiency of writing data to the mirrored storage for operations that do not conflict while serializing operations that do conflict. The mirroring of the present invention is “logical mirroring”, which does not require identical disk drives, and which supports mirroring between geographically remote locations to protect against catastrophic site failure. Parallelism is achieved in the mirrored system by dividing the virtual address space into multiple ranges, and by assigning a group of tasks to each range. When an operation is received on the mirrored system, the virtual address range that the operation affects is determined, and the operation is then delegated to the task group that corresponds to the affected virtual address range. By dividing the virtual address space into ranges, tasks in different ranges (i.e., in different task groups) may execute in parallel without any threat of conflict, and even tasks within the same range may execute in parallel if they operate in different portions of the range.

摘要翻译： 一种装置和方法提供将存储从主系统镜像到镜像系统的能力，其方法是使用镜像系统中的并行性来最大限度地提高将数据写入镜像存储器的效率，以用于在串行化操作时不冲突的操作 冲突。 本发明的镜像是“逻辑镜像”，其不需要相同的磁盘驱动器，并且其支持在地理上偏远的位置之间的镜像，以防止灾难性的站点故障。 通过将虚拟地址空间划分为多个范围，并通过为每个范围分配一组任务，在镜像系统中实现并行化。 当在镜像系统上接收到操作时，确定操作影响的虚拟地址范围，然后将该操作委派给与受影响的虚拟地址范围对应的任务组。 通过将虚拟地址空间划分为范围，不同范围内的任务（即，在不同的任务组中）可以并行执行，而不会产生任何冲突的威胁，如果在相同范围内的任务可以并行执行，如果它们在 范围。

公开(公告)号：US06421664B1

公开(公告)日：2002-07-16

申请号：US09334543

申请日：1999-06-16

申请人： Micahel John Groeschel ,  Scott Dennis Helt ,  Rebecca Nan Brady Legler

发明人： Micahel John Groeschel ,  Scott Dennis Helt ,  Rebecca Nan Brady Legler

IPC分类号： G06F1730

CPC分类号： G06F17/30327 ,  G06F17/30469 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99942

摘要： An apparatus, program product and method for estimating the number of keys within an index key range over an index using page pointers to pages in the index comprises a program configured for scanning the index, from a divergence point of the key range, until a page pointer is found and incrementing a counter for each found page pointer. The program is further configured for determining if the page pointer points to a leaf page in the index, and if it does, continuing the scan to find the next page pointer without going to the corresponding leaf page. Otherwise, the program continues the scan to find the next page pointer and continues the scan for page pointers and increments the counter until the index is scanned for the entire key range. Upon completion of the scan, the program determines an estimate of the number of keys utilizing the counter.

摘要翻译： 一种用于使用索引中的页面的页面指针来估计在索引上的索引关键字范围内的键的数量的装置，程序产品和方法，包括被配置用于从所述键范围的发散点扫描所述索引直到页面 找到指针并递增每个找到的页面指针的计数器。 该程序还被配置用于确定页面指针是否指向索引中的叶子页面，并且如果是，继续扫描以找到下一页面指针而不去相应的叶子页面。 否则，程序继续扫描以找到下一页指针，并继续扫描页面指针，并递增计数器，直到索引扫描整个键范围。 扫描完成后，程序确定使用计数器的键数量的估计。

公开(公告)号：US07636821B2

公开(公告)日：2009-12-22

申请号：US10758484

申请日：2004-01-15

申请人： Kevin Curtis Griffin ,  Scott Dennis Helt ,  Michael James McDermott ,  Glen W. Nelson ,  Mark Philip Piazza

发明人： Kevin Curtis Griffin ,  Scott Dennis Helt ,  Michael James McDermott ,  Glen W. Nelson ,  Mark Philip Piazza

IPC分类号： G06F12/16

CPC分类号： G06F11/2064 ,  G06F11/2071

摘要： A method backs up computer data by organizing update requests into groups. All update requests in one group complete concurrently before requests of a subsequent group complete.

摘要翻译： 一种方法通过将更新请求组织成组来备份计算机数据。 一个组中的所有更新请求在后续组完成的请求之前同时完成。