会员体验
专利管家（专利管理）
工作空间（专利管理）
风险监控（情报监控）
数据分析（专利分析）
侵权分析（诉讼无效）
联系我们
交流群
官方交流：
QQ群： 891211   
微信请扫码    >>>
现在联系顾问~
下载
著录项
PDF全文
热词
    • 1. 发明授权
      US06219800B1 Fault-tolerant storage system 失效
    • Fault-tolerant storage system
    • 容错存储系统
    • US06219800B1
    • 2001-04-17
    • US09100606
    • 1998-06-19
    • Theodore Johnson , Dennis Shasha
    • Theodore Johnson , Dennis Shasha
    • G06F1100
    • G06F11/1076 , G06F2211/1059
    • The present invention is a storage system, and method of operation thereof, which provides improved performance over standard RAID-5 without increasing vulnerability to single-disk drive failures. The storage system comprises a processor and a plurality of data storage devices, coupled to the processor, operable to store a plurality of data stripes, each data stripe comprising a plurality of data blocks and a parity block, each data storage device operable to store one data block or the parity block of each data stripe. The storage system stores a dirty stripe bit vector of a data stripe. When an update to a data block in the data stripe is received, an image of the data block as it was when the dirty stripe bit vector was generated is stored. The data block is updated and an image of the updated data block is stored. When a failure of one of the plurality of data storage devices is detected, a bitwise exclusive-OR of the image of the data block as it was when the dirty stripe bit vector was generated and the image of the updated data block to form an intermediate result is generated. The parity block of the data stripe is read and a bitwise exclusive-OR of the intermediate result and the parity block is generated. The generated parity block is written and a parity rebuild is performed on the data stripe using the new parity block.
    • 本发明是一种存储系统及其操作方法，其提供比标准RAID-5更好的性能，而不增加对单磁盘驱动器故障的脆弱性。 存储系统包括处理器和多个数据存储设备，耦合到处理器，可操作以存储多个数据条带，每个数据条带包括多个数据块和奇偶校验块，每个数据存储设备可操作以存储一个 数据块或每个数据条带的奇偶校验块。 存储系统存储数据条带的脏条带位向量。 当接收到对数据条带中的数据块的更新时，存储当生成脏条带位向量时原始数据块的图像。 更新数据块并存储更新的数据块的图像。 当检测到多个数据存储装置中的一个的故障时，按照当生成脏条带位向量时的数据块的图像与更新后的数据块的图像进行按位异或以形成中间 产生结果。 读取数据条带的奇偶校验块，并生成中间结果和奇偶校验块的按位异或。 所生成的奇偶校验块被写入，并且使用新的校验块在数据条带上执行奇偶校验。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Espacenet 法律信息 同族专利 专利引用
    • 3. 发明授权
      US06141655A Method and apparatus for optimizing and structuring data by designing a cube forest data structure for hierarchically split cube forest template 失效
    • Method and apparatus for optimizing and structuring data by designing a cube forest data structure for hierarchically split cube forest template
    • US06141655A
    • 2000-10-31
    • US936000
    • 1997-09-23
    • Theodore Johnson , Dennis Shasha
    • Theodore Johnson , Dennis Shasha
    • G06F17/30
    • G06F17/30327 , G06F17/30336 , G06F17/30592 , Y10S707/99932 , Y10S707/99933
    • The paradigmatic view of data in typical decision support applications divides the attributes (or fields) in the data records into two groups: dimensional attributes and value attributes. The dimensional attributes classify the record, while the value attributes indicate a measured quantity. The dimensional attributes can be partitioned into a set of dimensions, which are orthogonal descriptions of the record. The attributes within a dimension form hierarchies of descriptions of the record, ranging from a coarse to a description. For example, the database might consist of records of retail sales collected from individual stores and brought together into a central data warehouse. This database might have three dimensions: store location, product, and time of sale. The value attribute might be the dollar value of the sale. A dimension might contain several attributes. For example, the store location dimension might consist of country, region, state, county, and zip code. These attributes form a hierarchy because knowing the value of a fine attribute (e.g., zip code) tells you the value of a coarse attribute (e.g., country). The attributes in the time dimension might be year, month, week, day, and hour. This dimension has multiple hierarchies because months do not contain an integral number of weeks. A large class of decision support queries ask for the aggregate value of one or more value attribute, where the aggregation ranges over all records whose dimensional attributes satisfy a selection predicate. For example, a query might be to find the sum of all sales of blue polo shirts in Palm Beach during the last quarter. A data table that can be described in terms of dimensions and value attributes is often called a "data cube." The records in our retail sales example can be imagined to exist in a three dimensional cube, the dimensions being the dimensional attributes. Queries, such as the example query, can be thought of as corresponding to sums over regions of the data cube. We describe herein a file structure (i.e., the Cube Forest) for storing a data cube that ensures fast response to the queries. The algorithms included herein are: (1) algorithms to load data into a cube forest; (2) algorithms to obtain an aggregate from the cube forest in response to a query; and (3) algorithms that compute an optimal cube forest structure.
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Espacenet 法律信息 同族专利 专利引用
    • 5. 发明授权
      US08713149B2 Data feed management 失效
    • Data feed management
    • 数据Feed管理
    • US08713149B2
    • 2014-04-29
    • US13219744
    • 2011-08-29
    • Vladislav Shkapenyuk , Theodore Johnson , Divesh Srivastava
    • Vladislav Shkapenyuk , Theodore Johnson , Divesh Srivastava
    • G06F15/173
    • H04L67/26
    • The present disclosure is directed to systems, methods, and computer-readable storage media for data feed management. Data feeds can be received at one or more landing directories associated with a feed management system. The feed management system can be configured to map the data feeds in the landing directories to one or more subscribers, and the data feeds can be moved to one or more staging directories associated with the subscribers. The data feeds can be delivered to the one or more subscribers from the staging directories. Receipts indicating delivery of the data feeds can be stored by the feed management system. The feed management system can be configured to manage data feeds, landing directories, and staging directories.
    • 本公开涉及用于数据馈送管理的系统，方法和计算机可读存储介质。 可以在与饲料管理系统相关联的一个或多个着陆目录处接收数据馈送。 饲料管理系统可以被配置为将登陆目录中的数据馈送映射到一个或多个订户，并且数据馈送可以被移动到与订户相关联的一个或多个暂存目录。 数据源可以从分段目录传递给一个或多个订户。 可以由饲料管理系统存储指示饲料数据的收料。 饲料管理系统可以被配置为管理数据馈送，登陆目录和登台目录。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Espacenet 法律信息 同族专利 专利引用
    • 9. 发明授权
      US06216125B1 Coarse indexes for a data warehouse 失效
    • Coarse indexes for a data warehouse
    • 数据仓库的粗略索引
    • US06216125B1
    • 2001-04-10
    • US09109516
    • 1998-07-02
    • Theodore Johnson
    • Theodore Johnson
    • G06F1730
    • G06F17/30324 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943
    • A coarse database index, and system and method of use therefor, that will quickly indicate which data partitions of a table contain a given key. Once the target data partitions are located, the exact record locations can be found using traditional indexes. The coarse indexes take little space, can be updated quickly, and searched quickly. The coarse index is in conjunction with a database including a plurality of data partitions. Each data partition includes data, including a plurality of key values of at least one key, and at least one dense index referencing the data. The coarse index indexing the plurality of key values according to data partitions containing each key value. The coarse index includes a first bitmap, which is preferably arranged in key value major format. The coarse index may also include a second bitmap, which is preferably arranged in data partition major format. The second bitmap may be transformed from data partition major format to key value major format. The first and second bitmap partitions may be compressed.
    • 粗略的数据库索引及其使用的系统和方法，将快速指示表的哪些数据分区包含给定的键。 一旦找到目标数据分区，可以使用传统的索引找到确切的记录位置。 粗略的索引空间很小，可以快速更新，快速搜索。 粗略索引与包括多个数据分区的数据库相结合。 每个数据分区包括数据，包括至少一个键的多个键值，以及引用该数据的至少一个密集索引。 粗略索引根据包含每个键值的数据分区来索引多个键值。 粗略索引包括优选地以键值主要格式布置的第一位图。 粗略索引还可以包括优选地以数据分区主格式布置的第二位图。 第二位图可以从数据分区主要格式转换为键值主要格式。 可以压缩第一和第二位图分区。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Espacenet 法律信息 同族专利 专利引用
每页展示10个专利
每页展示10个专利
每页展示20个专利
每页展示50个专利
每页展示100个专利

IPRDB

最新中国发明专利 最新美国发明专利 技术领域 专利库 专利分类库 国际专利分类库

热门服务

会员版试用 API 数据接口 找代理 知嘟嘟专利交易 排行榜 大学排行榜 专利百科

关于我们

平台介绍 战略合作 网站地图

友情链接

知嘟嘟专利交易 国家知识产权局 中国商标网

联系方式


©2019-2023 上海吉码数字技术有限公司 版权所有，并保留所有权利 沪ICP备20016256号-6 沪公网安备31011702005475号