Abstract
High throughput issue is one of the major obstacles for opening up the new big data stream computing era. A high throughput big data stream computing system is need, optimising the data flow graph is an important way to offer a high throughput computing environment in big data stream computing system. In this paper, the definition of data flow graph in big data stream computing is given and the properties of data flow graph are systematically analysed by referring to the stream computing theories. A series of optimisation strategies for data flow graph in big data stream computing environments are put forward, all those strategies will greatly improve the structure of data flow graph, and provide a high throughput environment for big data stream computing.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Computing Science and Mathematics
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.
