{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T08:32:50Z","timestamp":1724401970724},"reference-count":31,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2019,12,8]],"date-time":"2019-12-08T00:00:00Z","timestamp":1575763200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2018********01"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2021,4,25]]},"abstract":"Summary<\/jats:title>With the increasing size of the RDF dataset, the application of parallel computing frameworks is applying more and more widely in big data. In order to realize the parallel query of data, an edge partitioning algorithm is proposed based on RDF sentence graph. Firstly, the algorithm transforms the RDF graph into an RDF sentence graph using coarsening and partitioning. Secondly, the minimum degree vertex partitioning algorithm is put forward to partition the RDF sentence graph. Finally, according to the equivalence thought between edge segmentation of RDF sentence and vertex segmentation of RDF graph, the intersection between RDF subgraphs is the vertex cut set of RDF graph to achieve parallel query of RDF data. The experimental results show that the algorithm's partitioning time and efficiency are better than the traditional algorithms.<\/jats:p>","DOI":"10.1002\/cpe.5612","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T01:14:01Z","timestamp":1575854041000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Research on partitioning algorithm based on RDF graph"],"prefix":"10.1002","volume":"33","author":[{"given":"Zhi\u2010yun","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Information Engineering Zhengzhou University Zhengzhou China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9803-6711","authenticated-orcid":false,"given":"Chen\u2010yu","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Engineering Zhengzhou University Zhengzhou China"}]},{"given":"Yang","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Information Engineering Zhengzhou University Zhengzhou China"}]},{"given":"Lun","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Engineering Zhengzhou University Zhengzhou China"}]},{"given":"Dun","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Engineering Zhengzhou University Zhengzhou China"}]}],"member":"311","published-online":{"date-parts":[[2019,12,8]]},"reference":[{"key":"e_1_2_8_2_1","first-page":"1222","article-title":"Survey of RDF query processing techniques","volume":"6","author":"Du F","year":"2013","journal-title":"J Softw"},{"key":"e_1_2_8_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3572"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1766-z"},{"issue":"5","key":"e_1_2_8_5_1","first-page":"417","article-title":"Distributed parallel reasoning algorithm with rete for RDF data","volume":"29","author":"Wang J","year":"2016","journal-title":"Pattern Recognit Artif Intell"},{"issue":"1","key":"e_1_2_8_6_1","first-page":"119","article-title":"Minimum Steiner tree based method to keyword search","volume":"31","author":"Zhang Y","year":"2010","journal-title":"J Chin Comput Syst"},{"key":"e_1_2_8_7_1","doi-asserted-by":"crossref","unstructured":"SimaQ LiH.Keyword query approach over RDF data based on tree template. In: Proceedings of the International Conference on Big Data Analysis;2016;Hangzhou China.","DOI":"10.1109\/ICBDA.2016.7509797"},{"key":"e_1_2_8_8_1","unstructured":"GolenbergK SagivYA.A practically efficient algorithm for generating answers to keyword search over data graphs. In: Proceedings of the 19th International Conference on Database Theory;2016;Bordeaux France."},{"key":"e_1_2_8_9_1","doi-asserted-by":"crossref","unstructured":"WangY WangK FuAW\u2010C WongRC\u2010W.KeyLabel algorithms for keyword search in large graphs. In: Proceedings of the International Conference on Big Data;2015;Santa Clara CA.","DOI":"10.1109\/BigData.2015.7363833"},{"key":"e_1_2_8_10_1","doi-asserted-by":"crossref","unstructured":"JiangM FuAW\u2010C WongRC\u2010W.Exact top\u2010k nearest keyword search in large networks. In: Proceedings of the ACM SIGMOD International Conference on Management of Data;2015;Melbourne Australia.","DOI":"10.1145\/2723372.2749447"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2011.00825"},{"issue":"3","key":"e_1_2_8_12_1","first-page":"118","article-title":"HKM clustering algorithm design and research based on Hadoop platform","volume":"36","author":"Zhang S\u2010F","year":"2018","journal-title":"J Appl Sci"},{"issue":"6","key":"e_1_2_8_13_1","article-title":"Fast topology discovery for campus network","author":"Li X\u2010G","year":"2016","journal-title":"J Appl Sci"},{"issue":"4","key":"e_1_2_8_14_1","first-page":"117","article-title":"Data classification method of fuzzy weighted k\u2010nearest neighbor based on affinity","volume":"36","author":"Liu CC","year":"2018","journal-title":"J Appl Sci"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.11.004"},{"key":"e_1_2_8_16_1","doi-asserted-by":"crossref","unstructured":"ZhangY LiuY YuJ LiuP GuoL.VSEP: a distributed algorithm for graph edge partitioning. In: Proceedings of the International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2015);2015;Zhangjiajie China.","DOI":"10.1007\/978-3-319-27161-3_7"},{"issue":"12","key":"e_1_2_8_17_1","first-page":"2625","article-title":"Research on large\u2010scale RDF data query method based on graph clustering","volume":"36","author":"Cui Y","year":"2015","journal-title":"J Chin Comput Syst"},{"key":"e_1_2_8_18_1","unstructured":"ShaoJ YangQ LiuJ KramerS.Graph clustering with density\u2010cut. arXiv preprint arXiv:1606.00950.2016."},{"key":"e_1_2_8_19_1","doi-asserted-by":"crossref","unstructured":"WuB ZhouY YuanP LiuL JinH.Scalable SPARQL querying using path partitioning. In: Proceeding of the 31st International Conference on Data Engineering;2015;Seoul South Korea.","DOI":"10.1109\/ICDE.2015.7113334"},{"key":"e_1_2_8_20_1","unstructured":"GuerrieriA MontresorA.Distributed edge partitioning for graph processing. arXiv preprint arXiv:1403.6270.2014."},{"key":"e_1_2_8_21_1","unstructured":"ZhangH.Balanced graph partitioning: optimized graph cut based on label swapping. In: Proceedings of the International Conference on Behavioral Economic and Socio\u2010Cultural Computing (BESC);2015;Nanjing China."},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402747"},{"key":"e_1_2_8_23_1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-662-43352-2_15","volume-title":"Distributed Applications and Interoperable Systems: 14th IFIP WG 6.1 International Conference, DAIS 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3\u20105, 2014, Proceedings","author":"Rahimian F","year":"2014"},{"key":"e_1_2_8_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-015-1501-x"},{"key":"e_1_2_8_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-4104-3"},{"key":"e_1_2_8_26_1","doi-asserted-by":"crossref","unstructured":"WangL XiaoY ShaoB WangH.How to partition a billion\u2010node graph. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE);2014;Chicago IL.","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"e_1_2_8_27_1","doi-asserted-by":"crossref","unstructured":"LengY ChenZ ZhongF ZhongH.BRDPHHC: a balance RDF data partitioning algorithm based on hybrid hierarchical clustering. In: Proceedings of the 12th International Conference on Embedded Software and Systems;2015;New York NY.","DOI":"10.1109\/HPCC-CSS-ICESS.2015.190"},{"key":"e_1_2_8_28_1","first-page":"186","volume-title":"Distributed Applications and Interoperable Systems: 14th IFIP WG 6.1 International Conference, DAIS 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3\u20105, 2014, Proceedings","author":"Rahimian F","year":"2016"},{"key":"e_1_2_8_29_1","doi-asserted-by":"crossref","unstructured":"MeyerhenkeH SandersP SchulzC.Parallel graph partitioning for complex networks. In: Proceedings of the 29th International Parallel and Distributed Processing Symposium;2015;Hyderabad India.","DOI":"10.1109\/IPDPS.2015.18"},{"key":"e_1_2_8_30_1","doi-asserted-by":"crossref","unstructured":"ZhengZ DingY WangZ WangZ.A novel method of keyword query for RDF data based on bipartite graph. In: Proceedings of the IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS);2017;Wuhan China.","DOI":"10.1109\/ICPADS.2016.0069"},{"key":"e_1_2_8_31_1","doi-asserted-by":"crossref","unstructured":"LiH WangY.Ranked keyword query on Semantic Web data. In: Proceedings of the 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD);2010;Yantai China.","DOI":"10.1109\/FSKD.2010.5569309"},{"key":"e_1_2_8_32_1","unstructured":"ShiL.Medical diagnostic medication.2017.http:\/\/kmap.xjtudlc.com\/pdd\/index.html#download"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.5612","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.5612","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/cpe.5612","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.5612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T04:17:42Z","timestamp":1693541862000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.5612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,8]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,4,25]]}},"alternative-id":["10.1002\/cpe.5612"],"URL":"https:\/\/doi.org\/10.1002\/cpe.5612","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,8]]},"assertion":[{"value":"2019-02-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-04","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}