261 results about "Data layout" patented technology

A dynamically expandable and contractible fault-tolerant storage system permits variously sized storage devices. Data is stored redundantly across one or more storage devices if possible. The layout of data across the one or more storage devices is automatically reconfigured as storage devices are added or removed in order to provide an appropriate level of redundancy for the data to the extent possible. A hash-based compression technique may be used to reduce storage consumption. Techniques for freeing unused storage blocks are also disclosed.

A cache-based storage architecture has primary and secondary storage subsystems that are controlled by first and second data layout engines to provide a high-performance storage system. The primary storage subsystem illustratively comprises non-volatile electronic storage media configured as a cache, while the secondary storage subsystem comprises magnetic storage media configured as a disk array. The data layout engines illustratively implement data layout techniques that improve read and write performance to the primary and secondary storage subsystems. To that end, the data layout engines cooperate to optimize the use of the non-volatile cache as a primary storage stage that efficiently serves random data access operations prior to substantially transposing them into sequential data access operations for permanent (or archival) storage on the disk array.

To implement an efficient user operation by making it possible to set links between a plurality of containers at once by one operation, in a layout control method which sets a link between partial display regions to connect them to each other, the partial display regions receiving assigned data and laying out the data on a page, and adjusts the position of each partial display region on the basis of the data assigned to it, a plurality of links are set for a plurality of partial display regions, the plurality of partial display regions are designated, the position information of each designated partial display region is acquired, and in a case where setting of a plurality of links is instructed, a plurality of links are set for the plurality of designated partial display regions, on the basis of the acquired position information.

Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.

A method and system for generating a decision-tree classifier from a training set of records, independent of the system memory size. The method includes the steps of: generating an attribute list for each attribute of the records, sorting the attribute lists for numeric attributes, and generating a decision tree by repeatedly partitioning the records using the attribute lists. For each node, split points are evaluated to determine the best split test for partitioning the records at the node. Preferably, a gini index and class histograms are used in determining the best splits. The gini index indicates how well a split point separates the records while the class histograms reflect the class distribution of the records at the node. Also, a hash table is built as the attribute list of the split attribute is divided among the child nodes, which is then used for splitting the remaining attribute lists of the node. The method reduces I/O read time by combining the read for partitioning the records at a node with the read required for determining the best split test for the child nodes. Further, it requires writes of the records only at one out of n levels of the decision tree where n>/=2. Finally, a novel data layout on disk minimizes disk seek time. The I/O optimizations work in a general environment for hierarchical data partitioning. They also work in a multi-processor environment. After the generation of the decision tree, any prior art pruning methods may be used for pruning the tree.

Methods and apparatus of the present invention include storing redundant parity information in storage devices that are configured in a RAID array. Conventional hard disk drives are configured to store data in RAID 3 or RAID 4 data layouts. A storage controller is configured to generate the parity information for the data written to the hard disk drives. One or more of the devices storing the parity information may be a flash storage device.

The invention discloses a method and a system for managing data of a cluster storage system and belongs to the technical field of cluster storage. The method includes that a disk file system is used for storing and managing meta data, and the data are distributed by using a catalogue as a basic unit; a client senses data distribution information and sends a data access instruction, a storage server judges whether a finding path is a root catalogue according to the data access instruction of the client, a specific active node is selected to be a target node for data access if the finding path is the root catalogue, otherwise, a Hash value is calculated according to path input parameters to obtain the data distribution information, and finding the target node for data access. According to the method and the system for managing the data of the cluster storage system, a series of relevant problems of performance bottlenecks, single point faults, data inconsistency and the like of meta data management are eliminated, system expansibility is obviously improved, and linear expansion increase of system concurrency and performances is achieved.

The invention relates to the field of video storage, and discloses a storing and repairing method and a storing and repairing device for repairable video monitoring data. By using the storing and repairing method, positions of metadata, index files and video recording files of a file system on a magnetic disk are fixed according to characteristics of video storage; when the file system is damaged, the metadata of the file system are reestablished by a preset rule, and the original pre-distributed file is recovered; and because the positions of the file data in the magnetic disk are not changed, the data which are written in the magnetic disk cannot be lost. The storing and repairing method can support different file systems, and does not depend on the metadata of the original file system; and monitoring software is not required to be written in the magnetic disk, extra backup space is not required, and the video data can be repaired. A partition formatting mode of the magnetic disk is fixed according to specifications of different file systems; and data layouts formed by formatting at different times are the same as long as the data are in the same partition of the magnetic disk.

A method for displaying a time-series data set. The method may include determining a number of data intervals for the data set, determining a data resolution for each data interval, partitioning a display space into a number of substantially equally sized partitions equal to the number of data intervals, partitioning the dataset into a number of time-relevance-based subsets equal to the number of partitions based on the currentness of the data and the desired data resolution for each partition, determining a data layout for each partition, and associating the data values for each subset with the corresponding layout. Furthermore, the first subset may consist of more current data at a first resolution and the second subset may consist of data that is less current than the first subset at a lower resolution than the first resolution.

