公开(公告)号：US07734714B2

公开(公告)日：2010-06-08

申请号：US12013385

申请日：2008-01-11

Applicant: J. Andrew Rogers

Inventor： J. Andrew Rogers

IPC: G06F15/167

CPC classification number: G06F17/30961

Abstract: A method, apparatus, and system is described for creating a spatial sieve tree which stores, manages, and manipulates multidimensional data by partitioning the bounds of the nodes of the tree, creating child nodes which each have defined bounds associated with a partitioned portion of their parent node(s) and may be further partitioned into additional levels of child nodes, and determining which level of the tree has the smallest size node in which a data object could wholly fit regardless of the data object's location in coordinate space and the one or more nodes of that determined level that could at least partially contain the data object based on the bounds of the one or more nodes and the data object's location in coordinate space.

Abstract translation: 描述了一种方法，装置和系统，用于创建空间筛树，其通过分割树的节点的边界来存储，管理和操纵多维数据，创建每个具有与它们的分割部分相关联的界定的子节点 父节点，并且可以被进一步分割成子节点的附加级别，并且确定树的哪个级别具有数据对象可以完全适合的最小尺寸节点，而不管数据对象在坐标空间中的位置如何， 该确定级别的更多节点可以基于一个或多个节点的边界和数据对象在坐标空间中的位置至少部分地包含数据对象。

公开(公告)号：US20100115620A1

公开(公告)日：2010-05-06

申请号：US12477619

申请日：2009-06-03

Applicant: Christoph Alme

Inventor： Christoph Alme

IPC: G06F21/00 ,  G06F7/00 ,  G06F12/14

CPC classification number: H04L63/1416 ,  G06F17/30961 ,  G06F21/563 ,  H04L63/145

Abstract: Various embodiments include an apparatus comprising a detection database including a tree structure of descriptor parts including one or more root nodes and one or more child nodes linked to from one or more parent descriptor parts chains, each of the root nodes representing a descriptor part, and each root node linked to at least one of the child nodes, each root node and each child node linked to any possible additional child nodes, wherein the possible additional child nodes include any possible successor child nodes and a descriptor comparator coupled to the detection database, the descriptor comparator operable to receive data including a plurality of logic entities, once or successively, and to continuously compare logic entities provided to the tree structure of descriptor parts stored in detection database, and to provide an output based on the comparison.

Abstract translation: 各种实施例包括一种包括检测数据库的装置，该检测数据库包括包括一个或多个根节点和从一个或多个父描述符部分链链接的一个或多个子节点的描述符部分的树结构，每个根节点表示描述符部分，以及 每个根节点链接到至少一个子节点，每个根节点和每个子节点链接到任何可能的附加子节点，其中可能的附加子节点包括任何可能的后继子节点和耦合到检测数据库的描述符比较器， 所述描述符比较器可操作以一次或连续地接收包括多个逻辑实体的数据，并且连续地比较提供给存储在检测数据库中的描述符部分的树结构的逻辑实体，并且基于该比较来提供输出。

公开(公告)号：US20100082703A1

公开(公告)日：2010-04-01

申请号：US12240973

申请日：2008-09-29

Applicant: Kun Zhou ,  Minmin Gong ,  Baining Guo

Inventor： Kun Zhou ,  Minmin Gong ,  Baining Guo

IPC: G06F17/30 ,  G06F7/06

CPC classification number: G06F17/30961

Abstract: An octree GPU construction system and method for constructing a complete octree data structure on a graphics processing unit (GPU). Embodiments of the octree GPU construction system and method first defines a complete octree data structure as forming a complete partition of the 3-D space and including a vertex, edge, face, and node arrays, and neighborhood information. Embodiments of the octree GPU construction system and method input a point cloud and construct a node array. Next, neighboring nodes are computed for each of the nodes in the node arrays by using at least two pre-computed look-up tables (such as a parent look-up table and a child look-up table). Embodiments of the octree GPU construction system and method then use the neighboring nodes and neighborhood information to compute a vertex array, edge array, and face array are computed by determining owner information and self-ownership information based on the neighboring nodes.

Abstract translation: 用于在图形处理单元（GPU）上构造完整八叉树数据结构的八叉树GPU构造系统和方法。 八叉树GPU构造系统和方法的实施例首先将完整的八叉树数据结构定义为形成3-D空间的完整分区并且包括顶点，边缘，面和节点阵列以及邻域信息。 八叉树GPU构造系统和方法的实施例输入点云并构造节点阵列。 接下来，通过使用至少两个预先计算的查询表（诸如父查询表和子查找表）来计算节点阵列中的每个节点的相邻节点。 八叉树GPU构造系统和方法的实施例然后通过基于相邻节点确定所有者信息和自身所有权信息来计算相邻节点和邻域信息来计算顶点阵列，边缘阵列和面部阵列。

