Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. ,  propose "probabilistic subgraph" (PS) queries over a graph/network database, which afford users great flexibility in specifying "approximately" what they are looking for.  formally define the probability that a substitution satisfies a PS-query with respect to a graph database.  then present the PMATCH algorithm to ansr such queries and prove its correctness. Our experimental evaluation demonstrates that PMATCH is efficient and scales to massive social networks with over a billion edges.
['Matthias Bröcheler', 'Andrea Pugliese', 'V. S. Subrahmanian']
I am writing a research paper on a idea Probabilistic Subgraph Matching on Huge Social Networks
[{"from": "human", "value": "I am writing a research paper on a idea Probabilistic Subgraph Matching on Huge Social Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. ,  propose \"probabilistic subgraph\" (PS) queries over a graph/network database, which afford users great flexibility in specifying \"approximately\" what they are looking for.  formally define the probability that a substitution satisfies a PS-query with respect to a graph database.  then present the PMATCH algorithm to ansr such queries and prove its correctness. Our experimental evaluation demonstrates that PMATCH is efficient and scales to massive social networks with over a billion edges."}]