Abstract

Big graph processing is an important and challenging Big Data problem. Big graphs are used in various fields especially where relationships between objects are important. Nowadays not only programmers work with Big Data. Therefore, for analysts, who often are non-programmers, a graph system will only gain acceptance, if there is a comprehensible way to work with it. Nevertheless, currently, only graph databases support respective languages, but not by distributed graph processing systems. This paper considers the possibility of using the data flow language Pig Latin and compiler Piglet to enable graph processing on a large scale. Currently, they do not support graph processing, the work implements graph algorithms and defines which operators for the Pig Latin language and the Piglet compiler are required to support the processing of the big graphs.

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.