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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.