公开(公告)号：US09075533B2

公开(公告)日：2015-07-07

申请号：US13864887

申请日：2013-04-17

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yi Yi ,  Rongfeng Hong ,  Jian Wang

IPC: G06F13/12 ,  G06F3/06 ,  G06F12/02 ,  G06F9/50 ,  G06F17/30

CPC classification number: G06F3/0644 ,  G06F9/5016 ,  G06F12/0284 ,  G06F17/30961

Abstract: The present invention is applicable to the field of computer technologies and provides a binary tree storage method and system. The method includes: dividing a binary tree into a root tree and a plurality of subtrees, where the plurality of subtrees is layered and stored in N levels of storages; partitioning the plurality of subtrees into M types according to a preset rule, so that the plurality of subtrees is partitioned into N×M data blocks; and adjusting storage positions of the N×M data blocks in the storages, so that a storage at each level occupies the same number of storage units. In the present invention, storage spaces for nodes at each level, which are spaces of non-uniform sizes, are normalized into spaces of the same size, thereby increasing a space utilization rate of storages.

Abstract translation: 本发明适用于计算机技术领域，并提供二叉树存储方法和系统。 该方法包括：将二叉树分为根树和多个子树，其中多个子树被分层并存储在N个级别的存储中; 根据预设规则将多个子树划分为M种类型，使得多个子树被划分成N×M个数据块; 以及调整存储器中的N×M数据块的存储位置，使得每个级别的存储器占用相同数量的存储单元。 在本发明中，作为不均匀尺寸的空间的每个级别的节点的存储空间被标准化为相同尺寸的空间，从而增加了存储空间利用率。

公开(公告)号：US20150169649A1

公开(公告)日：2015-06-18

申请号：US14568726

申请日：2014-12-12

Applicant: EMC Corporation

Inventor： Jeroen Van Rotterdam ,  Mark Polman

IPC: G06F17/30

CPC classification number: G06F17/30289 ,  G06F17/30091 ,  G06F17/30292 ,  G06F17/30589 ,  G06F17/30607 ,  G06F17/30961

Abstract: A method, article of manufacture, and apparatus for managing a computing environment, such as a cloud data repository. In some embodiments, such may include modifying an object or a component of an object at runtime and storing the modified object or modified component of an object in a storage device. In some embodiments, the component of an object being modified may include traits. In some embodiments, traits may be hierarchical data structures, including hierarchical data structures having more than one version. These hierarchical data structures may also contain or be associated with metadata, and may also make up the metadata of a host object. Embodiments provide that policies may be applied to these traits.

Abstract translation: 用于管理诸如云数据存储库之类的计算环境的方法，制品和装置。 在一些实施例中，这样可以包括在运行时修改对象的对象或组件，并将对象的修改对象或修改的组件存储在存储设备中。 在一些实施例中，被修改的对象的组件可以包括特征。 在一些实施例中，特征可以是分层数据结构，包括具有多于一个版本的分级数据结构。 这些分层数据结构还可以包含或与元数据相关联，并且还可以构成主机对象的元数据。 实施例提供了可以将这些策略应用于这些特征。

公开(公告)号：US09058112B2

公开(公告)日：2015-06-16

申请号：US13407121

申请日：2012-02-28

Applicant: Min Fang ,  Hui X. Gu ,  Xiao Yan Li ,  Fan G. Zeng

Inventor： Min Fang ,  Hui X. Gu ,  Xiao Yan Li ,  Fan G. Zeng

IPC: G06F12/06 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F17/30327 ,  G06F3/0608 ,  G06F3/0611 ,  G06F3/0643 ,  G06F3/0665 ,  G06F3/067 ,  G06F12/10 ,  G06F17/30961 ,  G06F2212/1024 ,  G06F2212/152 ,  G06F2212/202 ,  G06F2212/65

Abstract: The invention relates to retrieving data from a storage system. One embodiment of the invention comprises receiving a write operation, establishing a correspondence relationship between a logic block address and a physical block address of the write operation, and determining whether a valid data percentage in a mapping table is greater than a predetermined threshold after the correspondence relationship is added in stored metadata. In response to the valid data percentage being less than the predetermined threshold, the embodiment adds the correspondence relationship to a B-tree data structure of stored metadata.

