Abstract: Methods and systems are provided for improving a journaling file system by reducing journaling overhead utilizing a remapping interface to log-structured cloud block devices such that blocks in a journaling transaction are atomically mapped to their final disk locations with minimum overhead. With log-structured cloud block devices, all blocks may be stored in logfiles and indexed for access. By modifying the index of the destination block to point to the corresponding journal block, the additional write may be avoided, and a journal block may effectively be remapped from its original LBA to its destination LBA without any actual data movement, thereby reducing the file system journaling overhead.

Abstract: A document management system and process for facilitating the state of various portions of electronic content in which users can select specific workflow stages to assign to selected content elements in the electronic content that can indicate the workflow condition of the specified content. This provides individual and group users the ability for precise, timely, and effective management of document workflow that facilitates more natural and smoother document development.

Abstract: Disclosed are methods and systems for Semantics Node functions which provide semantics support in machine-to-machine systems. In an example, a Semantic node may manage semantics resources capable of being discovered, retrieved, or validated by other devices. In another example, the Semantics Node may be discovered by other nodes, and semantics resources may be discovered with subscription mechanisms.

Abstract: Described are methods, systems and computer readable media for performance logging of complex query operations.

Abstract: This disclosure relates to method, device, Wand system for clustering document objects based on information content. The method may include identifying a plurality of object chunks from at least one document based on semantic context of each of the plurality of object chunks, determining at least one document portion from the at least one document as a base document based on a plurality of parameters applied to the plurality of object chunks, determining a plurality of hierarchies within the base document, and categorizing the plurality of object chunks based on the plurality of hierarchies and information in each of the plurality of object chunks. It should be noted that each of the plurality of object chunks may include at least one object selected from the at least one document.

Abstract: Checking of a database snapshot of an active database is initiated. Thereafter, an anchor page associated with a most recent snapshot that links to a restart page is read. Subsequently, the linked restart page is read. It is then initially determined, based on the reading of the anchor page and the restart page, whether the snapshot is accurate. If it is initially determined that the snapshot is not accurate, the anchor page and the restart page are re-read until a final determination is made that whether the snapshot is accurate. Alternatively, if not is initially determined that the snapshot is accurate, then data is provided (e.g., displayed, loaded into memory, transmitted to a remote computing system, stored in physical persistence, etc.) that indicates that the snapshot is accurate.

Abstract: A method, system and computer program product are provided. A first index scan of records of a database table is performed. A first index used by the first index scan is specified in a DBMS query statement as being ordered by one or more field values of one or more fields of the first index. A second scan of the database table is performed to determine whether each respective record of the second scan is qualified based on one or more fields of the each respective record of the second scan and a predicate. A lookup data structure is built indicating whether each of the respective records of the second scan is qualified. The lookup data structure is used to determine whether a record of the first index scan is qualified when the lookup data structure becomes available.

Abstract: A request is received for a first non-exclusive lock to read a page in a database. Thereafter, execution of the at least one non-exclusive lock is initiated. Later, a request for an exclusive lock to modify the page in the database is received. Subsequently, a request is received for a second non-exclusive lock. In response, an amount of time to finish the first request and the second request is estimated. The second non-exclusive lock is allowed to execute in parallel to the first non-exclusive if the determined amount of time to finish the second non-exclusive lock is less than an estimated amount of time needed by the first non-exclusive lock. Alternatively, execution of the second non-exclusive lock is delayed to after the execution of the exclusive lock if the determined amount of time to finish the second non-exclusive lock is greater than an amount of time needed by the first non-exclusive lock.

Abstract: A method and a system are disclosed for displaying data representative of a large dataset. The method comprises the use of a processing device for receiving the dataset comprising a plurality of data points of dimension m; reducing the dimension m of at least one data point of the plurality of data points to a dimension selected from a group consisting of two (2) and three (3) if the dimension of the at least one data point is greater than or equal to three (3); generating at least one data cluster, each data cluster comprising a given number of data points; determining a set of representative data points for each generated at least one data cluster, each representative data point of a given set for representing a region of a corresponding given data cluster comprising a plurality of adjacent data points and displaying in a user interface the determined at least one set of representative data points of the at least one corresponding generated data cluster.

Abstract: Queries executed against a materialized view can execute up to orders of magnitude faster than equivalent queries on a source (or base) table. However, although a query can reference a materialized view directly, a user (e.g., query author) may not know about a relevant materialized view. Moreover, if a source table has multiple materialized views generated, the user may not know which materialized view to reference in the query. Thus, embodiments of the present disclosure provide techniques for automatically rewriting queries directed to a source table to utilize existing materialized views.

