Patents by Inventor Muhammad Rizwan Saeed

Muhammad Rizwan Saeed has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Extensible automatic query language generator for semantic data
    Patent number: 10853357
    Abstract: Systems and methods for querying a semantic data set are described. The semantic data set is defined by an ontology that represents a graphical relationship among data included in the semantic data set. One method includes receiving one or more keywords associated with a search operation from a user, and identifying a node associated with each of the one or more keywords. The method includes, for each identified node, tracing a path from the identified node to a root represented in the graphical relationship of the ontology, the path including one or more vertices, and identifying a lowest common ancestor of each of the vertices included in the paths for each identified node. The method includes constructing a subgraph connecting each identified node to the lowest common ancestor, and traversing the subgraph to generate a query in the query language executable against the semantic data set.
    Type: Grant
    Filed: September 11, 2017
    Date of Patent: December 1, 2020
    Assignee: University of Southern California
    Inventors: Muhammad Rizwan Saeed, Charalampos Chelmis, Viktor K. Prasanna
  • EXTENSIBLE AUTOMATIC QUERY LANGUAGE GENERATOR FOR SEMANTIC DATA
    Publication number: 20180075161
    Abstract: Systems and methods for querying a semantic data set are described. The semantic data set is defined by an ontology that represents a graphical relationship among data included in the semantic data set. One method includes receiving one or more keywords associated with a search operation from a user, and identifying a node associated with each of the one or more keywords. The method includes, for each identified node, tracing a path from the identified node to a root represented in the graphical relationship of the ontology, the path including one or more vertices, and identifying a lowest common ancestor of each of the vertices included in the paths for each identified node. The method includes constructing a subgraph connecting each identified node to the lowest common ancestor, and traversing the subgraph to generate a query in the query language executable against the semantic data set.
    Type: Application
    Filed: September 11, 2017
    Publication date: March 15, 2018
    Applicant: University of Southern California
    Inventors: Muhammad Rizwan Saeed, Charalampos Chelmis, Viktor K. Prasanna