Herein are techniques that concurrently populate entries in a compressed sparse row (CSR) encoding, of a type of edge of a heterogenous graph. In an embodiment, a computer obtains a mapping of a relational schema to a graph data model. The relational schema defines vertex tables that correspond to vertex types in the graph data model, and edge tables that correspond to edge types in the graph data model. Each edge type is associated with a source vertex type and a target vertex type. For each vertex type, a sequence of persistent identifiers of vertices is obtained. Based on the mapping and for a CSR representation of each edge type, a source array is populated that, for a same vertex ordering as the sequence of persistent identifiers for the source vertex type, is based on counts of edges of the edge type that originate from vertices of the source vertex type. For the CSR, the computer populates, in parallel and based on said mapping, a destination array that contains canonical offsets as sequence positions within the sequence of persistent identifiers of the vertices.

A graph-based data flow control system includes a control plane system coupled to SCP subsystems. The control plane system identifies a workload, and identifies service(s) on the SCP subsystems for manipulating/exchanging data to perform the workload. The control plane system generates a respective SCP-local data flow control graph for each SCP subsystem that defines how their service(s) will manipulate/exchange data within that SCP subsystem, and generates inter-SCP data flow control graph(s) that define how service(s) provided by at least one SCP subsystem will manipulate/exchange data with service(s) provided by at least one other SCP subsystem. The control plane system then transmits each respective SCP-local data flow control graph to each of the SCP subsystems, and the inter-SCP data flow control graph(s) to at least one SCP subsystem, for use by the SCP subsystems in causing their service(s) to manipulate/exchange data to perform the workload.

The technology disclosed relates to maintaining a cache of effective properties in an identity management system employing a graph. In particular, it relates to handling vertex/edge and/or graph topology updates in accordance with update notification requirements configured from a schema and, in conjunction with detecting updating of vertex/edge attributes and/or graph topology, recalculating effective attributes in accordance with the configured notification requirements.

A method of operating first and second terminal devices for transmitting data in a device-to-device communication mode in a wireless telecommunications system supporting communications on a first carrier operating over a first frequency band and a second carrier operating over a second frequency band. The first terminal device transmits control signalling on the first carrier and this is received by the second terminal device. The control signalling comprises an indication of an allocation of radio resource blocks on the second carrier to be used for transmitting user-plane data from the first terminal device to the second terminal device. The first terminal device then proceeds to transmit the user-plane data to the second terminal device on the second carrier using the radio resource blocks on the second carrier identified by the control signalling. The control signalling may also provide an indication of an allocation of radio resource blocks on the first carrier to be used for transmitting user-plane data to the second terminal device.

Described are methods, systems and computer readable media for performance logging of complex query operations.

In one embodiment, a method includes receiving, from a client system associated with a first user, a request to access a user-card interface. The method includes generating, in response to the request, multiple user-cards, each user-card being associated with a pre-selected query. Each user-card includes references to second users matching the pre-selected query associated with the user-card. The method includes calculating a user-card score for each user-card. The user-card score represents a relevance of the pre-selected query to the first user and a relevance of the second users referenced in the user-card to the first user. The relevance of each second user referenced in the user-card is based on an affinity coefficient of the first user with respect to the second user. The method includes sending, to the client system, instructions for presenting the user-card interface with user-cards in ranked order based on the user-card score associated with each user-card.

Examples described herein generally relate to a computer system for generating a knowledge graph storing a plurality of entities and to displaying a topic page for an entity in the knowledge graph. The computer system performs a mining of source documents within an enterprise intranet to determine a plurality of entity names. The computer system generates an entity record within the knowledge graph for a mined entity name based on an entity schema and the source documents. The entity record includes attributes aggregated from the source documents. The computer system receives a curation action on the entity record from a first user. The computer system updates the entity record based on the curation action. The computer system displays an entity page including at least a portion of the attributes to a second user based on permissions of the second user to view the source documents.

A system and method for chatbot and search engine integration comprising chatbot crawler engine configured to detect all possible paths through a conversational flow between a chatbot and a user, and also comprising a chatbot search integration manager configured to receive a processed conversation flow from the chatbot crawler engine, parse the conversation flow to identify keywords and features, and build an indexable data structure which can be integrated into search engines in order to expose the information and data contained within the chatbot's knowledge base. This integration may allow search engine users to be redirected to a website hosting the chatbot when an indexed data structure comprises information relevant to a search engine query.

An exemplary method comprises receiving data points, selecting a first subset of the data points to generate an initial set of landmarks, each data point of the first subset defining a landmark point and for each non-landmark data point: calculating first data point distances between a respective non-landmark data point and each landmark point of the initial set of landmarks, identifying a first shortest data point distance from among the first data point distances between the respective non-landmark data point and each landmark point of the initial set of landmarks, and storing the first shortest data point distance as a first landmark distance for the respective non-landmark data point. The method further comprising identifying a non-landmark data point with a longest first landmark distance in comparison with other first landmark distances and adding the identified non-landmark data point associated as a first landmark point to the initial set of landmarks.

A wireless communication network serves a wireless user device with a wireless communication service from a wireless network slice that includes a Virtual Network Function (VNF). The VNF maintains hardware-trust with a distributed ledger. The distributed ledger maintains hardware-trust with the VNF. The VNF delivers the wireless communication service to the wireless user device from the wireless network slice. The VNF generates slice data that characterizes the service delivery. When the VNF maintains the hardware-trust with the distributed ledger, the VNF transfers the slice data to the distributed ledger. When the distributed ledger maintains the hardware-trust with the VNF, the distributed ledger stores the slice data.