公开(公告)号：US07962489B1

公开(公告)日：2011-06-14

申请号：US10982087

申请日：2004-11-04

Applicant: David Chiang ,  James D. Candlin ,  Kelvin Soo

Inventor： David Chiang ,  James D. Candlin ,  Kelvin Soo

IPC: G06F17/30 ,  C07K1/00

CPC classification number: G06F19/22 ,  Y10S707/941

Abstract: A method of efficiently constructing and using an index for searches in large datasets is provided. In this method, a dataset can be divided into a plurality of “buckets”, i.e. contiguous, non-overlapping ranges of values of a chosen attribute of elements of the dataset. These buckets can be used to construct discrete index segments. Static index segments (associated with “static” buckets including the more frequently occurring values) are always computed, whereas dynamic index segments (associated with “dynamic” buckets including the less frequently occurring values) can be generated on an as-needed basis and based on the availability of system resources. Thus, search time and storage area can be advantageously reduced because less of the complete index needs to be generated and used.

Abstract translation: 提供了一种有效构建和使用大型数据集中搜索索引的方法。 在该方法中，数据集可以被划分成多个“桶”，即数据集的元素的选定属性值的相邻的非重叠范围。 这些桶可用于构建离散索引段。 总是计算静态索引段（与“静态”桶相关联，包括更频繁出现的值），而动态索引段（与“动态”桶相关联，包括较不频繁出现的值）可以根据需要生成，并且基于 关于系统资源的可用性。 因此，可以有利地减少搜索时间和存储区域，因为需要生成和使用更少的完整索引。