Abstract: Disclosed is a computer program stored in a computer-readable storage medium including encoded commands according to an exemplary embodiment of the present disclosure. When the computer program is executed by one or more processors, the computer program allows the one or more processors to perform a method for managing undo information in a database management system (DBMS). The method may include: forming undo information corresponding to an update request by a first transaction in response to the update request by the first transaction in the database management system (DBMS); determining an undo memory chunk to be allocated to the undo information from an undo memory pool on a memory, the undo memory chunk having a variable size; and maintaining the undo information on a space of the memory by using the determined undo memory chunk.

Abstract: Methods, non-transitory computer readable media, and computing devices are disclosed that facilitate efficient storage operations using variable length encoded segment maps for deduplicated objects. A key name and elements of a segment list are received with a request to store an object. Each of the elements corresponds to a segment associated with the object and comprises a segment hash. A segment map is generated for the object. The segment map includes a header and entries. Each of the entries includes at least an expanded offset, one of the segment hashes, and a start offset. The segment map is stored in an object store, as associated with the key name, along with segment data included in at least one of the elements.

Abstract: Methods, information handling systems and computer readable media are disclosed for a contextual image-based search. In one embodiment, a method includes receiving, at a computer implemented system for searching a knowledge base, an image submitted by a user of the system. The method continues with obtaining a classification label corresponding to the image, checking a context module database for the presence of a follow-up question associated with the classification label, and generating search term information for searching of the knowledge base, where the search term information comprises the classification label. If a follow-up question associated with the classification label is found, an embodiment further includes presenting the follow-up question to the user of the system, receiving from the user an answer to the follow-up question, modifying the search term information to include the answer, and checking the context module database for an additional follow-up question associated with the answer.

Abstract: A computer system processes data records in a multi-tenant environment to ensure data quality. A plurality of records from a plurality of data sources are processed to provide a data quality metric for each field of the plurality of records based on record values in the field. A threshold range satisfying a specificity level of a data source is selected for each data quality metric. The data quality metric is compared to the threshold range to determine whether the data quality metric violates the threshold. A data quality report is provided for the plurality of records, wherein the data quality report indicates whether the data quality metric of each field violates the selected threshold range. Embodiments of the present invention further include a method and program product for processing data records in a multi-tenant environment to ensure data quality in substantially the same manner described above.

Abstract: A string of characters within a file may be obtained. A first sequence may be selected from the string of characters. A first hash may be generated based on the first sequence. A second sequence may be selected from the string of characters based on the first sequence. The second sequence may be shifted from the first sequence. A second hash may be generated based on the second sequence. A fingerprint for the file may be generated based on the first hash and the second hash.

Abstract: Disclosed herein are system, method, and computer program product embodiments for replication of database. In one embodiment, one or more data pages generated from a transaction are obtained at a first node. The one or more data pages are compressed. The compressed data pages are added into a first queue in a memory of the first node. The first queue includes a plurality of blocks. A first block of the compressed data pages in the first queue is transmitted to a second node when the first block of the compressed data pages becomes available for replication. The first block of the compressed data pages is stored in a persistent storage of the first node.

Abstract: Techniques are provided for compression of log data using field types. An exemplary method comprises: obtaining at least one log message, wherein the at least one log message comprises a message template and at least one message variable, wherein the message template comprises at least one field corresponding to the at least one message variable; obtaining a compression index that maps a plurality of message templates to a corresponding message signature; identifying a predefined field type of the at least one field; selecting a compression technique to apply to the at least one message variable based on the predefined field type to obtain a compressed message variable; and writing the compressed message variable and a message signature corresponding to the message template of the at least one log message to a log file. The at least one log message can be a historical log message or part of a real-time stream of log messages.

Abstract: New methods to represent variables as parts of the classical truth table lead to complete evaluation methods that generate a compiled, efficient version of logical expressions. The new methods are suitable for use in, e.g., relational database applications in which both, efficient query times as well as logical completeness and consistency are required in the context of general constraint treatments. Input/output operations remain linear in the length of the input character strings regardless of the complexity of the logical theory. A new processing method of formulas is described as the basis for the efficiency increase. In order to find a specific truth-value, pattern trees are used representing the extension of the logical theory.

Abstract: Disclosed herein are system, method, and device embodiments for transaction merging for offline applications. An embodiment operates by generating an offline store, performing a first operation and a second operation of a transaction over the offline store at a first time and a second time, respectively, generating queue entries corresponding to the first operation and the second operation, respectively, generating transaction information including the first operation and the second operation based on a transaction identifier associated with the transaction; and sending the transaction information to a service provider for synchronization with a remote storage system of a backend service.

Abstract: A method is provided for space-efficient bookkeeping using bit-level locking. Each row of a bookkeeping table stores binary data comprising a plurality of bits. Each bit of the plurality of bits corresponds to a particular message and a particular consumer of the message, and indicates whether the particular message has been dequeued by the particular consumer. The bookkeeping table is stored on-disk and data corresponding to the bookkeeping table is stored in volatile memory. When a message is dequeued the in-memory bookkeeping data is updated, and the bookkeeping table is updated based on the in-memory bookkeeping data when the dequeue is committed.

