Abstract: A distributed data management system has multiple virtual machine nodes operating on multiple computers that are in communication with each other over a computer network. Each virtual machine node includes at least one data store or “bucket” for receiving data. A digital hash map data structure is stored in a computer readable medium of at least one of the multiple computers to configure the multiple virtual machine nodes and buckets to provide concurrent, non-blocking access to data in the buckets, the digital hash map data structure including a mapping between the virtual machine nodes and the buckets. The distributed data management system employing dynamic scalability in which one or more buckets from a virtual machine node reaching a memory capacity threshold are transferred to another virtual machine node that is below its memory capacity threshold.

Abstract: In one aspect, a method includes intercepting a write I/O to a first storage volume of a first storage array having a deduplication-based storage functionality, sending metadata and a signature to a replication data protection appliance and increasing a first reference count representing the data in the write I/O stored at the first storage array if the signature is written to the first journal.

Abstract: Various technologies described herein pertain to voice directed context sensitive visual searching. Visual content can be rendered on a display, and a voice directed query related to the visual content can be received. Contextual information related to the visual content can also be identified. Moreover, a search word recognized from the voice directed query and/or the contextual information can be used to detect an object from the visual content, where the object can be a part of the visual content. Further, a search can be performed using the object detected from the visual content, and a result of the search can be rendered on the display.

Abstract: Storage systems and methods to improve space saving from data compression by providing a plurality of compression processes, and optionally, one or more parameters for controlling operation of the compression processes and selecting from the plurality of compression processes and the parameters to satisfy resource limits, such as CPU usage and memory usage. In one embodiment, the methods takes into account the content-type, such as text file or video file, and select the compression process and parameters that provide the greatest space savings for that content type while also remaining within a defined resource-usage limit.

Abstract: Conventionally, it has been impossible to appropriately acquire word pairs having a prescribed relationship. Such word pairs can be appropriately acquired with a word pair acquisition apparatus including: a word class information storage unit in which word class information can be stored; a class pair favorableness degree storage unit in which a class pair favorableness can be stored; a seed pattern storage unit in which can be stored one or more seed patterns; a word pair acquisition unit that acquires one or more word pairs co-occurring with the seed pattern from sentence groups; a class pair favorableness degree acquisition unit that acquires a class pair favorableness degree; a score determination unit that uses the class pair favorableness degree to determine a score of each of the word pairs; and a word pair selection unit that acquires one or more word pairs having a high score.

Abstract: A method is used in recovering duplicate blocks in file systems. A duplicate file system block is detected in a file system. The duplicate file system block is referred by a first inode associated with a first file of the file system and a second inode associated with a second file of the file system. Metadata of the duplicate file system block is evaluated. Based on the evaluation, a set of inodes in the file system is determined. Each inode of the set of inodes refer to the duplicate file system block. Based on the determination, the set of inodes is updated.

Abstract: A distributed, web-services based storage system. A system may include a web services interface configured to receive, according to a web services protocol, a given client request for access to a given data object, the request including a key value corresponding to the object. The system may also include storage nodes configured to store replicas of the objects, where each replica is accessible via a respective unique locator value, and a keymap instance configured to store a respective keymap entry for each object. For the given object, the respective keymap entry includes the key value and each locator value corresponding to replicas of the object. A coordinator may receive the given client request from the web services interface, responsively access the keymap instance to identify locator values corresponding to the key value and, for a particular locator value, retrieve a corresponding replica from a corresponding storage node.

Abstract: Embodiments of a state tracking technique may enable real-time tracking of jobs in a computer cluster. A state object is provided that allows a job to be implemented as a distributable database. The job may be tracked while the job is processing via the state tracking technique. Using the state tracking technique, the cluster may track the location of the state objects for jobs in a database. However, only location information for the state object, and not the job metadata itself, is stored in the central database. This reduces the amount of data stored in the central database, distributing the metadata across the cluster, thus improving database performance and reducing bandwidth requirements on the network. Information about a job may be acquired via a query to the central database to find the location of the respective state object, and then a query to the state object (or to a proxy).

Abstract: Methods and systems for simplifying object mapping for external interfaces. At least two client requests for action may be received from an external interface wherein each client request may be evaluated sequentially or concurrently in a governed and non-blocking technique. Each client request may be associated to a logical object in order to minimize a representational gap between the client request and a physical object using the logical object. Each query request may be responded to using the object relational mapping in order to simplify the external interface by minimizing the representational gap between the external interface and the physical object using the logical object.

Abstract: Methods and apparatuses are provided for facilitating interaction with a geohash-indexed data set. A method may include providing a geohash-indexed data set. The method may further include determining a density map indicating a density of indexed data items of the data set for each of a plurality of geohashes. Corresponding apparatuses are also provided.

