Abstract: A distributed storage system may synchronously apply an Information Lifecycle Management (ILM) policy to objects at ingest. In one embodiment of synchronous ILM, three options are available for a user: balanced, strict, and dual commit. Dual commit refers to the behavior where one will always create two replicated copies in the same site and then apply ILM asynchronously. Strict refers to the behavior where the storage system attempts to apply the ILM policy synchronously on ingest, and if the storage system cannot the ingest of the object will fail. This ensures that the storage system can guarantee that ILM has been applied to recently ingested objects. Balanced refers to the behavior where the storage system attempts to apply ILM synchronously, but if the storage system cannot the storage system may fall-back to dual-commit.

Abstract: A family tree interface may include a default number of family members in addition to a target node which are expandable upon selection by a user. The default tree interface is expandable by a user vertically to include more generations and laterally. The tree interface includes labels showing a relationship of a tree node to the target node. In some embodiments, one or more family members that have not been rendered may be cached to speed up the visual rendering process. A graphical user interface, in a viewing session, may display an initial view of the family tree associated with the target individual. Upon receipt of an expand request, the viewing session may add the one or more additional family members to generate an expanded view of the family tree. The expanded view may partially adjust the initial view without refreshing the viewing session.

Abstract: Implementations relate to processing media content, and/or associated metadata, to classify the media content into a first category, of a plurality of predefined categories. Versions of those implementations further relate to extracting target content from the media content; generating, based on the extracted target content, an action that corresponds to an application; and generating, based on the generated action, a selectable suggestion including a textual portion that describes the action. Some of those versions further relate to causing the selectable suggestion to be displayed at a display of a client device, along with rendering of the media content. The selectable suggestion, when selected, causes the application to perform the action. The target content can be extracted based on the first category and can be extracted based on the first category in response to the media content being classified into the first category.

Abstract: An information processing apparatus includes circuitry to receive, from a terminal, first electronic data and a request for processing the first electronic data assign, to the first electronic data, first identification information used to control the first electronic data; transmit a request for performing predetermined processing on the first electronic data via a network to an external service system that performs the predetermined processing; and acquire, via the network from the external service system, second identification information used by the external service system to control the first electronic data. The circuitry stores, in a memory, the second identification information in association with the first identification information.

Abstract: This application belongs to the technical field of artificial intelligence, and particularly relates to a data processing method, a data processing apparatus, a computer-readable medium, and an electronic device.

Abstract: A method is for validating a data set in a distributed database system in which the data set is stored distributedly on computers of the distributed database system. The method includes sending a request to one of the computers by a central computer. The request has a command to check for a given criterion of a partial data set of the data set on the computer to which the request was sent.

Abstract: Described herein are systems and method for providing data transfer in a computer-implemented database from a database extension layer. A data server associated with a database receives a request to transfer data stored in a database extension layer of the database. Input data chunks are collected from the database extension layer until a configured row count limit is reached. Row positions are determined from the input data chunks. Value identifiers corresponding to the row positions are determined. Values corresponding to the value identifiers are retrieved. Output data is generated based on the values corresponding to the value identifiers.

Abstract: Techniques and solutions are provided for providing federated data access to parameterized data objects. At a local system, a virtual parameterized data object is created. A remote computing system is contacted to obtain parameters used by a parameterized data object of the remote computing system to which the virtual parameterized data object corresponds. Parameter information received from the remote system is stored in a definition of the virtual parameterized data object at the local system. When a request for a database operation involving the virtual parameterized data object is received, the parameter information can be used to determine whether the request is correctly formed, or can be used in preparing a request to be sent to the remote system to be performed using the parameterized data object to obtain information specified in the request for a database operation.

Abstract: A method for processing a query for data stored in a distributed database includes receiving, at an edge device, the query for data stored in the distributed database from a query device. The method includes causing, by the edge device, the query to be stored on a dynamic ledger maintained by the distributed database. The method includes detecting, by the edge device, that summary data has been stored on the dynamic ledger. The method includes generating, by the edge device, an approximate response to the query based on the summary data stored on the dynamic ledger. The method includes transmitting, to the query device, the approximate response.

Abstract: A computer-implemented method, system and computer program product for creating virtualized data assets. A copy of an extract, transform, load (ETL) or an extract, load, transform (ELT) job definition is created. Furthermore, a table function is created in which the table function is configured to trigger the execution of a copy of the ETL/ELT job definition, to read the resulting data from executing the copy of the ETL/ELT job definition and to return the resulting data (data sets), such as in a queue in a federation server. After receiving a query from a user based on a virtual view in which the query includes the ETL/ELT job definition, the table function is executed which triggers execution of the copy of the ETL/ELT job definition. Data sets are then produced by executing the copied ETL/ELT job definition, which is read and returned to the user in the virtual view.

