Abstract: A database system operates by: determining a first query that indicates a first request to generate a K nearest neighbors (KNN) model; executing the first query to generate KNN model data for the KNN model, wherein the KNN model data is set as a reduced dataset for one of a plurality of training iterations; determining a second query that indicates a second request to apply the KNN model to input data; and executing the second query to generate model output of the KNN model for the input data based on, for each row in the input data, identifying a classification label for the each row from the discrete set of labels based on performing the KNN classification algorithm to classify the each row in the input data by applying the reduced data set.

Abstract: An apparatus for classifying an entity to an executable data structure, the apparatus including a processor and a memory communicatively connected to the processor, the memory containing instructions configuring the processor to receive entity input from an entity using a graphical user interface, wherein receiving the entity data includes receiving a low-level entity data at a first time and receiving a high-level entity data at a subsequent time determine a degree of interaction pertaining to the entity by comparing the low-level entity data to the high-level entity data, identify at least a protocol metric as a function of the degree of interaction, determine a protocol object as a function of the high-level entity data and the at least a protocol metric, establish an executable data structure for the entity as a function of the protocol object and display the executable data structure using the graphical user interface.

Abstract: A system for determining relevant information based on user interactions may include a processor configured to receive data and associated relevance information from a data source and a set of signals describing a current environment of a user or historical user behavior information in which the data source being local to a computing device. The processor may be further configured to provide, using a machine learning model, a relevance score for each of multiple data items based at least in part on the received relevance information and the set of signals. The processor may be further configured to sort the data items based on a ranking of each relevance score for each data item. The processor may be further configured to provide, as output, the multiple data items based at least in part on the ranking.

Abstract: Methods and systems for managing distribution of data are disclosed. The data may be distributed by edge systems to processing systems. The data may be distributed using a data pipeline. The data pipeline may include functionality to process data using different modalities depending on the type of data and operable connectivity between the edge systems and processing systems. By modifying the manner in which the data is processed, limitations in operable connectivity may be managed and a broader array of different types of data may be more efficiently distributed.

Abstract: The present disclosure provides techniques and solutions for sorting data. In a particular implementation, a sorting technique is provided that places values in a sorted order by adding an offset value to values that are not in a sorted order. The resulting sorted set of values is not truly sorted, in that the set of modified values is sorted, but the underlying data itself is not sorted. In another implementation, a sorting technique can use multiple streams or sets. When an out of order element is encountered, it can be added to a new stream, if such a stream is available. The sorting techniques can be used for a variety of purposes, including provided sorted data for use in generating summary data, or for providing sorted data to be used in determining an intersection between two datasets.

Abstract: A user device can be used to generate medical term expressions, which represent medical terms of a health record. The user device can identify a medical concept present in the health record based on a medical term expression. The user device can generate a node in a personalized relational graph that corresponds to the medical concept. One or more sub-nodes can be added to the node. Responsive to a request, a user interface is presented that identifies the medical concept and some of the additional information.

Abstract: A method includes generating a new user query embedding for a new user query received from a user, obtaining an indexed user query matching the new user query from a search engine index, a vector index corresponding to the indexed user query, and a relevancy score corresponding to the indexed user query. The method further includes selecting a vector structure corresponding to the vector index from a plurality of vector structures in a vector store, obtaining, from the vector structure, a result embedding matching the new user query embedding, transmitting, by a user query answer service to an answer generation model, the result embedding and receiving, by the user query answer service, an answer to the new user query from the answer generation model.

Abstract: A method is provided that includes establishing, by an application server, a remote access session with a client device, and creating, by a file system agent running on the application server, a metadata-only virtual file system associated with the remote access session, wherein the virtual file system only comprises file metadata associated with a plurality of files residing in a local file system of the client device. The method further includes responsive to receiving, by the virtual file system, a request to access content of a file referenced by the virtual file system, redirecting the request to a file system driver implementing at least a sub-tree of the local file system of the client device.

Abstract: In one example method, a first image including M objects is obtained. For N objects in the M objects, when N is greater than or equal to 2, arrangement orders of the N objects is determined, where an arrangement order of any one of the N objects is determined based on at least one of a scene intent weight, a confidence score, or an object relationship score. The scene intent weight is used to indicate a probability that the any object is searched in a scene corresponding to the first image, the confidence score is a similarity between the any object and an image in an image library, and the object relationship score is used to indicate importance of the any object in the first image. Search results of some or all of the N objects are fed back according to the arrangement orders of the N objects.

Abstract: Various examples are directed to systems and methods for installing a plugin to a cloud-implemented database management application. A shared container file system may be initiated at a cloud environment. A plugin container image may be accessed, where the plugin container image comprises plugin payload data describing a first plugin to the database management application and a copy executable. A plugin container may be started at the cloud environment, where the plugin container is based at least in part on the plugin container image. The plugin container may be mounted to the shared container file system. The copy executable may be executed to copy the plugin payload data to the shared container file system. The first plugin may be installed to a database management application instance executing at the cloud environment.