Abstract: Various technologies and techniques are disclosed for creating and managing persistent document collections. A data store is used for storing one or more persistent document collections. A content management application is used for managing documents for users, for creating one or more persistent document collections of a sub-set of the documents upon user request, and for storing the one or more persistent document collections in the data store. Users can create one or more persistent document collections from a sub-set of the documents. Users can also modify the one or more persistent document collections. A requested portion of one or more persistent document collections can be output upon request from an external application so that the external application can download one or more of the documents that are represented by the persistent document collection for further modification by the user.

Abstract: A method, system, and computer program product for discovering relationships between data processing environment components are provided in the illustrative embodiments. Whether a log entry in a set of log entries references a combination of the data processing environment components is detected. The combination of components includes a first component and a second component present in the data processing environment. A type of the log entry is determined. A weight is assigned to the log entry according to the determined type. the weight of the log entry is combined with a second weight of a second log entry to form a cumulative weight. A strength level for which the cumulative weight qualifies is determined. The strength level is assigned to a relationship between the combination of components.

Abstract: Architecture that provides a data structure to facilitate personalized ranking over recommended content (e.g., documents). The data structure approximates the social distance of the searching user to the content at query time. A graph is created of content recommended by members of the social network, where the nodes of the graph include content nodes (for the content) and recommending member nodes (for members of the social network who recommended the content). If a member recommends content, an edge is created between the member node and the content node. If a member is a “friend” (tagged as related in some way) of another member, an edge is created between the two member nodes. Each node is converted to a lower dimensional feature set. Feature sets of the content are indexed and the feature set of the searching user is utilized to match and rank the search results at query time.

Abstract: Methods and systems for simplifying object mapping for a client request for action. A client request for action may be received from an external interface. The external interface may comprise a human being or a computer program. The client request may be associated to a logical object in order to minimize a representational gap between the client request and a physical object using the logical object. The query request may be responded to using object relational mapping in order to simplify the external interface by minimizing the representational gap between the external interface and the physical object using the logical object.

Abstract: A method of optimizing runtime spatiotemporal events processing is provided.

Abstract: Provided are techniques for assessing object relevance. One or more user usage patterns are retrieved. Object properties of one or more objects are retrieved. The one or more user usage patterns are compared against the object properties of the one or more objects to compute one or more interaction scores that represent a value of how an object interacts with a user based on a current context of the user. Object importance is assigned to each of the one or more objects based on the one or more interaction scores.

Abstract: An approach for searching within previous search results for new search results is provided. In one aspect, a first computer receives first search contexts from a second computer. The first search contexts include parameters including characteristics of elements of second search contexts and parameters including weight of importance to the user that elements of the second search contexts includes the characteristics of the first search contexts. In addition, the first computer searches for the characteristics of the elements of the second search contexts in a repository. In another aspect, the first computer determines a match between the characteristics of the elements of the second search contexts and characteristics elements of the first search contexts, and wherein the first computer ranks a list of the new search results based on the determination.

Abstract: An approach for searching within previous search results for new search results is provided. In one aspect, a first computer receives first search contexts from a second computer. The first search contexts include parameters including characteristics of elements of second search contexts and parameters including weight of importance to the user that elements of the second search contexts includes the characteristics of the first search contexts. In addition, the first computer searches for the characteristics of the elements of the second search contexts in a repository. In another aspect, the first computer determines a match between the characteristics of the elements of the second search contexts and characteristics elements of the first search contexts, and wherein the first computer ranks a list of the new search results based on the determination.

Abstract: Portions of index information are pulled from a name directory and an attribute directory to form a new subindex data set that is stored as a separate file from the name directory and the attribute directory. The name directory and the attribute directory each being associated with partitioned data set extended (PDSE) data sets stored sequentially in members. Pursuant to an update to the PDSE data sets, a selected portion of an index record of the dataset is stored as a record in the new subindex data set and the storing includes acting on an integrated catalog facility catalog to perform operations relating to allowacation and maintenance of the new subindex data set. An oldest existing record is replaced with a recent version if a determination is made that adding the recent version exceeds a predetermined number of versions. A component of the new subindex data set is recoverable.

Abstract: A method for managing a virtual machine image includes receiving a request to change a package configuration of a machine, processing an image action received in the request, wherein the processing the image action received includes, opening the image action with associated action inputs, comparing the opened image action inputs with inputs associated with action instances in a database, determining whether the compared opened image action inputs match the inputs associated with action instances, retrieving from the database, image difference data associated with the image action responsive to determining that the compared opened image action inputs match the inputs associated with action instances in the database, and applying the image difference data to an image to transform the image, determining whether each image action in the request has been processed and processing a second image action responsive to determining that each image action has not been processed.