Abstract: A computer analyzes a relational schema of a database to generate a data entry schema and encodes the data entry schema as JSON. The data entry schema is sent to a database client so that the client can validate entered data before the entered data is sent for storage. From the client, entered data is received that conforms to the data entry schema because the client used the data entry schema to validate the entered data before sending the data. Into the database, the entered data is stored that conforms to the data entry schema. The data entry schema and the relational schema have corresponding constraints on a datum to be stored, such as a range limit for a database column or an express set of distinct valid values. A constraint may specify a format mask or regular expression that values in the column should conform to, or a correlation between values of multiple columns.

Abstract: A method for converting a spreadsheet into a data model includes: obtaining the spreadsheet including a plurality of cells containing data; identifying local structures within the spreadsheet using attributes of the data in the spreadsheet; combining the local structures of the spreadsheet into a generic multi-dimensional model comprising dimensions and data cubes; generating the data model using the generic multi-dimensional model by mapping elements of the generic multi-dimensional model to elements of the data model; and displaying, on a display and to a user, the data model. The dimensions and the data cubes are the elements of the generic multi-dimensional model.

Abstract: Embodiments of the disclosure provide for improved integration of third-party devices in a system. Specifically, embodiments provide for improved integration management, including creation, deployment, maintenance, and monitoring of integrations utilizing integration templates. Embodiments include operation using a specially configured templating system that enables creation of integration template(s), management of integration template(s), searching of integration template(s), and initiation of such integration template(s) into integration instance(s) for particular client system(s), as well as updating of integration instance(s) based on integration template(s). Some embodiments provide dashboard(s) for accessing and/or managing integration instance(s) or associated information.

Abstract: Various embodiments of the teachings herein include a computer-aided method for transforming data in a relational database, containing sensor measurements, into RDF data blocks of a graph database. The method may include: providing a R2RML mapping file; breaking down and converting the data using the mapping file and a first mapping parser; generating a generation of RDF data blocks; and storing the generation as a database. After the data have been broken down and converted, checking a quality of the obtained R2RML mapping and creating a second R2RML mapping file, on the basis of which the relational data are broken down and converted into RDF data blocks. The second R2RML mapping, during the preparation of the relational data into RDF data blocks, automatically stops the processing of relational data that are not to be resolved and thus optimizes the energy efficiency of the preparation.

Abstract: A containerized data classification and automated metadata publishing system (DCAMPS-C) is disclosed. DCAMPS-C is powered by a data classification engine. The containerized data classification and automated metadata publishing system hosts a data classification and automated metadata cloud application publishing service. DCAMPS-C offers a containerized solution that automates the data classification and metadata generation processes, eliminates the need for manual input, reduces the chances of human error, and ensures seamless integration with modern cloud and on-premise infrastructures for better resource utilization, scalability, and overall efficiency in managing digital content within an organization.

Abstract: A system and method for query selection are provided. The method may include acquiring a natural language sentence, pre-processing to obtain a standard node sequence, constructing a node tree based on the relationship between an index node and other nodes, generating a data query command based on the node tree, querying data using the data query command, and filtering the results. The standard node sequence may include at least an index node and a condition node. The node tree may be used to characterize the index-condition combination. The system may include an acquisition unit, a pre-processing unit, a node tree construction unit, a translation unit, and a querying and filtering unit.

Abstract: A central service provider manages a blockchain network that writes the cryptographic hash of each executed transaction in a block to the blockchain network. For each executed transaction, the central service provider generates and transmits a transaction receipt such that a party can verify that the transaction was appropriately executed. Additionally, a party can check that the party's records are correct by providing transaction data describing details of transactions recorded in the party's records to the central service provider. The central service provider verifies the party's records by comparing the transaction data in the party's records to the blocks of transaction records in the blockchain network. In some scenarios, the central service provider may identify or receive an identification of a discrepancy arising from one or more transactions. The central service provider can reconcile the identified discrepancy.

Abstract: An electronic device is provided.

Abstract: The present disclosure is generally related to a data processing system to coordinate parallel processing of audio queries across multiple devices. A data processing system can receive an audio input signal detected the display device and parse the audio input signal to identify an entity. The data processing system can transmit a query command to the display device to cause a multimedia content application to perform a search for the entity. The data processing system can access at least one of an address database and a multimedia content provider to identify a reference address for the entity. The data processing system can provide the reference address for the entity to cause the display device to present a content selection interface. The content selection interface can include an element for the reference address, prior to completion of the search for the entity performed by the multimedia content application.

Abstract: Described herein are methods of processing telematics data that include receiving initial telematics data related to a vehicle from a telematics device and processing the initial telematics data to generate processed telematics data. For each recipient of a plurality of recipients, the methods additionally include determining, from the initial telematics data and/or the processed telematics data, data that is to be made accessible to a recipient. Determining the data that is to be made accessible to the recipient comprises evaluating one or more constraints for the recipient that constrain what data the recipient is permitted to receive and determining what data has been requested to be provided to the recipient. For each recipient of a plurality of recipients, the methods additionally include distributing the determined data to the recipient. Also described herein are systems for processing telematics data in accordance with the described methods.

