Abstract: A method comprises receiving a request to combine data from a plurality of data collections based on one or more constraints, and analyzing the request using one or more machine learning algorithms to determine an order by which respective ones of the plurality of data collections are to be searched. The respective ones of the plurality of data collections are searched according to the determined order, and an output of combined data from the searching is generated in response to the request.

Abstract: In one technique, a definition of a materialized view is identified. Based on the definition, multiple candidate partitioning schemes are identified. A query is generated that indicates one or more of the candidate partitioning schemes. The query is then executed, where executing the query results in one or more partition counts, each corresponding to a different candidate partitioning scheme of the one or more candidate partitioning schemes. Based on the one or more partition counts, a candidate partitioning scheme is selected from among the plurality of candidate partitioning schemes. The materialized view is automatically partitioned based on the candidate partitioning scheme.

Abstract: An index is provided of content at timestamps of frames in a video. A search request is received with search content. A determination is made of matching content in the index, associated with a timestamp, matching the search content. A computer addressable link to the timestamp in the index associated with the matching content is returned to the search request. Selection of the computer addressable link causes the video to play from the timestamp.

Abstract: A computer-implemented method that includes: receiving, at a middleware server, an input stream of query requests each requesting an electronic information service provided by an external database of an external trusted party, wherein the query requests are issued by internal enterprise applications; determining, by the middleware server, a first service validity period for a query request from the input stream, wherein the first service validity period is pre-determined; determining, by the middleware server, a gap between a current date for the query request and a corresponding past date when the query request was last successfully answered by the external database; and in response to determining that the gap is smaller than the first service validity period, fetching a corresponding query result from a staging table on the middleware server, wherein the corresponding query result was received when the query request was last successfully answered by the external database.

Abstract: The retrieval of files can be facilitated in real-time in the general context of backup and recovery. A processor can receive a request to retrieve a particular volume of data from an object storage database. A virtual volume can be presented to an emulator for creation of a virtual machine representing the particular volume of data. A request can be received to access a particular file from the particular volume of data at a specific point in time. In response to the request to access the file, the data stream can be paused, the particular file can be fetched, and the particular file can be transmitted to the emulator.

Abstract: Methods, systems, and computer-readable storage media for receiving a query from a digital assistant of an enterprise system, retrieving data that is responsive to the query from a data management system, inputting a first few-shot prompt to a LLM, and determining, in response to the first few-shot prompt, that a graphical representation of the data is to be generated, and in response: inputting a second few-shot prompt and a third few-shot prompt to the LLM, receiving code from the LLM responsive to the third few-shot prompt, and executing the code to render the graphical representation with the digital assistant.

Abstract: Example solutions for executing a query in a declarative graph query language include receiving the query for data in a database and determining if one or both of i) a pattern in the query, and ii) the data in the database render the query suitable for being executed, at least in part, in parallel. If either condition indicates that the query is suitable for being executed, at least in part, in parallel, one or more fork operations and join operations are injected into a query plan, and the query is executed according to the query plan. Some examples further determine whether executing the query in parallel is computing resource-efficient, and only executes computing resource-efficient queries in parallel.

Abstract: A system, method, and computer-readable medium are disclosed that may generate staging data independently from the execution of control scripts, which process the staging data, improving the quality, efficiency, and speed of data processing systems. The staging data can be independently loaded, validated, and utilized across multiple control scripts, reducing redundancy in the loading of data and the overhead of executing separate data processing for each control script. The control scripts can be automatically validated, such as by verifying expected output data ranges. Additionally, the complexity of the control scripts can be reduced as the loading of data is not performed by the control scripts. The controls scripts can generate a variety of output data, such as an indication of impacted accounts, and provide notifications based on the output data. A variety of machine learning classifiers may automatically generate the staging data and validate the staging data and/or output data.

Abstract: A decision support system and method, which receives user inputs comprising: at least one user criterion, and at least one user input tuning parameter representing user tradeoff preferences for producing an output; and selectively produces an output of tagged data from a clustered database in dependence on the at least one user criterion, the at least one user input tuning parameter, and a distance function; receives at least one reference-user input parameter representing the at least one reference-user's analysis of the tagged data and the corresponding user inputs, to adapt the distance function in accordance with the reference-user inputs as a feedback signal; and clusters the database in dependence on at least the distance function, wherein the reference-user acts to optimize the distance function based on the user inputs and the output, and on at least one reference-user inference.

Abstract: As a part of an embedded system environment, an overlay filesystem package manager obtains package files for a filesystem operation. the package files are stored in a temporary memory location. a composite layer presenting upper and lower filesystems of an overlay filesystem, is accessed to compare the package files with an associated files in the composite layer. When a difference is detected between a package file and an associated file, the package file is copied or moved to the upper filesystem. If the package file is not different from the associated file in the composite layer, it is not copied and deleted from the temporary memory location.