Abstract translation: 本发明涉及从存储系统检索数据。 本发明的一个实施例包括接收写入操作，建立逻辑块地址与写入操作的物理块地址之间的对应关系，以及在对应之后确定映射表中的有效数据百分比是否大于预定阈值 关系被添加到存储的元数据中。 响应于有效数据百分比小于预定阈值，该实施例将对应关系添加到存储的元数据的B树数据结构中。

公开(公告)号：US20150149479A1

公开(公告)日：2015-05-28

申请号：US14092503

申请日：2013-11-27

Applicant: Oracle International Corporation

Inventor： Daniel Geringer ,  Siva Ravada ,  Richard J. Anderson ,  Ying Hu

IPC: G06F17/30

CPC classification number: G06F17/3087 ,  G06F17/30961

Abstract: A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request.

Abstract translation: 提供了一种用于查询包含点空间数据和无索引的数据库表的方法和装置。 表中的点空间数据的请求包括由用户提供的查询窗口，并描述用户期望其中包含的点空间数据的感兴趣区域。 查询窗口被平铺以创建内部瓦片和边界瓦片。 形成第一个查询以确定内部瓦片中包含的点空间数据。 形成第二个查询以确定包含在边界瓦片内以及查询窗口内的点空间数据。 第二个查询包括测试以确定边界瓦片内的点空间数据是否也位于查询窗口内的函数。 第一和第二查询部分地在增强型数据存储设备上执行，并且结果被加入并返回给用户以回答该请求。

公开(公告)号：US09020961B2

公开(公告)日：2015-04-28

申请号：US13625812

申请日：2012-09-24

Applicant: Robert T. and Virginia T. Jenkins as Trustees for the Jenkins Family Trust dated Feb. 8, 2002

Inventor： Jack J. LeTourneau

IPC: G06F17/30 ,  G06F17/00

CPC classification number: G06F17/30336 ,  G06F17/30327 ,  G06F17/30961

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed herein including, for example, an apparatus that includes a computing platform to transform between a tree and a condensed array of numerals.

Abstract translation: 本文公开了用于操纵分层数据集的物品，装置，装置和/或系统的实施例，其中包括例如包括用于在树和数组的精简数组之间进行变换的计算平台的装置。

公开(公告)号：US20150112903A1

公开(公告)日：2015-04-23

申请号：US14587724

申请日：2014-12-31

Applicant: Huawei Technologies Co., Ltd.

Inventor： Wun Wah Edmond Chan ,  Lujia Pan

IPC: G06N5/04 ,  G06F17/30 ,  G06N99/00

CPC classification number: G06N5/04 ,  G06F17/30961 ,  G06N99/005

Abstract: Embodiments of the present invention disclose a defect prediction method and apparatus, which relate to the data processing field, and implement accurate and quick locating of a defect in a faulty product. A specific solution is as follows: selecting a training attribute set from a pre-stored product fault record according to a target attribute, and combining the target attribute and the training attribute set into a training set, where the target attribute is a defect attribute of a historical faulty product; generating a classifier set according to the training set, where the classifier set includes at least two tree classifiers; and predicting a defect of a faulty product by using the classifier set as a prediction model. The present invention is used in a process of predicting a defect of a faulty product.

Abstract translation: 本发明的实施例公开了与数据处理领域相关的缺陷预测方法和装置，并且对故障产品中的缺陷进行准确和快速的定位。 具体方案如下：根据目标属性从预先存储的产品故障记录中选择训练属性集合，并将目标属性和训练属性集合组合成训练集合，其中目标属性是缺陷属性 一个历史错误的产品; 根据训练集生成分类器组，其中分类器集包括至少两个树分类器; 并通过使用分类器集作为预测模型来预测故障产品的缺陷。 本发明用于预测故障产品的缺陷的过程。

公开(公告)号：US09015202B2

公开(公告)日：2015-04-21

申请号：US14086741

申请日：2013-11-21

Applicant: Robert T. and Virginia T. Jenkins as Trustees for the Jenkins Family Trust

Inventor： Jack J. LeTourneau

IPC: G06F17/30 ,  G06F17/10

CPC classification number: G06F17/30589 ,  G06F17/10 ,  G06F17/30327 ,  G06F17/30961

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract translation: 公开了用于操纵分层数据集的方法，设备，设备和/或系统的实施例。

公开(公告)号：US20150026216A1

公开(公告)日：2015-01-22

申请号：US14507499

申请日：2014-10-06

Applicant: GOOGLE INC.

