Patents Assigned to STARDOG UNION
-
Patent number: 11727000Abstract: In certain embodiments, resource usage in a data retrieval process may be reduced. In some embodiments, a graph query related to a data request may be obtained. The graph query may be transformed into a query set based on a graph data model and patterns of the graph query. Upon generation, the query set may include queries and query operators linking the queries, where the query operators include a first query operator linking first and second queries of the queries or other query operators. Prior to execution of the first and second queries, a satisfiability issue may be predicted, where the satisfiability issue is related to combining results derived from the first and second queries. Based on the prediction, the first query operator may be removed from the query set to update the query set. The updated query set may be executed to satisfy the graph query.Type: GrantFiled: July 14, 2021Date of Patent: August 15, 2023Assignee: STARDOG UNIONInventors: Evren Sirin, Michael Howard Grove, Kendall Grant Clark, Pavel Klinov
-
Publication number: 20210342350Abstract: In certain embodiments, resource usage in a data retrieval process may be reduced. In some embodiments, a graph query related to a data request may be obtained. The graph query may be transformed into a query set based on a graph data model and patterns of the graph query. Upon generation, the query set may include queries and query operators linking the queries, where the query operators include a first query operator linking first and second queries of the queries or other query operators. Prior to execution of the first and second queries, a satisfiability issue may be predicted, where the satisfiability issue is related to combining results derived from the first and second queries. Based on the prediction, the first query operator may be removed from the query set to update the query set. The updated query set may be executed to satisfy the graph query.Type: ApplicationFiled: July 14, 2021Publication date: November 4, 2021Applicant: Stardog UnionInventors: Evrin SIRIN, Michael Howard GROVE, Kendall Grant CLARK, Pavel KLINOV
-
Patent number: 11093498Abstract: In certain embodiments, resource usage in a data retrieval process may be reduced. In some embodiments, a graph query related to a data request may be obtained. The graph query may be transformed into a query set based on a graph data model and patterns of the graph query. Upon generation, the query set may include queries and query operators linking the queries, where the query operators include a first query operator linking first and second queries of the queries or other query operators. Prior to execution of the first and second queries, a satisfiability issue may be predicted, where the satisfiability issue is related to combining results derived from the first and second queries. Based on the prediction, the first query operator may be removed from the query set to update the query set. The updated query set may be executed to satisfy the graph query.Type: GrantFiled: February 13, 2019Date of Patent: August 17, 2021Assignee: Stardog UnionInventors: Evren Sirin, Michael Howard Grove, Kendall Grant Clark, Pavel Klinov
-
Patent number: 10599719Abstract: In some embodiments, templates related to each graph data model of a graph data model set for converting non-graph data representations in a non-graph database to graph data representations compatible with a graph database may be obtained. One or more templates and the non-graph data representations may be provided to a neural network for the neural network to predict additional templates. The additional templates may be provided to the neural network as reference feedback for the neural network's prediction of the additional templates to train the neural network. A collection of non-graph data representations from a given non-graph database may be provided to the neural network for the neural network to generate one or more templates for a given graph data model for converting non-graph data representations in the given non-graph database into graph data representations compatible with a given graph database.Type: GrantFiled: June 13, 2018Date of Patent: March 24, 2020Assignee: Stardog UnionInventors: Evren Sirin, Michael Howard Grove, Kendall Grant Clark, Pedro Carvalho de Oliveira
-
Publication number: 20190384766Abstract: In certain embodiments, resource usage in a data retrieval process may be reduced. In some embodiments, a graph query related to a data request may be obtained. The graph query may be transformed into a query set based on a graph data model and patterns of the graph query. Upon generation, the query set may include queries and query operators linking the queries, where the query operators include a first query operator linking first and second queries of the queries or other query operators. Prior to execution of the first and second queries, a satisfiability issue may be predicted, where the satisfiability issue is related to combining results derived from the first and second queries. Based on the prediction, the first query operator may be removed from the query set to update the query set. The updated query set may be executed to satisfy the graph query.Type: ApplicationFiled: February 13, 2019Publication date: December 19, 2019Applicant: Stardog UnionInventors: Evren Sirin, Michael Howard Grove, Kendall Grant Clark, Pavel Klinov
-
Patent number: 10303688Abstract: In certain embodiments, data retrieval delays may be reduced via prediction-based generation of data subgraphs. In some embodiments, a data request may be predicted to occur in the future based on prior queries compatible with a graph data model. Based on the graph data model, one or more subgraphs representative of data subsets of a data set may be generated. For example, the data set may be data that the data request is predicted to seek, and the subgraphs may be generated in response to the data request prediction. The subgraphs may be stored in a temporary data storage. A subsequent data request matching the predicted data request may be obtained subsequent to the subgraph storage. Based on the subsequent data request matching the predicted data request, the subgraphs may be obtained from the temporary data storage. The subgraphs may be used to respond to the subsequent data request.Type: GrantFiled: June 13, 2018Date of Patent: May 28, 2019Assignee: STARDOG UNIONInventors: Evren Sirin, Michael Howard Grove, Kendall Grant Clark, Pavel Klinov
-
Patent number: 10223417Abstract: In certain embodiments, query-related resource usage in a data retrieval process may be reduced. In some embodiments, a graph query related to a data request may be obtained. The graph query may be transformed into a query set based on a graph data model and patterns of the graph query. Upon generation, the query set may include queries and query operators linking the queries, where the query operators include a first query operator linking first and second queries of the queries or other query operators. Prior to execution of the first and second queries, a satisfiability issue may be predicted, where the satisfiability issue is related to combining results derived from the first and second queries. Based on the prediction, the first query operator may be removed from the query set to update the query set. The updated query set may be executed to satisfy the graph query.Type: GrantFiled: June 13, 2018Date of Patent: March 5, 2019Assignee: STARDOG UNIONInventors: Evren Sirin, Michael Howard Grove, Kendall Grant Clark, Jess M. Balint