| Patent application number | Description | Published |
|---|
| 20090265360 | Dynamically Quantifying and Improving the Reliability of Distributed Data Storage Systems - Data is stored in a distributed data storage system comprising a plurality of disks. When a disk fails, system reliability is restored by executing a set of reconstructions according to a schedule. System reliability is characterized by a dynamic Normalcy Deviation Score. The schedule for executing the set of reconstructions is determined by a minimum intersection policy. A set of reconstructions is received and divided into a set of queues rank-ordered by redundancy level ranging from a lowest redundancy level to a highest redundancy level. For reconstructions in each queue, an intersection matrix is calculated. Diskscores for each disk are calculated. The schedule for the set of reconstructions is based at least in part on the intersection matrices, the Normal Deviation Scores, and the diskscores. | 10-22-2009 |
| 20100064166 | SCALABLE SECONDARY STORAGE SYSTEMS AND METHODS - Exemplary systems and methods in accordance with embodiments of the present invention may provide a plurality of data services by employing splittable, mergable and transferable redundant chains of data containers. The chains and containers may be automatically split and/or merged in response to changes in storage node network configurations and may be stored in erasure coded fragments distributed across different storage nodes. Data services provided in a distributed secondary storage system utilizing redundant chains of containers may include global deduplication, dynamic scalability, support for multiple redundancy classes, data location, fast reading and writing of data and rebuilding of data due to node or disk failures. | 03-11-2010 |
| 20100070698 | CONTENT ADDRESSABLE STORAGE SYSTEMS AND METHODS EMPLOYING SEARCHABLE BLOCKS - In accordance with exemplary embodiments of the present invention, a content addressable data structure system may include directed acyclic graphs (DAGs) of data content that are addressed using both a user-defined search key and content of data blocks. Internal keys of retention roots of the DAGs may be derived from the user-defined search key while the remaining blocks may be content addressed. As opposed to using a content address, the user may provide the search key when retrieving and deleting DAGs retaining the data content. In addition, the internal keys may be implemented using internal content addressable storage operations, such as applying a hash function and employing a distributed hash table. | 03-18-2010 |
| 20110161168 | STRUCTURED ANALYSIS AND ORGANIZATION OF DOCUMENTS ONLINE AND RELATED METHODS - An online data storage system ( | 06-30-2011 |
| Patent application number | Description | Published |
|---|
| 20080201335 | Method and Apparatus for Storing Data in a Peer to Peer Network - A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost. | 08-21-2008 |
| 20080201428 | Method for Operating a Fixed Prefix Peer to Peer Network - A fixed prefix peer to peer network has a number of physical nodes. The nodes are logically divided into a number of storage slots. Blocks of data are erasure coded into original and redundant data fragments and the resultant fragments of data are stored in slots on separate physical nodes such that no physical node has more than one original and/or redundant fragment. The storage locations of all of the fragments are organized into a logical virtual node (e.g., a supernode). Thus, the supernode and the original block of data can be recovered even if some of the physical nodes are lost. | 08-21-2008 |
| 20080221856 | Method and System for a Self Managing and Scalable Grid Storage - The present invention generally provides a method for grid storage including balancing read and write requests from applications across a first group of nodes in a grid storage system for avoiding hot spots and optimizing performance through smart caching; balancing storage capacity across a second group of nodes in the grid storage system, nodes in the first and second groups being at least one of hardware interchangeable online, capable of being added to change performance or capacity of the grid storage system and capable of being removed to change performance or capacity of the grid storage system; and self managing of the first and second groups of nodes for providing at least one of scalability, self healing after failure of components in the grid storage, non-disruptive upgrades to the grid storage system, and eliminating duplicate data on an object or sub-object level in the grid storage system. | 09-11-2008 |
| Patent application number | Description | Published |
|---|
| 20080222170 | COMPUTER SYSTEM ARCHITECTURE FOR AUTOMATIC CONTEXT ASSOCIATIONS - A computer system models human memory by deriving associations between objects, events, and the context of the computer user or users. These associations can be dynamically generated, changing depending on the behavior of the user and context. Examples of areas in which this system can be used include time management (e.g., a calendar that presents time-based groupings of objects), people management (e.g., use analysis of user communications to rank importance of people to the user, groupings, and associations between people/groups and other objects such as documents, email), and general computer management (e.g., use analysis of user behavior to identify important objects and objects that are related to a current focus and context of the computer user). | 09-11-2008 |
| 20090326980 | FLAGGING TO CONTROL ACCESS TO HEALTH INFORMATION - A method for protecting access to health information. The method includes presenting a graphical user interface for accessing health information. The health information may include a health record which includes at least one item. A request to access the health record is received and the health record is retrieved from a data store. The items of the health record are filtered based on a source of the request to access the health record. A portion of the health record may be displayed. | 12-31-2009 |
| 20100197327 | Mobile Communication Device Dynamic Service Application and Dynamic Service Application Scripting - A dynamic service application is stored and executed on a mobile or wireless communication device (e.g., a cellular telephone) to enable it to be programmed without specialized hardware, software, and other proprietary information. For example, dynamic service application programs or scripts may be entered directly by a user or may be received as a wireless or radiated digital message transmission. The dynamic service application executes the dynamic service application script, which is of a format to accommodate wireless or radiated transmission and storage on the device. The dynamic service application script may be written by a user on a computer or a mobile communication device or may be written with the aid of scripting “wizard” software. In addition to being received as radiated transmissions, dynamic service application scripts may also be sent as radiated transmissions from mobile communication devices to other devices or computers. | 08-05-2010 |
| 20100217612 | CHOOSING LOCATION OR MANNER OF STORING DATA - Data may be stored in a location or manner that takes various considerations into account. Examples of such considerations are the availability, speed and cost of storage resources, and commercial and regulatory expectations concerning the reliability, security, and/or availability of the stored data. When a piece of data is to be stored, a storage choice component may take the above-considerations into account in order to determine where the data is to be stored, how many copies of the data are to be made, whether the data is to be encrypted, and/or other issues. Additionally, a migration engine may re-evaluate data that has already been stored in order to determine whether the data may be migrated to other storage resources, and/or whether changes may be made with regard to issues such as the encryption level and/or the number of stored copies of the data. | 08-26-2010 |
| 20100235410 | DISTRIBUTED DATA STORAGE - In one example, data may be divided into blocks, and the blocks may be stored in various storage resources. Data to be stored may be provided to a data divider. The data divider may divide the data into blocks. Redundancy may be introduced into the blocks to allow the original data to be reconstructed at some point in the future, even if fewer than all of the original blocks are available. The blocks may be sent to a data shuffler, which may shuffle the blocks, and may provide a key that describes how to reconstruct the original data from the blocks. The key may be provided to the owner of the data. When the original data is to be retrieved, the key may be provided to a reassembler, which retrieves the blocks from the various storage resources and reconstructs the data using the key. | 09-16-2010 |
| 20110035421 | SHARING FILES ON A COMPUTER THROUGH USE OF URIS - A system described herein includes a receiver component that receives a computing event with respect to a file stored in a data repository of a personal computing device. An assignor component automatically assigns a uniform resource identifier to the file responsive to the receiver component receiving the computing event with respect to the file, wherein at least a portion of content of the file is reviewable by way of a web browser through utilization of the uniform resource identifier. | 02-10-2011 |
| 20110276884 | SCALABLE AFFINITIZED STATE MANAGEMENT - A state affinitized system comprises worker computing devices uniquely affinitized with one or more states such that only those worker computing devices maintain local copies of the states with which they are affinitized. Requests and data relevant to a state are directed to the worker computing device affinitized with that state, such as by front-end computing devices. A centralized persistent storage can maintain a copy of each state and can modify the states in response to newly received information in the same manner as the worker computing devices. Such maintenance can be performed by coalescer computing devices, which can also derive second order data from the states in the centralized persistent storage, which can be further added to the state and also communicated to the worker computing device affinitized with that state. Crawler computing devices can obtain additional information for incorporation into states from network-based information repositories and services. | 11-10-2011 |
| 20110320603 | APPLICATION INTEGRATION OF NETWORK DATA BASED ON RESOURCE IDENTIFIERS - A resource identifier parser can derive information from resource identifiers that are provided to non-browser application programs or the operating system, such as through the desktop area of a windows-based user interface. The resource identifier parser can understand the formatting of resource identifiers of specific domains and can derive therefrom information such as coordinates of a map page, the title of classified listings, and other like information. If the resource identifier cannot be parsed, the identified data page can be referenced to identify services offered by the page, such as data feed services, which can then be presented to the non-browser application program or the operating system to which the resource identifier was provided. As yet another alternative, the domain can provide a customized resource identifier parser to parse its resource identifiers. Such a customized parser can be either downloadable and locally executable or it can be a network service. | 12-29-2011 |