Inventor： Tushar Udeshi ,  Emil Constantin Praun

IPC: G06F17/30

CPC classification number: G06F17/30327 ,  G06F7/00 ,  G06F17/30241 ,  G06F17/30961

Abstract: A method and system for searching for data covered by nodes in a quadtree are disclosed. Nodes at a selected level of the quadtree are encoded with an index. The index nodes store data related to the level of descendants and ancestors of each index node. To search for data covered by a particular desired node, the index node ancestor or descendant of the desired node is determined. Based on the data in the index node, the desired node can be located without a full traversal of the quadtree. The quadtree nodes store elevation data for points on the Earth.

Abstract translation: 公开了一种用于搜索四叉树节点覆盖的数据的方法和系统。 四叉树的选定级别的节点用索引编码。 索引节点存储与每个索引节点的后代和祖先级别相关的数据。 为了搜索特定期望节点覆盖的数据，确定所需节点的索引节点祖先或后代。 基于索引节点中的数据，可以找到所需的节点，而不需要四叉树的完全遍历。 四叉树节点存储地球上的点的高程数据。

公开(公告)号：US20150012811A1

公开(公告)日：2015-01-08

申请号：US13935514

申请日：2013-07-04

Applicant: YAHOO! INC.

Inventor： Hsuan-Hao Chan ,  Yi-Chun Chuang ,  Ting-Liang Chou

IPC: G06F17/22

CPC classification number: G06F17/30873 ,  G06F3/04817 ,  G06F3/0482 ,  G06F17/3089 ,  G06F17/30905 ,  G06F17/30961 ,  G06Q30/0277

Abstract: A system and method for generating an interactive sitemap of a website includes steps of: receiving an identifier of a user visiting the website; storing identifiers of the website pages visited by the user; associating the website page identifiers with the user identifier; capturing a snapshot of each website page visited by the user; determining website pages recommended for the user, but not yet visited by the user; capturing a snapshot of at least one recommended website page; and generating the interactive sitemap that includes a sitemap tree structure of the website with selectable nodes representing the website pages visited by the user and the website pages recommended for the user. When the user rolls over one of the selectable nodes, presenting the snapshot within the in-page window.

Abstract translation: 用于生成网站的交互式站点地图的系统和方法包括以下步骤：接收访问该网站的用户的标识符; 存储用户访问的网站页面的标识符; 将网站页面标识符与用户标识符相关联; 捕获用户访问的每个网页的快照; 确定为用户推荐但尚未被用户访问的网页; 捕获至少一个推荐网站页面的快照; 以及生成包括网站的站点地图树结构的交互式站点地图，其中可选节点表示用户访问的网页页面以及为用户推荐的网页页面。 当用户翻转可选节点之一时，在页内窗口中呈现快照。

公开(公告)号：US20140372381A1

公开(公告)日：2014-12-18

申请号：US14474158

申请日：2014-08-31

Applicant: Amazon Technologies, Inc.

Inventor： JAMES CHRISTOPHER SORENSON, III ,  YUN LIN ,  NISHANTH ALAPATI

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30088 ,  G06F7/00 ,  G06F11/1448 ,  G06F17/30961 ,  H04L67/1097

Abstract: Methods, apparatus, and computer-accessible storage media for restoring data from a snapshot to a data volume. The blocks in the volume may be treated as an implicit tree structure, for example a binary tree; each local block corresponds to a block on the snapshot. A local block on the volume may be marked, for example fingerprinted with metadata, to indicate that the local block has not been restored. Initially, the local block at the root node is marked. To restore a local block, the restore process may generate a list indicating all local blocks on a path from the root node of the tree to the target node that have not been restored. The marks in the local blocks are used in generating the list. For each block indicated in the list, children of the block are fingerprinted, and the block is restored from the snapshot.

Abstract translation: 用于将数据从快照恢复到数据卷的方法，装置和计算机可访问的存储介质。 卷中的块可以被视为隐式树结构，例如二叉树; 每个本地块对应于快照上的块。 可以标记卷上的本地块，例如用元数据指纹，以指示本地块尚未恢复。 最初，根节点处的本地块被标记。 要恢复本地块，恢复过程可能会生成一个列表，指示从树的根节点到尚未恢复的目标节点的路径上的所有本地块。 本地块中的标记用于生成列表。 对于列表中指示的每个块，该块的子项都是指纹的，并且该块将从快照中恢复。