Name
Title | ||
|---|---|---|
Derivation of parallel-efficient structural recursive functions from declarative graph queries. |
Abstract | ||
|---|---|---|
Graphs play an important role today in managing big data, while structural recursion is powerful to process graphs by its flexibility. Designing efficient structural recursive functions to query distributed graphs is still a big challenge because of the performance constraints imposed by the bulk semantics of structural recursion. In this paper, we propose a solution that systematically generates parallel-efficient structural recursive functions from high-level declarative graph queries. Therefore, the complexity in developing efficient structural recursive functions is relaxed by our solution.
|
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2851613.2851951 | SAC 2016: Symposium on Applied Computing
Pisa
Italy
April, 2016 |
Field | DocType | ISBN |
Graph,Primitive recursive function,Computer science,Theoretical computer science,Mutual recursion,Recursive functions,μ operator,Big data,Semantics,Recursion | Conference | 978-1-4503-3739-7 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chong Li | 1 | 0 | 0.34 |
| Le-Duc Tung | 2 | 14 | 1.98 |
| Xiaodong Meng | 3 | 0 | 0.68 |
| Zhenjiang Hu | 4 | 1341 | 99.25 |