Abstract: A computer-implemented method for generating a graph database includes generating a prompt for input to a large language model (LLM) based on user input and stored metadata. The LLM is used to extract graph metadata from the prompt, generate a knowledge graph based on the graph metadata and additional sources of data, and further generate a graph data model including both structured and unstructured data using the knowledge graph. A graph platform is used to generating a graph using the graph data model.

Abstract: Various embodiments relate generally to data science and data analysis, and computer software and systems to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby data ingestion is performed to form data representing layered data files and data arrangements to facilitate, for example, interrelations among a system of networked collaborative datasets. In some examples, a method may include forming a first layer data file and a second layer data file, assigning addressable identifiers to uniquely identify units of data and data units to facilitate the linking of data, and implementing selectively one or more of a unit of data and a data unit as a function of a context of a data access request for a collaborative dataset.

Abstract: The present teaching relates to online user profiling. In one example, content associated with a first user of a social media network is obtained. From the content associated with the first user, a first link to a first piece of content is identified. A second user of the social media network associated with the first user is determined in the context of the social media network. From content associated with the second user of the social media network, a second link to a second piece of content is identified. The first and second pieces of content are retrieved based on the first and second links, respectively. User profile of the first user is generated based, at least in part, on the first and second pieces of content.

Abstract: A computer-implemented method for generating by a query engine a graph of operators for a SPARQL query over an RDF graph. The method includes obtaining a graph of operators executable by the query engine, the graph comprising a plurality of basic operators, at least two of said operators being of a first type each configured to find RDF triples of the RDF graph that match a respective basic graph pattern. The method further comprises identifying a group of operators among the at least two basic operators of the graph which are of the first type. The respective basic graph patterns of the group of operators have same subject and/or predicate and/or object and the identified group of operators is replaced in the graph by an equivalent operator configured to find RDF triples of the RDF graph that match the respective basic graph patterns of the group of operators.

Abstract: An event query host can include an event processor configured to process an event stream indicating events that occurred on a computing device. The event processor can add representations of events to an event graph. If an event added to the event graph is a trigger event associated with a query, the event processor can also add an instance of the query to a query queue. The query queue can be sorted based on scheduled execution times of query instances. At a scheduled execution time of a query instance in the query queue, a query manager of the event query host can execute the query instance and attempt to find a corresponding pattern of one or more events in the event graph.

Abstract: A file access method includes that a second device may initiate a file access request to a first device, where the file access request includes a file identifier of a file. After receiving the file access request, a network interface card of the first device may directly parse the file access request to obtain the file identifier carried in the file access request, then access the file in a memory of the first device based on the file identifier, and send a file access response to the second device. When the first device receives the file access request, the network interface card of the first device may process the file access request without intervention of a processor of the first device.

Abstract: A computer-implemented method for tracking search performance includes executing a search query at a first computing device and computing a runtime for each of one or more components of the search query. The method also includes comparing a respective runtime for each of the one or more components with a respective threshold value, wherein the respective threshold value for each of the one or more components is based on a respective statistic determined using runtimes from prior executions of the search query. Further, responsive to determining that the respective runtime is higher than the threshold value, the method includes transmitting an alert to a second computing device in a cloud computing environment.

Abstract: A method for incremental metapath storage and dynamic maintenance is provided, which includes, reformatting metapath instances, from a designated heterogeneous graph and of a designated metapath type, into path graphs; executing graph updating tasks and performing dynamic maintenance on the updated path graphs, traversing the path graph to obtain the location of metapath updates and update the path graph; for metapaths with length greater than 2 and with symmetrical central portion, central merge operation is performed to simplify path graph and perform subsequent restoration operation; and directly perform restoration operation on path graphs that do not meet the merging conditions. The present disclosure utilizes characteristics of graph update to obtain locality of metapath updates, and combines internal relationship characteristics of metapath instances to greatly speed up metapath generation and achieve real-time inference of dynamic heterogeneous graph models.

Abstract: A system for dataflow graph processing comprises a communication interface and a processor. The communication interface is configured receive an indication to generate a dataflow graph, wherein the indication includes a set of queries. The processor is coupled to the communication interface and is configured to: determine dependencies of each query in the set of queries on another query; determine a DAG of nodes based at least in part on the dependencies; insert a node in the DAG of nodes to generate an updated DAG to enforce an expectation; determine a dataflow graph based on the updated DAG; and provide the dataflow graph.

Abstract: A data query request processing method is provided. In the method, a node device receives a data query request transmitted by another node device for querying data related to a first vertex in a graph database through a first processing model. The data query request carries an identifier of a start vertex. The node device transmits the data query request to a second processing model through the first processing model. The second processing model is configured to process data of the start vertex. The node device determines a third processing model based on the data query request through the second processing model, the third processing model being configured to process data of the first vertex or an intermediate vertex between the start vertex and the first vertex. The node device transmits the data query request to the third processing model through the second processing model.

Abstract: One or more embodiments provide for a method. The method includes applying, to a raw data structure defining a form, a data extraction controller to extract text from the raw data structure. The method also includes determining a text type of the text. The method also includes generating, according to the text type, a prompt for a language model to request enhanced information. The enhanced information includes information implicit in the form. The method also includes applying, with the prompt, the language model to the text to generate the enhanced information. The method also includes applying a data model generator to define a data model with a combination of the text and the enhanced information. The data model is a computer-readable representation of the form.

