Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  study a variant of reachability queries, called label-constraint reachability (LCR) queries. Specifically, given a label set S and two vertices u"1 and u"2 in a large directed graph G,  check the existence of a directed path from u"1 to u"2, where edge labels along the path are a subset of S.  propose the path-label transitive closure method to ansr LCR queries. Specifically,  t4ransform an edge-labeled directed graph into an augmented DAG by replacing the maximal strongly connected components as bipartite graphs.  also propose a Dijkstra-like algorithm to compute path-label transitive closure by re-defining the ''distance'' of a path. Comparing with the existing solutions,  prove that our method is optimal in terms of the search space. Furthermore,  propose a simple yet effective partition-based framework (local path-label transitive closure+online traversal) to ansr LCR queries in large graphs.  prove that finding the optimal graph partition to minimize query processing cost is a NP-hard problem. Therefore,  propose a sampling-based solution to find the sub-optimal partition. Moreover,  address the index maintenance issues to ansr LCR queries over the dynamic graphs. Extensive experiments confirm the superiority of our method.
['Lei Zou', 'Kun Xu', 'Jeffrey Xu Yu', 'Lei Chen', 'Yanghua Xiao', 'Dongyan Zhao']
I am writing a research paper on a idea Efficient processing of label-constraint reachability queries in large graphs
[{"from": "human", "value": "I am writing a research paper on a idea Efficient processing of label-constraint reachability queries in large graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  study a variant of reachability queries, called label-constraint reachability (LCR) queries. Specifically, given a label set S and two vertices u\"1 and u\"2 in a large directed graph G,  check the existence of a directed path from u\"1 to u\"2, where edge labels along the path are a subset of S.  propose the path-label transitive closure method to ansr LCR queries. Specifically,  t4ransform an edge-labeled directed graph into an augmented DAG by replacing the maximal strongly connected components as bipartite graphs.  also propose a Dijkstra-like algorithm to compute path-label transitive closure by re-defining the ''distance'' of a path. Comparing with the existing solutions,  prove that our method is optimal in terms of the search space. Furthermore,  propose a simple yet effective partition-based framework (local path-label transitive closure+online traversal) to ansr LCR queries in large graphs.  prove that finding the optimal graph partition to minimize query processing cost is a NP-hard problem. Therefore,  propose a sampling-based solution to find the sub-optimal partition. Moreover,  address the index maintenance issues to ansr LCR queries over the dynamic graphs. Extensive experiments confirm the superiority of our method."}]