Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: A scalable writing system, the system having: a user interface for textual input for creating content; at least one database having at least one set of writing criteria for applying to said created content to generate targeted content.

Abstract: Aspects of the present disclosure involve a mobile or computer reader application that obtains articles or other computer files from a central database and displays the articles to a user of the device. The reader application may be customizable around one or more characteristics of the user of the device. In one embodiment, the type and number of articles provided to the device and displayed in the reader application may be based on the determination of a category or type of usage of the application is performed by the user. Further, the determination of the use of the reader application on the device is performed by and contained within the device such that usage information is not shared with overall article providing system. In another embodiment, the article providing system and/or device may determine recommendations to provide to a user of the reading application. These recommendations may be based on one or more selected interests or topics of the user of the reading application.

Abstract: Methods and systems are disclosed to access memory locations using auxiliary keys in addition to primary keys. Commands are received by a memory management unit to insert or access records in an exact match keyed lookup table where records include keys (i.e., primary keys), auxiliary keys, and data. When a command to insert a new record is received along with key and data, the memory management unit generates a new unique auxiliary key. The auxiliary key includes a table index generated from the key and a collision index that is unique for any records having the same table index. The key, the auxiliary key, and the data for the new record are then stored within the lookup table along with a collision pointer that links records having the same table index. Subsequently, commands to access the new record can selectively use either the original key or the auxiliary key.

Abstract: A data storage system may implement recommending throughput capacity for generating a secondary index for an online table. Secondary indexes may be created for a table stored in multiple partitions in the data storage system. The data storage system may allow users to provision throughput capacity to process access requests at secondary indexes. The throughput capacity may also be used to perform updates at the secondary index as part of generating the secondary index. A creation throughput capacity may be determined that compensates for performing the updates to generate the secondary index. A user may receive a recommendation with the creation throughput capacity for creating the secondary index and may accept or modify the creation throughput capacity. The creation throughput may be automatically provisioned to create the secondary index, in some embodiments.

Abstract: A physical storage controller may be configured to: (i) in connection with a command to copy data from an information handling system to a second information handling system communicatively coupled to the information handling system via a network, receive file system metadata of a storage resource of the information handling system from an application-level protocol executing on an information handling system to which the physical storage controller is integral; (ii) construct controller mega-data from the file system metadata; (iii) construct a plurality of datagrams comprising one or more of the controller mega-data, the file system metadata, and data to be copied from the information handling system to the second information handling system; (iv) communicate the plurality of datagrams to a second physical storage controller of the second information handling system independent from any operating system executed on the information handling system.

Abstract: Described are methods, systems, and apparatus, including computer program products for generating a computer-executable script for processing storage system data files. Storage system data files are selected based on data structure description files, and computer-executable statements are generated for loading the selected files into storage system data tables. Storage system data fields are selected from the tables based on data structure description files, and computer-executable statements are generated for filtering the tables based on the selected fields. A join sequence is determined based on properties of the filtered tables, and computer-executable statements are generated for joining the filtered tables based on the join sequence. The joined table is formatted based on data structure description files, and computer-executable statements are generated for creating an output based on the formatted joined table.

Abstract: In one embodiment of the present description, data is migrated to a replacement source storage unit of a storage subsystem while being mirrored from the original source storage unit of a storage subsystem to an original target storage unit of a storage subsystem, and the original source storage unit and the replacement storage unit are swapped in a multi-storage volume swap to write updates to the replacement source storage unit instead of the original source storage unit, in input/output operations issued by at least one host. Further, data stored in the replacement source storage unit, is mirrored from the replacement source storage unit to the original target unit. Other aspects are described.

Abstract: Disclosed is a system, method, and computer program product for performing semantic analysis and creating topics with regards to social data. A user interface is provided that allows the user to view and interact with to view and control the process/mechanism or creating topics. The user interface allows the user to create one or more text-based filters and metadata filters based on which social data for each topic is filtered.

Abstract: Embodiments of the present teachings disclose method, system, and programs for a multi-phase ranking system for implementation with a personalized content system. The disclosed method, system, and programs utilize a weighted AND system to compute a dot product of the user profile and a content profile in a first phase, a content quality indicator in the second phase and a rules filter in a third phase.

