G06F16/24562

TECHNIQUES FOR INTEGRATING DATA FOR MULTPLE INSTANCES OF A DATA ARTIFACT
20230418803 · 2023-12-28 · ·

The present disclosure provides techniques and solutions for integrating data from different instances of a data source, such as a data artifact. That is, in some cases data may be disjoint, or it may overlap in whole or part. How data should be integrated can depend on whether data overlaps, or a type or extent of overlap. An artifact that consumes data can be integrated to indicate how data from underlying instances of a data source should be integrated, including when this consuming artifact requests data indirectly from a consolidation artifact. A search against the consuming artifact can be modified based on configuration information in the consuming artifact indicating how or if data from multiple instances of the data source should be integrated.

EFFICIENT FILE RENAMES USING B-TREE BASED PERSISTENCE FOR FILE SYSTEM NAME SPACES
20210026827 · 2021-01-28 ·

Embodiments for optimizing file lookups after a file or directory rename operation. Files are defined using inode, dirent, and hash entries, and the name space of the files are stored in a B-Tree using file system conventions in which the inode, dirent, and hash values are referenced by the directory first followed by the inode number, as in a first data structure denoted [directory:inode]. Upon a rename of a file, the old inode, dirent, and hash entries are deleted, and a reference is created to the old name using the inode number first followed by the old directory, as in a second data structure denoted [inode:old_directory], and this reference is used as a forward link to the new file under the new directory name.

Techniques for supervising communications from multiple communication modalities

Provided herein are methods, systems, and computer-program products for providing a supervision system for review of one or more communications associated with an enterprise. The supervision system may be configured to identify the one or more communications from communications associated with the enterprise. A communication may be identified for review according to one or more policies. A policy may indicate criteria that are defined by an enterprise that indicate a communication that should be reviewed. After the communication is identified for review, the communication may be analyzed using one or more filters. A filter may indicate when a communication should not be reviewed, even when the communication is identified for review based on a policy. After a communication is both identified by a policy and not filtered by a filter, the communication may be added to a queue. A queue may be used to organize communications to be reviewed.

METHOD AND SYSTEM FOR ENCAPSULATING AND STORING INFORMATION FROM MULTIPLE DISPARATE DATA SOURCES
20200394171 · 2020-12-17 · ·

An example computer-implemented method and computer system, each adapted for encapsulating digital data records in multiple, differently structured and unstructured formats, the data records ingested from multiple data storage locations, is described herein. In the method, each ingested data record is separated into a plurality of tuple structures, and for each tuple, the tuple is split into a data part and fieldname part. A pointer is created by combining the fieldname part, a record identifier of the data record, and a database identifier of the storage location where the data record was stored. The pointer is appended to the data part to form a digital stem cell (DSC) that is stored in a single data store, each formed DSC having the same structure.

Managing online help information in a data center

A method is used in managing online help information in a data center. The method gathers a plurality of help information associated with a plurality of components operating in the data center. The method creates an integrated repository of online help information by indexing contents of the plurality of help information into an indexed data structure of a plurality of search expressions. Each search expression is associated with a set of online help documents. The integrated repository is accessible by each component. In response to a search query for an online help document, the method provides at least one help document relevant to the search query by searching the indexed data structure.

Computer device for providing tree index

Disclosed is a computer program stored in a computer readable storage medium, which includes encoded commands, in which when the computer program is executed by one or more processors of a computer system, the computer program allows the one or more processor to perform the following steps for indexing. The steps may include: deciding that a first leaf node is split in a tree index data structure including a parent node including one or more indexes, and the first leaf node and a second leaf node which are leaf nodes linked with the parent node through a pointer; generating a 1-2.sup.nd leaf node which is a next node of the first leaf node; storing in the 1-2.sup.nd leaf node an index to be split among indexes stored in the first leaf node; and linking the 1-2.sup.nd leaf node and the second leaf node to the pointer.

Direct table association in in-memory databases

To address the issue of latency in relational database systems, a computerized database management system comprising a database server, a processor, and associated random access memory is provided. The processor may configure an in-memory database in the random access memory to have tables, each containing a plurality of cells associated memory addresses, establish a direct table association between an origin cell and a target cell within the tables, receive a request to perform a join database operation of a first table including the origin cell on a second table including the target cell, dereference the direct table association for the origin cell to obtain a value of the target cell stored at the memory address for the target cell, execute the join database operation to produce a joined table including the value, and store the joined table at a new location in the random access memory.

Scavenging directories for free space

A technique for managing storage of directories in a file system performs a testing operation on a file-system block of a directory file. The testing operation determines whether the file-system block contains any directory element that identifies a currently-present content object in the directory. In response to the testing operation determining that the file-system block contains no directory element that identifies any currently-present content object, the file system performs a hole-punching operation on the file-system block, removing the block from the directory file and freeing the block for other use.

Query Combination In A Hybrid Multi-Cloud Database Environment

A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.

Query Transformations In A Hybrid Multi-Cloud Database Environment Per Target Query Performance

A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.