Embodiments of the invention relate to intra-block organized storage placement. One embodiment includes obtaining a file in a file system. The file is separated into multiple blocks. The multiple blocks are separated into at least two correlated sub-blocks. Intra-file block organized storage placement on different memory devices is determined for the at least two correlated sub-blocks in a file system metadata layout.

A system and method for segmenting, distributing and replacing streaming multimedia clips in a network system including at least one origin server connected to a plurality of streaming caches via an interactive distribution network, such as the Internet. The at least one origin server stores a plurality of streaming multimedia clips in an associated memory and segments the clips into a plurality of data segment of exponentially increasing size; the origin server then distributes the plurality of data segments to the plurality of streaming caches where each streaming cache decides whether to store or discard each segment in accordance with a predefined probability. Another aspect of the invention involves replacing stored data segments at each of the plurality of streaming caches as needed. In one embodiment, a hotness rating is computed for each streaming multimedia clip stored in an SC. Clips are replaced as needed based on their hotness rating relative to other clips. In a second embodiment, a potential function is computed for each segment stored in an SC. Segments are replaced as needed based on their potential function value relative to other stored segments.

A data processing apparatus which is capable of automatically calculating layout information suitable for various materials and outputting a document interpretable by a driver of a printing apparatus. An input section 103 inputs data. A data analysis section 107 analyzes the input data. A layout processing section 108 generates layout information on the data based on a result of the analysis by the data analysis section. The layout processing section 108 lays out the data based on the generated layout information and converts the data laid out into a document printable by the printing apparatus.

The present invention is directed to a method and system for automatically and continuously updating a printer driver configuration. A first computer program residing on a controller, which acts to monitor the printer configuration, is activated. The printer configuration is read from the controller configuration and updates the DEVMODE data. The detection of a change in any attribute of the printer configuration causes a second program to activate. DEVMODE data is updated using a data layout described in an XML file. The data layout in the XML file will be packaged with the controller during building, as well as available on a CD-ROM, other portable device, or stored on a central location and accessed over a computer network for the updating printer drivers on the controller when new versions are released. The second program retrieves current printer configuration data using SNMP communications and writes this data to the registry. The registry is then updated by the second computer program using to account for the changes detected by the first computer program in accordance with the data layout of the XML file.

A cache replacement system and method for changing the number of cached copies of segments of a media clip in response to rank change for the media clip is disclosed. Whenever rank change for a media clip is detected at an origin server, rank change information is distributed to proxy servers organized in a loosely coupled distributed cache. Each proxy server uses this information to recompute caching probabilities for segments of the media clip in order to determine which segments of the clip to store or discard, thereby forming a new cache layout for the clip at each proxy server. Segments are neither added nor deleted to build the new cache layout until client requests for segments of the clip are received at proxy servers. Upon receiving client requests, construction of the new cache layout occurs on a segment-by-segment basis by employing techniques of lazy caching and token exchange.

The invention belongs to the technical field of a database, and discloses a gray-code-based distributed data layout method. The method comprises the steps of: dividing a range of each attribute into a plurality of equal portions; encoding according to a gray code order; marking a certain attribute value of a tuple comprising a plurality of attributes through the gray codes of the equal portions of the attribute value, namely an index code of the attribute value; forming an index key value of the tuple by mixing the index code of each attribute value in the tuple, wherein the tuple achieves the distributed data layout according to the order of the gray codes, the distributed data layout is deployed on a distributed system, the bitmap index of content perception is achieved at a host computer terminal of the system and the content perception is stored in a file name, and physical storage of data and statistical index of the data are achieved on a slave terminal of the system. The invention also discloses a query method employing the database formed by means of the method. The data layout obtained by the method can meet the requirements of data processing such as exact matching search, range search, multi-dimensional search, multi-attribute search and aggregated analysis, and the method is high in disc access efficiency.

A fault-tolerance storage system allowing storage devices of various sizes to be dynamically expandable and contractile. If possible, data may be stored redundantly across one or more storage devices. With the addition or deletion of the storage devices, a data arrangement across one or more storage devices is automatically configured to provide redundance with appropriate level for data as much as possible. It is possible to reduce the consumption of the storage devices by compression technology based on hashing function. Also disclosed is a technology for releasing unused storage blocks.

A system to optimize layout of database objects in a relational database management system stored on a plurality of storage classes each characterized by a price and a storage capacity includes a time-based query optimizer and a layout recommender coupled to the time-based query optimizer to estimate a total cost of operation (TCO) for a query workload on each data layout. The layout recommender includes an auxiliary object selection comprising database objects that include auxiliary objects that are optional to place with auxiliary object candidates being given from an auxiliary object recommender component.