Abstract: A data processing device includes: a recording unit (21) that records, as a history of a plan tree of each issued query, an execution result of the plan tree, a history of specific information for specifying each node of the plan tree, and an appearance frequency at which the plan tree has appeared in the past; and a cache reuse unit (25) that obtains specific information corresponding to an execution plan being executed, to refer to the history of the plan tree by using the obtained specific information as a key, and reuses the execution result of the plan tree of the obtained specific information when the obtained specific information exists.

Abstract: In various embodiments, a data storage system maintains a data store for a plurality of groups of users, where the data store includes a first section that is accessible by a first group of users, but not a second group of users, via the data storage system. In response to receiving, from a first user of the first group of users, a request to share data with the second group of users, the data storage system sends a request to a second user of the second group of users. Subsequent to receiving an acceptance from the second user, the data is stored in a second object in a second section of the data store that is accessible by the second group of users, but not the first group of users, via the data storage system.

Abstract: Systems and methods for updating metadata. In some embodiments, in response to detecting an instruction executed by a hardware system, a source location of the instruction may be identified. First metadata associated with the instruction may be used to determine whether the instruction is allowed. In response to determining that the instruction is allowed, the source location of the instruction may be associated with second metadata.

Abstract: A computer system receives a database query to be executed against a database having a database table that stores records associated with keys. The database query specifies a set of conditional expressions that affect which ones of those records are returned. Based on the set of conditional expressions, the computer system derives a set of key ranges. The deriving can include representing the set of conditional expressions as a set of key spaces, performing a set of logical operations on pairs of those key spaces to reduce a number of key spaces in the set of key spaces, and converting the set of key spaces into the set of key ranges after performing the set of logical operations.

Abstract: A system and method for hierarchical database operation accelerator for scaling a single node database with a plurality of accelerator cards is provided, including: a host, receiving a query plan, generating a corresponding query operation and distributing them, receiving and processing aggregated execution results; a hierarchy accelerator module, which is connected to the host, receiving the query operation distributed and returning the aggregated execution results; the hierarchy accelerator module comprises a master accelerator card and at least one slave accelerator card, the slave accelerator card returns the execution results to the master accelerator card, by the master accelerator card completes the subsequent query operation which is aggregated and assigned by the execution results, returning the aggregated execution results to the host; the accelerator system having a multi-level storage architecture of accelerator chip on-chip cache, the accelerator card memory, the accelerator card storage, and the

Abstract: Data being identified includes a first portion of data and a second portion of data. Based on identifying the data, a data structure is generated. The data structure can include a first section having a first symbol associated with the first portion of data and a second symbol associated with the second portion of data. Further, the first section can include a first offset value corresponding to the first portion of data and a second offset value corresponding to the second portion of data. The data structure can include a second section with a plurality of pointers that reference at least a plurality of symbols including at least the first and second symbol. The data structure can be referenced to process one or more queries against the data.

Abstract: Embodiments are directed to systems, devices, methods, and techniques to determine words or word combinations of search engine queries and selected items corresponding to the words or word combinations. Embodiments also include applying a machine learning model to the word or word combinations and the selected items to determine a mapping between a word or word combination and a particular selected item, and updating attribute data in a web document with the word or word combination, wherein the web document is associated with the particular item such that a search including the word or word combination returns a result including the web document.

Abstract: A system for automated conversion and delivery of medical images. In an example implementation, a server is configured to retrieve a medical image file including medical data and metadata, in a medical data format, determine an output destination type based on the metadata, identify standardized format specifications based on the determined output destination type from the retrieved metadata, convert the medical data into a format compatible with the identified standardized format, and transmit an output message of the converted medical data to at least a recipient delivery address.

Abstract: Systems and techniques for managing data in a relational database environment and a non-relational database environment. Data in the relational database environment that is static and to be maintained beyond a preselected threshold length of time is identified. The data is copied from the relational database and stored in the data the non-relational database. Access to the data is provided from the non-relational database via a user interface that accesses both the relational database and the non-relational database.

Abstract: Providing Quality of Service (QoS) for replicating datasets including: receiving, by a target data repository from a source data repository, a checkpoint describing one or more updates to one or more datasets stored in the source data repository and the target data repository; adding, by the target data repository, the checkpoint to a first queue for checkpoints directed to one or more volumes in the target data repository, wherein the first queue is included in a plurality of queues for the target data repository; selecting, by the target data repository, one or more queues from the plurality of queues; and servicing an operation from each of the selected one or more queues.