Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many real world datasets can be represented by a network with a set of nodes interconnected with each other by multiple relations. Such a rich graph is called a multigraph. Unfortunately, all the existing algorithms for subgraph query matching are not able to adequately leverage multiple relationships that exist beten the nodes.   propose an efficient indexing schema for querying single large multigraphs, where the indexing schema aptly captures the neighbourhood structure in the data graph. Our proposal SuMGra couples this novel indexing schema with a subgraph search algorithm to quickly traverse though the solution space to enumerate all the matchings. Extensive experiments conducted on real benchmarks prove the time efficiency as ll as the scalability of $$\textsc {SuMGra} $$.
['Vijay Ingalalli', 'Dino Ienco', 'Pascal Poncelet']
I am writing a research paper on a idea SuMGra: Querying Multigraphs via Efficient Indexing
[{"from": "human", "value": "I am writing a research paper on a idea SuMGra: Querying Multigraphs via Efficient Indexing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Many real world datasets can be represented by a network with a set of nodes interconnected with each other by multiple relations. Such a rich graph is called a multigraph. Unfortunately, all the existing algorithms for subgraph query matching are not able to adequately leverage multiple relationships that exist beten the nodes.   propose an efficient indexing schema for querying single large multigraphs, where the indexing schema aptly captures the neighbourhood structure in the data graph. Our proposal SuMGra couples this novel indexing schema with a subgraph search algorithm to quickly traverse though the solution space to enumerate all the matchings. Extensive experiments conducted on real benchmarks prove the time efficiency as ll as the scalability of $$\\textsc {SuMGra} $$."}]