Abstract: Embodiment herein provides a method for managing uniqueness constraints associated with entities in a graph database. The method includes receiving a constraint specification of an entity from a constraint management system and receiving a configure operation for maintaining uniqueness requirement in the constraint management system. The method also includes determining a constraint key based on inputs received for maintaining the uniqueness requirement in the constraint management system; and creating a composite unique constraint based on the constraint key. The composite unique constraint comprises properties of the constraint key and a constraint vertex indicating a class of constraints available in the inputs received for maintaining uniqueness requirement. The method also includes storing the composite unique constraint in the constraint specification received from the constraint management system to validate the uniqueness before performing an operation on the entity.

Abstract: A relational database for migrating data in a workflow between databases in different environments. Graphical user interfaces are generated through which database management scripts are automatically generated for migrating data between environments. Generally, the database management scripts are compatible with database attributes. The database management scripts are executed to update data tables stored on the databases.

Abstract: Method for calculating a modifier code of a file, the method comprising the following steps: a) establishing a list of possible modifier codes; b) establishing a list of a plurality of possible mixer numbers; c) for each modifier code: i) creating a list of hashes of the file; ii) for each mixer number, calculating the hash of the file mixed and modified by the modifier code, the modification of the file being performed using the same modification function; iii) adding each hash calculated in step ii) to the list of hashes of the file; iv) counting the number of different elements N of the list of hashes; v) memorizing this number N, as well as the associated modifier code, if N is the first to be counted or is greater than the number N previously memorized; and d) returning the last modifier code memorized.

Abstract: A network system for providing long haul network connection between endpoint devices is disclosed. The network system includes a first and a second endpoint devices, a first and a second exchange servers, a first access point server coupled between the first endpoint device and the first exchange server, a second access point server coupled between the second endpoint device and the second exchange server, a first storage node coupled between the first exchange server and the second exchange server, and a second storage node coupled between the first exchange server and the second exchange server. The first exchange server is configured to convert first packetized traffic into a carrier file and write the carrier file to the second storage node. The second exchange server is configured to read the carrier file from the second storage node and convert the carrier file into second packetized traffic.

Abstract: Methods and apparatus relating to techniques for multi-tile memory management. In an example, an apparatus comprises a cache memory, a high-bandwidth memory, a shader core communicatively coupled to the cache memory and comprising a processing element to decompress a first data element extracted from an in-memory database in the cache memory and having a first bit length to generate a second data element having a second bit length, greater than the first bit length, and an arithmetic logic unit (ALU) to compare the data element to a target value provided in a query of the in-memory database. Other embodiments are also disclosed and claimed.

Abstract: Systems and methods of task implementation are extended as provided herein and target the web crawling process through a step of submitting a request by a customer to a web crawler. The systems and methods allow a request for a web crawler to be enriched with a customized browsing profile in order to be categorized as an organic human user to obtain targeted content.

Abstract: Embodiments of the present disclosure include techniques for cooperative memory management. In one embodiment, a database management system includes a memory manager for managing a memory buffer. The memory buffer is configured to allocate memory to table data and temporary data dynamically. In some embodiments, table data memory allocations are reduced and temporary data memory allocations are increased to process queries. Temporary data memory allocations may be increased to store temporary data associated with one or more portions of a query. The memory buffer reallocates table data memory allocations and temporary data memory allocations as needed to more efficiently use available memory.

Abstract: A shared database platform implements dynamic masking on data shared between users where specific data is masked, transformed, or otherwise modified based on preconfigured functions that are associated with user roles. The shared database platform can implement the masking at runtime dynamically in response to users requesting access to a database object that is associated with one or more masking policies.

Abstract: The present disclosure provides a method for hierarchically pruning data in a blockchain transaction, which comprises: acquiring a transaction data set; performing N rounds of pruning on the transaction data set based on a data pruning model to obtain a target data set; and performing processing on the target data set to obtain a target value, wherein the target value is configured as the transaction identification number used when the target data set is on-chain. Based on the customized data pruning model, part of the data in the transaction (e.g., Unlocking-Scripts and Locking-Scripts) can be easily pruned in the process of network transmission, internal storage, or construction of a new transaction (especially the Unlocking-Scripts therein) without affecting the process of verifying the data of other parts of the transaction data, which significantly improves the efficiency of UTXO-based blockchains.

Abstract: Techniques are disclosed relating to a graphical user interface (GUI) that is operable to depict data lineage information in levels. In some embodiments, data lineage information may specify a directed graph that is indicative of a data lineage associated with a plurality of data elements. For example, in the data lineage information, the plurality of data elements may be represented as a corresponding plurality of nodes and, in the directed graph, the plurality of nodes may be connected by edges in a manner that is indicative of the data lineage relationships between the plurality of data elements. In various embodiments, the disclosed techniques may generate a data lineage GUI that, for a selected data element of the plurality of elements, is usable to navigate different levels of the data lineage in an upstream and downstream direction relative to a particular level of the selected data element.