Abstract: An approach for generating an index in Darwin Information Typing Architecture (DITA) source files. The approach determines a gerund-noun listing based, at least in part, on one or more files. The approach determines a prioritized index of the gerund-noun listing. The approach determines one or more similar index entries of the prioritized index. The approach determines whether a fraternal association exists between at least two of the one or more similar index entries. Responsive to a determination that a fraternal association exists between at least two of the one or more similar index entries, the approach determines whether an inheritance from a parent exists. The approach determines based, at least in part, on whether a fraternal association exists and whether an inheritance from a parent exists, a DITA index.

Abstract: An indexing system for documents such as web pages divides a document into elements, such as document object model elements. User attention data from prior interactions with the document are analyzed to determine those elements of a document that satisfy a threshold requirement of user attention. Elements meeting the user attention threshold requirement are added to a set of indexable content for the document. Furthermore, document sections are determined based on attention data and each section is indexed separately. Indexing is per section and based only on the indexable content, thereby enhancing the index relevance, increasing the efficiency of search engines and reducing spamdexing.

Abstract: An indexing system for documents such as web pages divides a document into elements, such as document object model elements. User attention data from prior interactions with the document are analyzed to determine those elements of a document that satisfy a threshold requirement of user attention. Elements meeting the user attention threshold requirement are added to a set of indexable content for the document. Furthermore, document sections are determined based on attention data and each section is indexed separately. Indexing is per section and based only on the indexable content, thereby enhancing the index relevance, increasing the efficiency of search engines and reducing spamdexing.

Abstract: The subject matter disclosed herein provides methods for reformatting a page due to a rollover. An in-memory array holding a column of data can be maintained. One or more pages can be maintained. Each page can have one or more rows for storing the column of data. The column of data in the in-memory array can be monitored for a change. A rollover can be performed on at least one of the pages based on the change. The rollover can reformat the at least one page by rewriting metadata associated with the at least one page. Related apparatus, systems, techniques, and articles are also described.

Abstract: An aspect of synchronization of time between simulation models includes receiving a specification request for generating a set of target time-series data using a set of source time-series data, obtaining specification information relating to the set of source time-series data, obtaining specification information relating to the set of target time-series data and obtaining the source time-series data; comparing the source specification information and the target specification information to determine if the set of source time-series data are time-aligned with the set of target time-series data, and converting the set of source time-series data to the set of target time-series data upon determination that time alignment is needed.

Abstract: Methods and systems are provided that may include a memory device having a physical nonvolatile memory, a memory space, and a controller. At least a portion of a physical nonvolatile memory may permit a direct read operation of the physical nonvolatile memory and prohibit a direct write operation of the physical nonvolatile memory. A memory space may comprise at least open one write overlay window available after a reset operation. Such a memory space may be adapted to permit at least one read overlay window to be opened that is logically separate from at least one open write overlay window. A controller may be included to open at least one read overlay window.

Abstract: A mechanism is disclosed that enables garbage collection of object instances that have persistent data and a mutable key. A mutable key capability is advantageous in a variety of applications, such as monitoring a set of users and their login status on a plurality of media servers (e.g., an email server, an instant messaging server, a voice mail server, a video server, an audio-conferencing server, etc.). Implementations based on the Enterprise JavaBean specification are disclosed for three illustrative embodiments of the present invention. The illustrative embodiments of the present invention can also be implemented in accordance with object persistence mechanisms other than Enterprise JavaBeans.

Abstract: A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block.

Abstract: Technologies are disclosed herein that allow for utilization of memory channel storage (“MCS”) devices in a computing system. The MCS device may be detected during a boot phase of the computing system, and the address data for the MCS device may be detected through repeated manipulation of a logical offset. The address data may then be stored for later use in memory allocation.

Abstract: A data structure and a mechanism to manage storage of objects is disclosed. The data structure can be used to manage storage of objects on any storage device, whether in memory or some other storage device. Given an object ID (OID) for an object, the system can identify a tuple that includes a device ID and an address. The device ID specifies the device storing the object, and the address specifies the address on the device where the object is stored. The application can then access the object using the device ID and the address.

Abstract: A Data Storage Device (DSD) is in communication with a plurality of sensing devices. Data is received for storage in the DSD from a sensing device of the plurality of sensing devices. The received data is associated with at least one storage hint assigned to the sensing device. A media region of the DSD is selected from a plurality of media regions for storing the received data based on the at least one storage hint and at least one characteristic of the media region.