Abstract: The present teaching relates to method and system for generating a stream of content items. A plurality of entities associated with a time-window are obtained, wherein each entity of the plurality of entities is associated with at least one content item. For each entity, a first parameter with respect to the time-window, a second parameter with respect to previous time-windows, and a trendiness score based on a function of the first parameter and the second parameter are respectively calculated. A graph based on one or more entity-pairs is generated, wherein each entity-pair of the one or more entity-pairs satisfies a first criterion. A stream of content items is generated based on the graph, wherein each content item in the stream of content items corresponds to at least one of the one or more entity pairs.

Abstract: A system and method for iteratively populating, querying, and ranking governmental data across heterogeneous databases may include iteratively populating at least one database with governmental data elements by obtaining source data from governmental data sources at predefined times, transforming the source data using at least one database schema, and populating the database, which may be a vector, relational, or graph database. A user query is received, comprising a query string, and processed using a routing agent to determine the data type or semantic scope and select at least one agent from a plurality of agents, including structured data agents, unstructured data agents, graph data agents, semantic search agents, validation agents, bias mitigation agents, or fallback agents. The query is modified using metadata, executed to retrieve responses, and input into a relevance machine learning model to determine relevance scores and rank responses. Ranked query responses are outputted to the user.

Abstract: Methods comprising determining a dataset of entries, each comprising an entity identifier and associated application identifier(s) are provided. One method comprises determining a set of application pairs from the dataset; determining a correlation score for each application pair based; responsive to the correlation score exceeding a threshold correlation value: determining application identifiers of the application pair as being correlated; providing a correlation write request comprising the applications identifiers of the pair to an app recommender database.

Abstract: A plurality of different views of data associated with a storage domain stored on a deduplicated storage are traversed to determine data chunks belonging to each view of the plurality of different views of data associated with the storage domain. A request for a metric associated with disk space utilization of a group of one or more selected views of data associated with the first storage domain included in the plurality of different views of data associated with the first storage domain that are stored on the deduplicated storage is received. Data chunks belonging to the one or more selected views of data associated with the first storage domain of the group are identified. An incremental disk space utilization of the group is determined, including by determining a total size of the identified data chunks. The metric associated with disk space utilization is provided based on the determined incremental disk space utilization of the group.

Abstract: A system and method for information storage using blockchain and pointer databases, comprising a computer with a blockchain manager and datastore manager, and blockchain data input, which connects over a network to a distributed blockchain ledger containing information such as personally-identifying data and a datastore system containing searchable information such as a DNS system on the persons entered into the blockchain, the datastore system also containing reference numbers for each searchable block in the blockchain, such that verification or identification can both be accomplished swiftly and securely of data in the blockchain such as for data verification to verify or identify persons submitting data to such a system.

Abstract: A non-transitory computer readable storage medium has instructions executed by a processor to receive change data events from a data source. Ordered positions of the change data events are maintained using a system checkpoint. The change data events are written to a document-oriented data store including a change data event collection and a change data event target checkpoint collection. There is an identification when an ordered position of change data events at the system checkpoint is lower than an ordered position of change data events in the change data event target checkpoint collection. Data source records following a position of change data events at the system checkpoint are collected. Records up to the position of change data events in the change data event target checkpoint collection are discarded and de-duplicated for exactly once delivery.

Abstract: A system and method for productivity improvements in document comprehension is disclosed. The method includes steps of receiving a query statement for retrieving a subset of documents from a set of documents and generating a query vector to determine the similarity of the query statement with the documents in the set of documents using the query vector and the document vector to generate a document similarity score. The documents in the set of documents are ranked to generate a ranked set of documents. The method further determines at least one of a query explainability score and a document explainability score and provisions a user to select at least one word from at least one from the query statement and the document, extracting the subset of document from the ranked set of documents based on the selection of the user; and displaying the sub set of document.

Abstract: Disclosed is an encoding system and associated methods for generating a graph-integrated tree-based representation of data that provides for direct lateral traversals of nodes in a each layer of the tree-based representation. The encoding system organizes data from a dataset to a tree-based representation with multiple layers and multiple nodes in each layer. The encoding system detects the nodes in each layer, and defines a graph structure that links the nodes in each layer for direct lateral access. The encoding system searches the tree-based representation in response to a query for a particular subset of the data by performing a single downward traversal to a particular layer with individual nodes that satisfy part of the query, and by laterally traversing the nodes in the particular layer using the graph structure to directly access a second node in the particular layer from a first node in the particular layer.

Abstract: The present disclosure relates generally to infrastructure for queryable supergraph subset representations. Briefly, in at least one implementations, an apparatus may comprise at least one processor of at least one computing device to obtain a source graph schema, obtain an input from a user, wherein the input from the user to at least specify one or more filters, generate one or more subset representations of the source graph schema based at least in part on the specified one or more filters, and provide access to the one or more subset representations of the source graph schema for one or more particular entities and deny access to one or more aspects of the source graph schema absent from the one or more subset representations for the one or more particular entities.