Abstract: A buried object scanning device includes a capacitance sensor, a search image conversion processing unit, a memory unit, a display unit, an operation input unit, and a display control unit. The capacitance sensor detects a buried object. The search image conversion processing unit converts the detection result of the capacitance sensor into a search image. The memory unit stores search images and a grid layer including grid lines corresponding to a specific scale. The display unit displays the search images and the grid layer. The display control unit controls the display unit to display the search image superimposed with the grid layer and to display the search image in a state of being movable relative to the grid layer, in response to input to the operation input unit.

Abstract: The present disclosure relates to methods and systems for providing context aware searching using concept markers. Embodiments provide concept markers configured to facilitate the identification and refinement of relevant content associated with a query with a high degree of precision. In embodiments, in response to a user query, documents and concept markers relevant to the query are determined. The identified documents are associated with the concept markers and are ranked based on the quality of the association. Upon a user selecting at least one of the concept markers, the search results are refined in response. The refining includes re-ranking the documents based on a combination of the original query and the selected concept marker. The suggested concept markers are similarly re-ranked. Accordingly, the techniques disclosed herein provide for a high precision identification of relevant content as well as high precision refining of the search results.

Abstract: A system for data warehouse workload transformation is disclosed. A data extraction module receives job metadata from one or more extract transform load applications, extracts domain logic information from the job metadata. A canonical model generation module creates one or more relational models from the domain logic information, generates a canonical model for the job metadata by merging the one or more relational models. A model optimization module creates a query execution plan using an optimization technique, passes the canonical model through one or more optimization layers, and optimizes the query execution plan to execute common logic at a single point of time for removing one or more redundant operations. A code generation module generates an output code corresponding to the predefined target environment from an optimized canonical model, upon mapping of the one or more entities, for the workload transformation.

Abstract: A framework provides a detailed explanation regarding specific aspects of a (complex) calculation produced by an application (e.g., an analytical application). An explainability engine receives a request for explanation of the calculation. The explainability engine traverses homogenous data clusters according to the request, in order to produce a final path. The final path is used to select and then populate a template comprising explanation note(s). The outcome (comprising the final path and the template) is processed with a ruleset according to a covariance (COV) function in order to provide a first intermediate outcome. The first intermediate result is then processed with a second input according to a correlation (COR) function to provide a second intermediate outcome. The second intermediate result is processed according to a challenge function to provide a challenged outcome, and feedback (e.g., reward or penalization) to the ruleset. The challenged outcome provides detailed explanation to the user.

Abstract: A method for processing a Measurement Data Format (“MDF”) file includes determining a file offset address of a data block of interest in the MDF file, and adding an indexing table containing a thread pointing to the file offset address to the MDF file. The method further includes sending the indexing table and data retrieved from the MDF file to a database for caching.

Abstract: A method includes receiving an initial pipeline including a sequence of commands for execution on a computing system, and obtaining, for each command in the sequence of commands, semantic information. The sequence of commands includes a command with incomplete semantic information. The method further includes generating an abstract semantic tree (AST) with the semantic information and a placeholder for the incomplete semantic information, and manipulating the AST to generate a revised AST. The revised AST corresponds to a revised pipeline that reduces an execution time on the computing system. The method further includes executing the revised pipeline.

Abstract: A method includes receiving interaction data indicating a performance of a specified action by a user of a user device, identifying a last-in-time action associated with the user and an initiation action associated with the user and the specified action, generating, based on the identified last-in-time and initiation actions, a first attribution associated with the identified last-in-time action and the specified action and a second, additional attribution associated with the identified initiation action and the specified action, propagating, to two or more different models, the first attribution and the second, additional attribution, and generating, based on the first attribution and the second, additional attribution, one or more visual representations of the first attribution and the second, additional attribution.

Abstract: An example file server manager disclosed herein receives a registration for a distributed file server, where the distributed file server is hosted in a virtualization environment and includes a cluster of file server virtual machines configured to provide access to a file system. The file server manager further synchronizes metadata with the distributed file server, the metadata including identification of each of the file server virtual machines of the cluster of file server virtual machines, the metadata including information regarding the file system and receiving a management request for the distributed file server. The file server manager further formats the management request for the virtualization environment based on the metadata and utilizing information from the registration to access the distributed file server with the formatted management request.

Abstract: A storage structure for data containing relational objects, as well as methods for retrieval and visualized display of data so stored are capable of recording relations among all objects in any scenario, as well as new relational states caused by changes and corresponding events happening in succession. The storage structure uses uniform formats to process information into logical and relational data, thereby contributing to subsequent characteristic analysis, supporting retrieval by objects and designated relational modes, and providing accurate display of information and its variations through versatile, visualized way.

Abstract: This disclosure relates to, among other things, scalable data processing, storage, and/or management systems and methods. Certain embodiments disclosed herein provide for a multi-dimensional data storage structure that may facilitate parallel processing of data during both data ingestion and data retrieval and/or access processes involving one or more storage layers In various embodiments, sequence number schemes associated with ingested data records may allow for improved management of data stored in one or more layers (e.g., hot and/or cold data storage layers).