公开(公告)号：US20100010960A1

公开(公告)日：2010-01-14

申请号：US12169931

申请日：2008-07-09

Applicant: Vikash Singh

Inventor： Vikash Singh

IPC: G06F17/30

CPC classification number: G06F17/30961 ,  G06F17/30498 ,  G06F17/30569

Abstract: Multiple sets of data are obtained from different sources. Each data set is represented using a different format having a different syntax and organized in a multi-level nested data structure. Each data set is reformatted into a standardized table format using a depth-first recursive algorithm without relying on the syntax schema of the original format of the data set. Various operations are performed on the tables corresponding to the data sets, including but not limited to joining multiple tables, grouping selected rows of a table, ranking rows of a table, adding or deleting fields from selected rows of a table, etc. Optionally, inferred namespace and text normalization are utilized for selected table operations. One or more templates are provided for converting the data set of a table to a format that may be presented to a user.

Abstract translation: 从不同来源获得多组数据。 每个数据集使用具有不同语法的不同格式来表示，并且被组织在多级嵌套数据结构中。 使用深度优先递归算法将每个数据集重新格式化为标准化表格式，而不依赖于数据集的原始格式的语法模式。 在与数据集相对应的表上执行各种操作，包括但不限于加入多个表，对表的所选行进行分组，排列表的行，从表的选定行添加或删除字段等。可选地， 推断的命名空间和文本归一化用于选定的表操作。 提供一个或多个模板用于将表的数据集转换成可呈现给用户的格式。

公开(公告)号：US07620632B2

公开(公告)日：2009-11-17

申请号：US11006848

申请日：2004-12-07

Applicant: Mark Andrews

Inventor： Mark Andrews

IPC: G06F7/00

CPC classification number: G06F17/30961 ,  Y10S707/99936 ,  Y10S707/99942

Abstract: Embodiments of methods, apparatuses, devices and/or systems for performing tree matching are disclosed.

Abstract translation: 公开了用于执行树匹配的方法，设备，设备和/或系统的实施例。

公开(公告)号：US07613997B2

公开(公告)日：2009-11-03

申请号：US11260656

申请日：2005-10-27

Applicant: Christopher G. Kaler ,  Allen L. Brown ,  Robert G. Atkinson ,  Steven E. Lucco

Inventor： Christopher G. Kaler ,  Allen L. Brown ,  Robert G. Atkinson ,  Steven E. Lucco

IPC: G06F17/00

CPC classification number: G06F17/30961 ,  G06F17/2229 ,  G06F17/2247 ,  G06F17/227

Abstract: A group identifier represents an association between each of a number of different abbreviated namespace identifiers with a corresponding hierarchical namespace (e.g., an XML namespace). A hierarchically-structured document (e.g., an XML document) is accessed by a computing system that determines that the group identifier is associated with the hierarchically-structured document. Hence, when using the abbreviated namespace identifiers in the hierarchically-structured document, the computing system knows that the corresponding namespace is associated with the designated portions of the hierarchically-structured document. Also, a schema description language document (e.g., an XSD document) may specify multiple target namespaces for a single element. Accordingly, groupings of elements may be included in different namespaces to creating overlapping or even nested namespaces.

Abstract translation: 组标识符表示多个不同的缩写命名空间标识符中的每一个与相应的分级命名空间（例如，XML命名空间）之间的关联。 分层结构化文档（例如，XML文档）由计算系统访问，该计算系统确定组标识符与分层结构化文档相关联。 因此，当在分层结构化文档中使用缩写名称空间标识符时，计算系统知道对应的命名空间与分层结构化文档的指定部分相关联。 此外，模式描述语言文档（例如，XSD文档）可以为单个元素指定多个目标命名空间。 因此，元素的分组可以包括在不同的命名空间中以创建重叠或甚至嵌套的命名空间。

公开(公告)号：US07603346B1

公开(公告)日：2009-10-13

申请号：US11674474

申请日：2007-02-13

Applicant: Gary Depelteau ,  David W. Carr

Inventor： Gary Depelteau ,  David W. Carr

IPC: G06F17/30