Abstract: In an example, one or more leaf category specific unsupervised statistical language model (SLM) models are trained using sample item listings corresponding to each of one or more leaf categories and structured data about the one or more leaf categories, the training including calculating an expected perplexity and a standard deviation for item listing titles. A perplexity for a title of a particular item listing is calculated and a perplexity deviation signal is generated based on a difference between the perplexity for the title of the particular item listing and the expected perplexity for item listing titles in a leaf category of the particular item listing and based on the standard deviation for item listing titles in the leaf category of the particular item listing. A gradient boosting machine (GBM) fuses the perplexity deviation signal with one or more other signals to generate a miscategorization classification score corresponding to the particular item listing.

Abstract: A software tool and database that enables a user to view information, on the one hand, pertaining to hardware and software product inventory and usage, and, on the other hand, to license agreement information in such way that the two sets of information are correlated and associated. The tool presents inventory and usage information based on agreement criteria and/or agreement information based on inventory and usage criteria in an integrated fashion that permits the user to switch from one kind of information to the other kind in a variety of convenient ways. The main functional blocks of the software tool include a data acquisition tool, a reconciliation and association tool, and a processing/display/output tool.

Abstract: Various systems, processes, and products may be used to manage remote data replication. In particular implementations, a system and process for managing remote data replication may include the ability to store versions of a disk at a first site, a second site, and a third site. The version of the disk at the first site may store input/output for a host system, the version at the second site may be a synchronous replication of the version at the first site, and the version at the third site may be an asynchronous replication of the version at the first site. The system and process may also include the ability to synchronize the version at the first site with the version at the third site if the second site is unavailable and synchronize the version at the second site with the version at the third site if the first site is unavailable.

Abstract: Various systems, processes, and products may be used to manage remote data replication. In particular implementations, a system and process for managing remote data replication may include the ability to store versions of a disk at a first site, a second site, and a third site. The version of the disk at the first site may store input/output for a host system, the version at the second site may be a synchronous replication of the version at the first site, and the version at the third site may be an asynchronous replication of the version at the first site. The system and process may also include the ability to synchronize the version at the first site with the version at the third site if the second site is unavailable and synchronize the version at the second site with the version at the third site if the first site is unavailable.

Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: A distributed storage system called StorFS that performs distributed data deduplication is described. In an exemplary embodiment, a storage controller server determines if there is duplicative data in a distributed storage system. In this embodiment, the storage controller server determines if an entity is duplicated in the distributed storage system in line with an incoming input/output operation. The storage controller server determines if the entity is duplicated in the distributed storage system by receiving the entity and looking up the entity in a data deduplication table. If the entity exists in the data deduplication table, the storage controller server updates the metadata for the entity to point to the duplicate entity.

Abstract: A method, article of manufacture, and apparatus for managing a computing environment, such as a cloud data repository. In some embodiments, this includes providing a data archive, and relegating data items to a second, long-term data archive. In some embodiments, data items may be converted to an archive format prior to being relegated.

Abstract: Techniques for query optimization for group-by extensions and distinct aggregate functions are provided. A query has an extended group-by clause with an extended group-by operator and a first set of group-by columns. The query has one or more distinct aggregate functions and one or more non-distinct aggregate functions. An initial subquery is constructed that generates a partially aggregated initial temporary (PAIT) table when executed. The initial subquery includes a GROUP BY clause with a second set of group-by columns that includes the first set of group-by columns of the extended group-by clause of the query and one or more columns specified by the one or more distinct aggregate functions. One or more subqueries are computed that compute groupings indicated by the extended group-by operator based on the PAIT table generated by the initial subquery.

Abstract: Data can be processed in parallel across a cluster of nodes using a parallel processing framework. Using Web services calls between components allows the number of nodes to be scaled as necessary, and allows developers to build applications on the framework using a Web services interface. A job scheduler works together with a queuing service to distribute jobs to nodes as the nodes have capacity, such that jobs can be performed in parallel as quickly as the nodes are able to process the jobs. Data can be loaded efficiently across the cluster, and levels of nodes can be determined dynamically to process queries and other requests on the system.

Abstract: This disclosure is directed to automated methods and systems for calculating hard thresholds used to monitor time-series data generated by data-generating entity. The methods are based on determining a cumulative distribution that characterizes the probability that data values of time-series data generated by the data-generating entity violate a hard threshold. The hard threshold is calculated as an inverse of the cumulative distribution based on a user defined risk confidence level. The hard threshold may then be used to generate alerts when time-series data generated later by the data-generating entity violate the hard threshold.