Abstract: Systems and methods of tracking and rewarding users of any of a variety of content hosting systems, such as search engines. In one embodiment, a method of rewarding a user of a search engine includes receiving secure identification information identifying a user, retrieving user account information using the secure identification information, receiving a search query associated with the user account information, crediting the user account with a reward that is directly related to providing the search query, and returning search results in response to the received search query.

Abstract: A method, computer program product, and computing system for processing a snapshot tree structure of a storage system, wherein the snapshot tree structure defines a plurality of filter elements including one or more snapshots. A snapshot matrix is generated based, at least in part, upon the snapshot tree structure, wherein the snapshot matrix defines the amount of data storage consumed by one or more eclipsed elements and the corresponding eclipsing elements.

Abstract: A method, computer program product, and computing system for processing a snapshot structure of a storage system, wherein the snapshot structure includes one or more temporal indicators and defines a plurality of elements including one or more snapshots, wherein the one or more temporal indicators are incremented to indicate the point at which a data entry was initially added to the snapshot structure. A snapshot matrix is generated based, at least in part, upon the snapshot structure, wherein the snapshot matrix defines the storage space used by one or more eclipsed elements and associated eclipsing elements.

Abstract: Systems and methods are provided for optimally determining sensor or infrastructure placement in a fluid network, for determining an anomaly of interest in the fluid network, and for determining sensor coverage in a fluid network, which are based on a model of the fluid network represented by a directed graph.

Abstract: Examples of techniques for performing a skill gap comparison between a first individual and a second individual (or group) are disclosed. In one example, a computer-implemented method includes receiving first data associated with the first individual and receiving second data associated with the second individual. The method further includes identifying preferences for performing the skill gap comparison and assigning a weight for each of a plurality of elements of the first data and the second data. The method further includes performing the skill gap comparison between the first individual and the second individual by comparing the first data to the second data. The method further includes generating a list of one or more skills for which there is a skill gap between the first individual and the second individual.

Abstract: A request is received to generate cross products from a dataset based on a join field. The join field indicates that each of the cross products is to be generated from a corresponding subset of the dataset where the subset associated with identical keys. Responsive to receiving the request to generate the plurality of cross products of the dataset based on the join field, a set of map reduce jobs is performed on the dataset to generate the cross products. Performing the set of map reduce jobs generates groups of key-value pairs from the corresponding subsets of the dataset. Each key-value pair of a respective group of key-value pairs includes the identical keys. Responsive to performing the set of map reduce jobs, final output data is received that identifies the cross products for each of the groups of key-value pairs.

Abstract: Provided is a search system which is configured to search for a registered vector being similar to an input vector among a plurality of registered vectors, on the basis of a degree of similarity between an input vector and a registered vector. The search system includes a partial similarity calculation unit that calculates a degree of partial similarity which is the degree of similarity concerning some of one or more dimensions of the input vector and the registered vector, a limit calculation unit that calculates, on the basis of the degree of partial similarity, an upper limit of the degree of similarity that is expected when the degree of similarity is calculated, and a rejection decision unit that decides, on the basis of the upper limit of the degree of similarity, whether or not to reject the registered vector from a candidate for a search result.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for generating and manipulating an index for a table in a database. A query statement is received, the table of lines are searched, a result list is generated, and an index for the query statement is generated, wherein the index comprises information associated with the result list and the query condition. The query condition and the identifier of the table is extracted from the query statement, where the index is generated based on the query condition, the identifier of the table, and the result list. A hash value of the identifier of the table and the query condition is obtained, an association between the hash value and the result list to build the index is generated, and in response to a line of the plurality of lines in the table being modified, the index identified as invalid.

Abstract: A computer-implemented method is provided that includes identifying an input dataset formatted as an input matrix, the input matrix including a plurality of rows and a plurality of columns. The computer-implemented method also includes dividing the input matrix into a plurality of input matrix blocks. Further, the computer-implemented method includes distributing the input matrix blocks to a plurality of different machines across a distributed filesystem, and sampling, by at least two of the different machines in parallel, at least two of the input matrix blocks. Finally, the computer-implemented method includes generating at least one sample matrix based on the sampling of the at least two of the input matrix blocks.

Abstract: A host management service monitors status of host computing devices in a data center. Monitored status of the host computing devices can be stored and managed in a host information database. When an abnormal status of a host computing device is identified, the host management service can initiate a search event to find more host computing devices that might have a similar issue, for a preventive maintenance. The host management service can access data stored in the host information database and calculate an index representing similarity between host computing devices. The host management service can generate a list of host computing devices that are determined to be similar to a reference host computing device. The list of host computing devices can be sorted based on a similarity index and can be provided to an operator of the data center for efficient maintenance.