CPC classification number: G06F17/30961 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99937 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: A pipelined search engine device, such as a longest prefix match (LPM) search engine device, includes a hierarchical memory and a pipelined tree maintenance engine therein. The hierarchical memory is configured to store a b−tree of search prefixes (and possibly span prefix masks) at multiple levels therein. The pipelined tree maintenance engine, which is embedded within the search engine device, includes a plurality of node maintenance sub-engines that are distributed with the multiple levels of the hierarchical memory. The search engine device may also include pipeline control and search logic that is distributed with the multiple levels of the hierarchical memory.

Abstract translation: 诸如最长前缀匹配（LPM）搜索引擎设备的流水线搜索引擎设备在其中包括分层存储器和流水线树维护引擎。 分层存储器被配置为在其中的多个级别存储搜索前缀的b树（并且可能跨越前缀掩码）。 嵌入在搜索引擎设备内的流水线树维护引擎包括与分级存储器的多个级别分布的多个节点维护子引擎。 搜索引擎设备还可以包括与分层存储器的多个级别分布的流水线控制和搜索逻辑。

公开(公告)号：US20090245138A1

公开(公告)日：2009-10-01

申请号：US12397356

申请日：2009-03-04

Applicant: Joe SAPSFORD ,  Han Wen

Inventor： Joe SAPSFORD ,  Han Wen

IPC: H04L12/28

CPC classification number: G06F17/30994 ,  G06F17/30961 ,  H04L41/0893 ,  H04L41/22 ,  H04L43/00 ,  H04L43/028 ,  H04L43/045

Abstract: A system and method to visually navigate hierarchical data groups are provided. If a user wishes to graphically view network traffic data for a particular business group of network nodes, a network topology navigation tool may be provided to display to the user such information that is relevant to the selected business group and the corresponding hierarchy level. The user may also be permitted to access more detailed connection information through appropriate drill-downs.

Abstract translation: 提供了一种视觉浏览分层数据组的系统和方法。 如果用户希望以图形方式查看网络节点的特定业务组的网络流量数据，则可以提供网络拓扑导航工具以向用户显示与所选择的业务组和相应的层次级别相关的这样的信息。 还可以允许用户通过适当的钻取来访问更详细的连接信息。

公开(公告)号：US20090222473A1

公开(公告)日：2009-09-03

申请号：US12039827

申请日：2008-02-29

Applicant: Sandeep Chowdhury

Inventor： Sandeep Chowdhury

IPC: G06F17/30

CPC classification number: G06F17/30961

Abstract: Disclosed is a method of encoding a tree structure and associated methods of traversing, manipulating and querying the tree. As tree structures are widely used in the field of computer science (as document formats like XML, as object trees of object-oriented programming languages, as XML and object databases etc), genetic analysis and other fields of science, the methods disclosed in this invention will be advantageous in analysing and indexing tree structures. Other embodiments are also disclosed.

Abstract translation: 公开了一种编码树结构的方法以及遍历，操作和查询树的相关方法。 由于树结构广泛应用于计算机科学领域（像XML这样的文档格式，作为面向对象编程语言的对象树，作为XML和对象数据库等），遗传分析和其他科学领域，这里披露的方法 发明将有利于分析和索引树结构。 还公开了其他实施例。

公开(公告)号：US20090182837A1

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

申请号：US12013385

申请日：2008-01-11

Applicant: J. Andrew Rogers

Inventor： J. Andrew Rogers

IPC: G06F15/16

CPC classification number: G06F17/30961

Abstract: A method, apparatus, and system is described for creating a spatial sieve tree which stores, manages, and manipulates multidimensional data by partitioning the bounds of the nodes of the tree, creating child nodes which each have defined bounds associated with a partitioned portion of their parent node(s) and may be further partitioned into additional levels of child nodes, and determining which level of the tree has the smallest size node in which a data object could wholly fit regardless of the data object's location in coordinate space and the one or more nodes of that determined level that could at least partially contain the data object based on the bounds of the one or more nodes and the data object's location in coordinate space.

Abstract translation: 描述了一种方法，装置和系统，用于创建空间筛树，其通过分割树的节点的边界来存储，管理和操纵多维数据，创建每个具有与它们的分割部分相关联的界定的子节点 父节点，并且可以被进一步分割成子节点的附加级别，并且确定树的哪个级别具有数据对象可以完全适合的最小尺寸节点，而不管数据对象在坐标空间中的位置如何， 该确定级别的更多节点可以基于一个或多个节点的边界和数据对象在坐标空间中的位置至少部分地包含数据对象。