Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2017, Article ID 2573592, 11 pages
https://doi.org/10.1155/2017/2573592
Research Article

An Association-Oriented Partitioning Approach for Streaming Graph Query

Yun Hao,1,2,3 Gaofeng Li,1,2,3 Pingpeng Yuan,1,2,3 Hai Jin,1,2,3 and Xiaofeng Ding1,2,3

1Services Computing Technology and System Lab., School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
2Cluster and Grid Computing Lab., School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
3Big Data Technology and System Lab., School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China

Correspondence should be addressed to Pingpeng Yuan; nc.ude.tsuh.liam@nauypp and Hai Jin; nc.ude.tsuh@nijh

Received 26 December 2016; Accepted 11 April 2017; Published 25 May 2017

Academic Editor: Alex M. Kuo

Copyright © 2017 Yun Hao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. “Linked open data project”, 2014, http://linkeddata.org/.
  2. P. Wang, B. Xu, Y. Wu, and X. Zhou, “Link prediction in social networks: the state-of-the-art,” Science China Information Sciences, vol. 58, no. 1, pp. 1–38, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. Z. Kaoudi, K. Kyzirakos, and M. Koubarakis, “Sparql query optimization on top of dhts,” in Proceedings of 9th International Semantic Web Conference (ISWC '10), pp. 418–435, Springer, 2010. View at Publisher · View at Google Scholar
  4. A. Harth, J. Umbrich, A. Hogan, and S. Decker, “YARS2: a federated repository for querying graph structured data from the Web,” The Semantic Web, vol. 4825, pp. 211–224, 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. P. Yuan, W. Zhang, C. Xie, H. Jin, L. Liu, and K. Lee, “Fast iterative graph computation: a path centric approach,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (SC '14), pp. 401–412, USA, November 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. P. Yuan, C. Xie, L. Liu, and H. Jin, “Pathgraph: a path centric graph processing system,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 10, pp. 2998–3012, 2016. View at Publisher · View at Google Scholar
  7. G. Malewicz, M. H. Austern, A. J. C. Bik et al., “Pregel: a system for large-scale graph processing,” in Proceedings of the International Conference on Management of Data (SIGMOD '10), pp. 135–146, ACM, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. B. Wu, Y. Zhou, P. Yuan, L. Liu, and H. Jin, “Scalable SPARQL querying using path partitioning,” in Proceedings of the IEEE 31st International Conference on Data Engineering (ICDE '15), pp. 795–806, IEEE Computer Society, Seoul, South Korea, April 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. “Metis”, 2015, http://www.cs.umn.edu/metis/.
  10. “Lubm”, 2014, http://swat.cse.lehigh.edu/projects/lubm/.
  11. S. Fortunato, M. Boguñá, A. Flammini, and F. Menczer, “Approximating pagerank from in-degree,” in Proceedings of 4th International Workshop on Algorithms and Models for the Web-Graph (WAW '06), vol. 4936, pp. 59–71, Springer, 2006. View at Publisher · View at Google Scholar
  12. Y. Guo, Z. Pan, and J. Heflin, “LUBM: a benchmark for OWL knowledge base systems,” Web Semantics, vol. 3, no. 2-3, pp. 158–182, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. B. J. Frey and D. Dueck, “Clustering by passing messages between data points,” American Association for the Advancement of Science. Science, vol. 315, no. 5814, pp. 972–976, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. I. Stanton and G. Kliot, “Streaming graph partitioning for large distributed graphs,” in Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2012, pp. 1222–1230, chn, August 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Yuan, P. Liu, B. Wu, H. Jin, W. Zhang, and L. Liu, “Triplebit: a fast and compact system for large scale rdf data,” Proceedings of the VLDB Endowment, vol. 6, no. 7, pp. 517–528, 2013. View at Publisher · View at Google Scholar
  16. P. Yuan, C. Xie, H. Jin, L. Liu, G. Yang, and X. Shi, “Dynamic and fast processing of queries on large-scale rdf data,” Knowledge and Information Systems (KAIS), vol. 41, no. 2, pp. 311–334, 2014. View at Publisher · View at Google Scholar
  17. G. Krishnasamy, A. J. Kulkarni, and R. Paramesran, “A hybrid approach for data clustering based on modified cohort intelligence and K-means,” Expert Systems with Applications, vol. 41, no. 13, pp. 6009–6016, 2014. View at Publisher · View at Google Scholar · View at Scopus
  18. D. Arthur and S. Vassilvitskii, “k-means++: the advantages of careful seeding,” in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '07), pp. 1027–1035, Society for Industrial and Applied Mathematics (SIAM), 2007. View at MathSciNet
  19. M. R. Ackermann, Märtens M., C. Raupach, K. Swierkot, C. Lammersen, and C. Sohler, “Stream{KM}++: a clustering algorithm for data streams,” ACM Journal of Experimental Algorithmics, vol. 17, Article 2.4, 30 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  20. F. Cao, M. Ester, W. Qian, and A. Zhou, “Density-based clustering over an evolving data stream with noise,” in Proceedings of the 6th SIAM International Conference on Data Mining (SDM '06), pp. 328–339, SIAM, 2006. View at MathSciNet
  21. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the 2th International Conference on Knowledge Discovery and Data Mining (KDD '96), pp. 226–231, 1996.
  22. K. Lee and L. Liu, “Scaling queries over big rdf graphs with semantic hash partitioning,” Proceedings of the VLDB Endowment, vol. 6, no. 14, pp. 1894–1905, 2013. View at Publisher · View at Google Scholar
  23. J. Huang, D. J. Abadi, and K. Ren, “Scalable SPARQL querying of large RDF graphs,” Proceedings of the VLDB Endowment, vol. 4, no. 11, pp. 1123–1134, 2011. View at Google Scholar · View at Scopus
  24. C. Tsourakakis, C. Gkantsidis, B. Radunovic, and M. Vojnovic, “FENNEL: streaming graph partitioning for massive scale graphs,” in Prcedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM 2014, pp. 333–342, USA, February 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. A. D. Sarma, S. Gollapudi, and R. Panigrahy, “Estimating PageRank on graph streams,” Journal of the ACM, vol. 58, no. 3, Article ID 13, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  26. X. Zhang, C. Furtlehner, C. Germain-Renaud, and M. Sebag, “Data stream clustering with affinity propagation,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 7, pp. 1644–1656, 2014. View at Publisher · View at Google Scholar · View at Scopus
  27. M. K. Nguyen, T. Scharrenbach, and Bernstein A., “Seven commandments for benchmarking semantic flow processing systems,” in Proceedings of the 9th International Conference on Scalable Semantic Web Knowledge Base Systems (SSWS '13), pp. 66–80, Springer, 2013. View at Publisher · View at Google Scholar
  28. L. Fischer, T. Scharrenbach, and A. Bernstein, “Scalable linked data stream processing via network-aware workload scheduling,” in Proceedings of the 9th International Conference on Scalable Semantic Web Knowledge Base Systems (SSWS '13), pp. 81–96, 2013.
  29. J. Shafer, S. Rixner, and A. L. Cox, “The hadoop distributed filesystem: balancing portability and performance,” in Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS '10), pp. 122–133, usa, March 2010. View at Publisher · View at Google Scholar · View at Scopus