Abstract: The disclosure discloses a point-of-interest recommendation method based on a temporal knowledge graph. Based on the historical behavior trajectory of the user and multimodal information, the disclosure constructs a dynamic temporal knowledge graph and a static group knowledge graph, which are used to learn interest preferences of the user that change over time and stable features that do not change over time, respectively. At the same time, the disclosure uses deep learning methods to build a point-of-interest recommendation model, which can extract a point-of-interest fusion feature representation and a user fusion feature representation from the two knowledge graphs in combination with a user review sentiment embedding sequence to accurately predict a point of interest most likely to be visited by the target user at a next moment. The disclosure has the characteristics of high precision and strong scalability, and can provide support for personalized user behavior trajectory prediction.

Abstract: Techniques are disclosed for storing and accessing data in an information model. In some embodiments, data is stored in the information model using assets, components, and relationships, or using any other suitable transformation of the data. Each asset is a container for components. Each component stores data according to a schema that defines the organization of data in the component. Assets and components can be related to other assets and/or other components. A file can be imported into the information model by extracting data from the file, creating assets and components in the information model based on the extracted data, and wiring together the created assets and components. In addition or alternatively, an application can invoke an API to write data to the information model. An application can also invoke the API to query the information model, such as to read data from the information model.

Abstract: A data platform for managing an application as a first-class database object. The data object can include User Interface (UI) components. The data application can be shared by a provider account to a plurality of consumer accounts using a share object and based on grant commands. The consumer accounts can deploy and operate the UI component based on the share object.

Abstract: A system is provided for intelligent and integrated preservation of multiple electronic data records within a distributed electronic data register. In particular, the system may use a stacked data structure within the distributed register that allows data records or blocks within the distributed register to include multiple links or pointers (e.g., hash values) to previous blocks, where such previous blocks may be linked to a single parent block. By using such a multi-link data structure, the system may prevent the waste of energy and/or computing resources associated with the computational work of the nodes for submitting blocks to be appended to the distributed register. The system may further use a two-pointer algorithm for traversing the multi-link distributed register, thereby providing for an efficient way to search for specific data records. In this way, the system provides a more secure and efficient way to store data within a distributed register.

Abstract: Provided are techniques for a search using an overlay graph mapping to source knowledge graphs. A plurality of overlay graphs are generated, where each overlay graph comprises entities represented by nodes and relations represented by edges, and where the entities and the relations map to a subset of entities and relations in a plurality of source knowledge graphs. A search request comprising an entity and a relation is received. An overlay graph is selected from the plurality of overlay graphs based on the entity and the relation. The search request is issued against the overlay graph, where the search request is translated to knowledge graph specific queries, and where the knowledge graph specific queries are issued against the plurality of source knowledge graphs. Search results are received from the plurality of source knowledge graphs. The search results are used to respond to the search request.

Abstract: A system and method is described for database split generation in a massively parallel or other distributed database environment including a plurality of databases and a data warehouse layer providing data summarization and querying functionality. A database table accessor of the system obtains, from an associated client application, a query for data in a table of the data warehouse layer, wherein the query includes a user preference. The system obtains table data representative of properties of the table, and determines a splits generator in accordance with one or more of the user preference or the properties of the table. The system generates, by the selected splits generator, table splits dividing the user query into a plurality of query splits, and outputs the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits against the table.

Abstract: Operational historian system retrieving summary data values and source data values based on alignment between a summarization cycle duration and a query cycle duration. A retrieval service process executing on a historian device utilizes a summarization cycle duration, including start and/or end times thereof, and a query cycle duration, including start and/or end times thereof, to determine whether to retrieve, via a communications network, source tag data and/or summary tag data from memory storage devices.

Abstract: Embodiments of the disclosed technologies provide solutions for automatically reading digital electronic documents that contain tables and correctly extracting table data, rows and columns from the documents with high accuracy and high throughput. Embodiments are capable of converting a table portion of a read-only document to a searchable, editable data record using text rectangle (TR)-level numerical data that indicates probabilities of TRs belonging to canonicals and at least one convolutional neural network (CNN) that processes the TR-level numerical data to produce table-level numerical data.

Abstract: Video and corresponding metadata is accessed. Events of interest within the video are identified based on the corresponding metadata, and best scenes are identified based on the identified events of interest. A video summary can be generated including one or more of the identified best scenes. The video summary can be generated using a video summary template with slots corresponding to video clips selected from among sets of candidate video clips. Best scenes can also be identified by receiving an indication of an event of interest within video from a user during the capture of the video. Metadata patterns representing activities identified within video clips can be identified within other videos, which can subsequently be associated with the identified activities.

Abstract: This disclosure describes systems, methods, and devices related to analyzing data stored in a relational database. A method may include installing a structured query language (SQL) server on a host server; installing statistical analysis modules on the host server; executing the statistical analysis modules within a relational database of the SQL server to analyze data stored in the relational database; and generating outputs based on the execution of the statistical analysis modules within the relational database.