公开(公告)号：US20050203930A1

公开(公告)日：2005-09-15

申请号：US11076220

申请日：2005-03-09

Applicant: Richard Bukowski ,  Mark Wheeler ,  Laura Downs ,  Jonathan Kung

Inventor： Richard Bukowski ,  Mark Wheeler ,  Laura Downs ,  Jonathan Kung

IPC: G06F7/00 ,  G06F12/00 ,  G06F12/14 ,  G06F13/28 ,  G06F17/00 ,  G06F17/30

CPC classification number: G06F17/30241 ,  Y10S707/99945 ,  Y10S707/99948

Abstract: Large data sets can be stored and processed in real time by combining and registering the large data sets into a single data set. The data can be stored in a data tree structure formed of layers of spatially organized blocks of data. Such storage allows portions of the data to be viewed efficiently, displaying actual point data at an acceptable resolution for the viewing mechanism. Density limited queries can be executed that allow sub-sampling to be done directly and evenly without geometric constraint, to provide a subset of points that is limited in size and includes a spatially-even decomposition of that set of points. This allows the system as a whole to support arbitrarily large point sets while allowing full partitioning functionality, which is efficient to use in both time and space.

Abstract translation: 可以通过将大数据集合并注册到单个数据集中来实时存储和处理大数据集。 数据可以存储在由空间有组织的数据块的层组成的数据树结构中。 这样的存储允许有效地查看数据的部分，以观看机制的可接受分辨率显示实际点数据。 可以执行密度有限查询，其允许在不具有几何约束的情况下直接且均匀地完成子采样，以提供受限于尺寸的点的子集，并且包括该组点的空间均匀分解。 这允许系统作为一个整体来支持任意大的点集，同时允许完全分区功能，这在时间和空间上都是有效的。