Abstract: A method may include determining that input text data includes a first keyword from a first set of keywords. The method also includes determining a similarity between the input text data and a first stored text string that has previously been identified as a false positive match for the first keyword, and based on the similarity, generating a first false positive score corresponding to the input text data. Further, the method includes determining a number of keywords, from a second set of keywords, that are included in the input text data, and based on the number of keywords, generating a second false positive score corresponding to the input text data. The method also includes calculating a final false positive score corresponding to the input text data based on the first false positive score and the second false positive score.

Abstract: There is provided a method of setting up an interactive communication session between a querying client terminal and target client terminal(s), comprising: receiving a query from the querying client terminal, semantically matching the query to a structured dataset storing structured data created from unstructured user generated content, and unstructured user reactions, extracted from posted profiles of user credentials of a social network, selecting matched user credentials of users of the social network according to an analysis of the matched structured data, distributing a request for joining an interactive communication session to matched client terminals of the matched user credentials, receiving at least one response to the request from responding client terminal(s) of at least one responding user credentials, and establishing an interactive communication session between the querying client terminal and the responding client terminal(s) of the at least one responding user credentials.

Abstract: Systems and methods for providing key-value based filesystem operations are disclosed. In one embodiment, the method comprises receiving at least one file operation from an application, the file operation including a file path and a requested operation; generating a key-value operation based on the file operation, the key-value operation including a key including the file path; executing the key-value operation at a key-value storage engine; receiving, from the key-value storage engine, a result of the key-value operation; generating a result value based on the result of the key-value operation; and returning the result value to the application.

Abstract: A system and method to receive a query against a plurality of data objects that are sorted, at least conceptually, to follow a hierarchical order and support a preorder traversal arrangement and a postorder traversal arrangement; translate the query into an executable query plan including at least one instance of a hierarchy rearrange operator, the hierarchy rearrange operator to rearrange an input including one or more of the plurality of data objects from one of a preorder traversal arrangement and a postorder traversal arrangement to a corresponding opposite thereof; execute the executable query plan including the at least one instance of the hierarchy rearrange operator; and generate a query result based, at least in part, on the input of the one or more plurality of data objects being rearranged in the respective preorder traversal arrangement and a postorder traversal arrangement.

Abstract: Systems and methods for configurable voltage regulator (VR) controllers. In some embodiments, an Information Handling System (IHS) may include: a processor; and a voltage regulator (VR) coupled to the processor, the VR configured to: identify, via a VR controller, a number of phases coupled to the voltage regulator in response to detection of a power-on-reset event; and select, via the VR controller, one of a plurality of different configuration files to be applied to the voltage regulator in response to the identification.

Abstract: Embodiments provide a data block storage method applied to a database employing an LSM tree. According to the method, data in the 0th layer of the LSM tree is organized in MacroBlocks. When the data in the LSM tree is transferred from an upper layer to a lower layer, the data is transferred to the lower layer in the form of MacroBlocks, so that all layers of the LSM tree are organized in the form of MacroBlocks. When inter-layer data merger is performed, the merger may be performed based on the MacroBlocks, which can avoid rewriting of all data on an entire layer and can effectively reduce disk IO and temporary space consumption. Moreover, as each MacroBlock comprises a plurality of variable-length MicroBlocks, the data may be stored in a storage space in a more compact manner.

Abstract: Configuring virtual machines for garbage collection in a deduplication backup system executed on a server computer in a cloud computing network, by configuring at least one virtual machine (VM) of a plurality of virtual machines in a VM cluster to be data protection virtual machines (DP VMs), by enabling only read and write operations to/from the DP VMs, interconnecting a garbage collection VM (GC VM) of the VM cluster to the DP VMs, configuring the GC VM to perform only garbage collection tasks for the DP VMs, and providing data access credentials from each DP VM to the GC VM to facilitate the garbage collection tasks.

Abstract: Provided are a system and method for performing deduplication of web content. In one example, the method includes converting search results of a first website into a first fuzzy index and converting search results of a second website into a second fuzzy index, determining a search result of the first website corresponds to a same item as a search result of the second website based on a comparison of the first fuzzy index and the second fuzzy index, and displaying a comparison of web content associated with the item from the first search result and web content associated with item from the second search result. The deduplication of content according to various embodiments may be performed on the fly without storing web content in a centralized database.

Abstract: A method and system for validating data migrated from a source database to a target database and storing validation metrics resulting from validating the data are described. The system receives validation information to be used to validate data to be migrated from a source database to a target database. The system validates the data using the validation information and stores validation metrics resulting from validating the data.

Abstract: A technique for generating and evaluating candidate trademarks includes providing a user interface so that a user can specify various criteria via respective interactive controls. The technique further includes searching one or more databases to identify lexical units related to the criteria, applying a set of combination rules to the identified lexical units to generate candidate trademark terms, including calculating respective relationship scores indicative of how closely the candidate trademark terms satisfy the criteria, ranking the candidate trademark terms based on the relationship scores to generate an ordered list, and providing the ordered list of the candidate trademarks and indications of the respective relationship scores via the user interface.