Abstract: The current consumed by flash memory devices on the channels of a solid-state drive (SSD) device will be in the form of a time varying waveform, characterized mainly by the types of commands being processed, and are often in the form of periods of constant levels interspersed with very short high current peaks or spikes. When multiple commands are being processed, significant high current peak demands and current surges can occur. The invention described herein is a device and method for scheduling commands to be processed in order to reduce the size of peak current demands and current surges. According to one embodiment of the invention, the device and method for scheduling a command uses look-up tables to determine the time to initiate the processing of the command by the flash memory devices.

Abstract: Apparatuses, systems, and methods are disclosed for controlling commands for non-volatile memory. An apparatus includes one or more memory die. A memory die includes a command/address buffer, an on-die controller, and a plurality of non-volatile memory cores that share a data path. A core includes an array of non-volatile memory cells. A command/address buffer queues command and address information for a plurality of storage operations for one or more non-volatile memory cores. An on-die controller initiates a first unexecuted read operation and a first unexecuted write operation from a command/address buffer in parallel, in response to determining that core dependencies are satisfied for a read operation and a write operation.

Abstract: A method for memory-efficient backup of a logical-to-physical (LtoP) table in a storage device having a processor, a volatile memory, and a non-volatile memory, includes retrieving and subsequently processing, by the processor, a plurality of flushed zone segments stored in a first block stripe of the non-volatile memory in an order opposite to an order of storage of the plurality of flushed zone segments in the first block stripe in the non-volatile memory, wherein the processing of the plurality of flushed zone segments includes identifying a retrieved flushed zone segment of the plurality of flushed zone segments differing from all previously retrieved plurality of flushed zone segments, and writing the identified retrieved flushed zone segment of the plurality of flushed zone segments to a second block stripe of the non-volatile memory.

Abstract: A memory system includes a memory device including a plurality of memory chips each including a plurality of memory blocks grouped as one or more super blocks, wherein the memory blocks each include a plurality of pages suitable for storing write data requested from a host, and a controller suitable for checking a size of the write data and free pages of the super blocks, determining a first super block corresponding to the checked size of the write data based on the checked free pages among the super blocks, and programming the write data in memory blocks of the first super block.

Abstract: A method for accelerating recovery in a data replication environment includes maintaining a secondary out-of-sync bitmap for a secondary volume. The secondary out-of-sync bitmap indicates which storage elements on the secondary volume are not synchronized with storage elements on a primary volume. The method further generates, for the primary volume, a tracking bitmap indicating which storage elements on the primary volume need to be updated with data from the secondary volume. This tracking bitmap is initialized with values from the secondary out-of-sync bitmap. Upon receiving a write from the secondary volume to a storage element on the primary volume, the method resets the corresponding bit in the tracking bitmap. Upon receiving a write from a host system to a storage element on the primary volume, the method also resets the corresponding bit in the tracking bitmap. A corresponding system and computer program product are also disclosed.

Abstract: Various embodiments for multipath management in a storage grid, by a processor device, are provided. In one embodiment, a method comprises continuously monitoring and comparing current data path devices against the current storage structure, and changing routing decision configurations when it is detected there is a more efficient data path.

Abstract: A storage management solution according to certain embodiments is provided which decouples certain aspects of the storage manager from the data storage cell. The data storage system according to certain aspects can provide one or more external storage managers that manage data protection and administer the operation of data storage cells. According to certain aspects, usage of the decoupled storage manager can be allocated amongst multiple data storage cells, such as by data storage cells of multiple companies, sub-units of a company, or both.

Abstract: A method of managing data in a cache upon a cache write operation includes determining a number of non-contiguously written sectors on a track in the cache and comparing the number with a threshold number. If the number exceeds the threshold number, a full background stage operation is issued to fill the non-contiguously written sectors with unmodified data from a storage medium and the full track is then destaged. A corresponding system includes a cache manager module operating on the storage subsystem. Upon a determination that a cache write operation on a track has taken place, the cache manager module determines a number of non-contiguously written sectors on the track, compares the number with a predetermined threshold number, issues a background stage operation to fill the non-contiguously written sectors with unmodified data from a storage medium if the number exceeds the threshold number, and then destages the full track.

Abstract: Provided are a method, a system, and a computer program product in which a storage controller determines a plurality of parts of a dataset. At least one part of the dataset is stored in a local storage coupled to the storage controller. At least one other part of the dataset in one or more cloud storages coupled to the storage controller.