Research on partitioning algorithm based on RDF graph

Summary 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 transform...

Full description

Saved in:

Bibliographic Details
Published in:	Concurrency and computation Vol. 33; no. 8
Main Authors:	Zheng, Zhi‐yun, Wang, Chen‐yu, Ding, Yang, Li, Lun, Li, Dun
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 25.04.2021
Subjects:	Algorithms edge partitioning Graph theory minimum degree vertex parallel query Partitioning RDF graph RDF sentence graph Segmentation vertex cut set
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Summary 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.
AbstractList	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. Summary 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.
Author	Zheng, Zhi‐yun Wang, Chen‐yu Ding, Yang Li, Lun Li, Dun
Author_xml	– sequence: 1 givenname: Zhi‐yun surname: Zheng fullname: Zheng, Zhi‐yun organization: Zhengzhou University – sequence: 2 givenname: Chen‐yu orcidid: 0000-0001-9803-6711 surname: Wang fullname: Wang, Chen‐yu organization: Zhengzhou University – sequence: 3 givenname: Yang surname: Ding fullname: Ding, Yang organization: Zhengzhou University – sequence: 4 givenname: Lun surname: Li fullname: Li, Lun organization: Zhengzhou University – sequence: 5 givenname: Dun surname: Li fullname: Li, Dun email: ielidun@zzu.edu.cn organization: Zhengzhou University
BookMark	eNp1kNFLwzAQxoNMcJuCf0LBF186L2mbNo8yNxUEZehzuKbJltE1NemQ_fe2TnwQfbqD-3333X0TMmpcowm5pDCjAOxGtXqWccpOyJhmCYuBJ-nop2f8jExC2AJQCgkdk2ylg0avNpFrohZ9ZzvrGtusI6zXzttus4tKDLoa5qu7ZbT22G7OyanBOuiL7zolb8vF6_whfnq-f5zfPsWKid5PFBVWtMwh4TkoYCnlZZKLQgBUuUpZWRrEsig0ihwYMyanRoBKOXJhRH_ylFwd97beve916OTW7X3TW0qWgWCZSATvqdmRUt6F4LWRynY4_NF5tLWkIIdoZB-NHKLpBde_BK23O_SHv9D4iH7YWh_-5eT8ZfHFfwIIZnIM
CitedBy_id	crossref_primary_10_3390_math9040450 crossref_primary_10_3390_math9121419
Cites_doi	10.1007/s11390-015-1501-x 10.3724/SP.J.1016.2011.00825 10.1016/j.datak.2011.11.004 10.1109/ICPADS.2016.0069 10.1007/978-3-319-27161-3_7 10.1109/ICDE.2015.7113334 10.1109/ICBDA.2016.7509797 10.1002/cpe.3572 10.1109/BigData.2015.7363833 10.1109/IPDPS.2015.18 10.1007/s11704-015-4104-3 10.1007/s11227-016-1766-z 10.14778/3402707.3402747 10.1109/ICDE.2014.6816682 10.1109/FSKD.2010.5569309 10.1145/2723372.2749447 10.1007/978-3-662-43352-2_15 10.1109/HPCC-CSS-ICESS.2015.190
ContentType	Journal Article
Copyright	2019 John Wiley & Sons, Ltd. 2021 John Wiley & Sons, Ltd.
Copyright_xml	– notice: 2019 John Wiley & Sons, Ltd. – notice: 2021 John Wiley & Sons, Ltd.
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1002/cpe.5612
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts CrossRef
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1532-0634
EndPage	n/a
ExternalDocumentID	10_1002_cpe_5612 CPE5612
Genre	article
GrantInformation_xml	– fundername: Science and Technology Research project of Henan funderid: 14430051007 – fundername: Science and Technology Research project of Zhengzhou funderid: 141PPTGG368 – fundername: Reform Research Project of Higher Education of Henan funderid: 2014SJGLX007 – fundername: National Social Science Foundation project funderid: 17BXW065 – fundername: National Key Research and Development Project funderid: 2018********01
GroupedDBID	.3N .DC .GA 05W 0R~ 10A 1L6 1OC 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANLZ AAONW AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACCFJ ACCZN ACPOU ACSCC ACXBN ACXQS ADBBV ADEOM ADIZJ ADKYN ADMGS ADOZA ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AEQDE AEUQT AEUYR AFBPY AFFPM AFGKR AFPWT AFWVQ AHBTC AITYG AIURR AIWBW AJBDE AJXKR ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ATUGU AUFTA AZBYB BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS F00 F01 F04 F5P G-S G.N GNP GODZA HGLYW HHY HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RWI RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAYXX ADMLS AEYWJ AGHNM AGYGG CITATION O8X 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c2932-98dad1b703670c02416b3798900d7c42bbfaab88ea97022ff71f90c46a69f9153
IEDL.DBID	DRFUL
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000501116000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1532-0626
IngestDate	Mon Jul 14 07:45:43 EDT 2025 Tue Nov 18 21:16:21 EST 2025 Sat Nov 29 01:41:23 EST 2025 Wed Jan 22 16:29:32 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	8
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c2932-98dad1b703670c02416b3798900d7c42bbfaab88ea97022ff71f90c46a69f9153
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-9803-6711
PQID	2509259396
PQPubID	2045170
PageCount	12
ParticipantIDs	proquest_journals_2509259396 crossref_citationtrail_10_1002_cpe_5612 crossref_primary_10_1002_cpe_5612 wiley_primary_10_1002_cpe_5612_CPE5612
PublicationCentury	2000
PublicationDate	25 April 2021
PublicationDateYYYYMMDD	2021-04-25
PublicationDate_xml	– month: 04 year: 2021 text: 25 April 2021 day: 25
PublicationDecade	2020
PublicationPlace	Hoboken
PublicationPlace_xml	– name: Hoboken
PublicationTitle	Concurrency and computation
PublicationYear	2021
Publisher	Wiley Subscription Services, Inc
Publisher_xml	– name: Wiley Subscription Services, Inc
References	2012; 72 2010; 31 2015; 36 2015; 28 2010 2015; 30 2016; 74 2017 2016 2015 2011; 34 2014 2016; 29 2011; 4 2015; 9 2013; 6 2018; 36 e_1_2_8_29_1 Liu CC (e_1_2_8_14_1) 2018; 36 e_1_2_8_24_1 e_1_2_8_25_1 e_1_2_8_26_1 Rahimian F (e_1_2_8_23_1) 2014 e_1_2_8_27_1 Wang J (e_1_2_8_5_1) 2016; 29 e_1_2_8_3_1 e_1_2_8_4_1 e_1_2_8_7_1 e_1_2_8_9_1 e_1_2_8_8_1 Li X‐G (e_1_2_8_13_1) 2016 Cui Y (e_1_2_8_17_1) 2015; 36 e_1_2_8_20_1 Du F (e_1_2_8_2_1) 2013; 6 e_1_2_8_21_1 e_1_2_8_22_1 e_1_2_8_18_1 e_1_2_8_19_1 e_1_2_8_15_1 e_1_2_8_16_1 Zhang Y (e_1_2_8_6_1) 2010; 31 Zhang S‐F (e_1_2_8_12_1) 2018; 36 Rahimian F (e_1_2_8_28_1) 2016 e_1_2_8_32_1 e_1_2_8_10_1 e_1_2_8_31_1 e_1_2_8_11_1 e_1_2_8_30_1
References_xml	– volume: 31 start-page: 119 issue: 1 year: 2010 end-page: 123 article-title: Minimum Steiner tree based method to keyword search publication-title: J Chin Comput Syst – volume: 36 start-page: 2625 issue: 12 year: 2015 end-page: 2628 article-title: Research on large‐scale RDF data query method based on graph clustering publication-title: J Chin Comput Syst – volume: 36 start-page: 118 issue: 3 year: 2018 end-page: 128 article-title: HKM clustering algorithm design and research based on Hadoop platform publication-title: J Appl Sci – volume: 9 start-page: 919 issue: 6 year: 2015 end-page: 933 article-title: RDF partitioning for scalable SPARQL query processing publication-title: Front Comput Sci – volume: 36 start-page: 117 issue: 4 year: 2018 end-page: 126 article-title: Data classification method of fuzzy weighted k‐nearest neighbor based on affinity publication-title: J Appl Sci – volume: 72 start-page: 285 year: 2012 end-page: 303 article-title: SBV‐cut:vertex‐cut based graph partitioning using structural balance vertices publication-title: Data Knowl Eng – start-page: 186 year: 2016 end-page: 200 – issue: 6 year: 2016 article-title: Fast topology discovery for campus network publication-title: J Appl Sci – start-page: 186 year: 2014 end-page: 200 – volume: 74 start-page: 5797 year: 2016 end-page: 5812 article-title: An efficient cascaded method for network intrusion detection based on extreme learning machines publication-title: J Supercomput – volume: 29 start-page: 417 issue: 5 year: 2016 end-page: 426 article-title: Distributed parallel reasoning algorithm with rete for RDF data publication-title: Pattern Recognit Artif Intell – volume: 6 start-page: 1222 year: 2013 end-page: 1242 article-title: Survey of RDF query processing techniques publication-title: J Softw – year: 2017 – volume: 28 start-page: 3895 year: 2015 end-page: 3909 article-title: Interest prediction in social networks based on Markov chain modeling on clustered users publication-title: Concurrency Computat Pract Exper – year: 2016 – volume: 4 start-page: 1123 issue: 11 year: 2011 end-page: 1134 article-title: Scalable SPARQL querying of large RDF graphs publication-title: Proc VLDB Endow – year: 2014 – year: 2015 – volume: 34 start-page: 825 issue: 5 year: 2011 end-page: 835 article-title: KREAG: keyword query approach over RDF data based on entity‐triple association graph publication-title: Chin J Comput – volume: 30 start-page: 20 issue: 1 year: 2015 end-page: 29 article-title: Bipartite‐oriented distributed graph partitioning for big learning publication-title: J Comput Sci Technol – year: 2010 – ident: e_1_2_8_20_1 – ident: e_1_2_8_24_1 doi: 10.1007/s11390-015-1501-x – ident: e_1_2_8_11_1 doi: 10.3724/SP.J.1016.2011.00825 – ident: e_1_2_8_15_1 doi: 10.1016/j.datak.2011.11.004 – ident: e_1_2_8_30_1 doi: 10.1109/ICPADS.2016.0069 – ident: e_1_2_8_16_1 doi: 10.1007/978-3-319-27161-3_7 – ident: e_1_2_8_32_1 – ident: e_1_2_8_19_1 doi: 10.1109/ICDE.2015.7113334 – ident: e_1_2_8_7_1 doi: 10.1109/ICBDA.2016.7509797 – ident: e_1_2_8_3_1 doi: 10.1002/cpe.3572 – start-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‐5, 2014, Proceedings year: 2016 ident: e_1_2_8_28_1 – ident: e_1_2_8_21_1 – volume: 36 start-page: 2625 issue: 12 year: 2015 ident: e_1_2_8_17_1 article-title: Research on large‐scale RDF data query method based on graph clustering publication-title: J Chin Comput Syst – volume: 6 start-page: 1222 year: 2013 ident: e_1_2_8_2_1 article-title: Survey of RDF query processing techniques publication-title: J Softw – volume: 29 start-page: 417 issue: 5 year: 2016 ident: e_1_2_8_5_1 article-title: Distributed parallel reasoning algorithm with rete for RDF data publication-title: Pattern Recognit Artif Intell – volume: 31 start-page: 119 issue: 1 year: 2010 ident: e_1_2_8_6_1 article-title: Minimum Steiner tree based method to keyword search publication-title: J Chin Comput Syst – ident: e_1_2_8_9_1 doi: 10.1109/BigData.2015.7363833 – ident: e_1_2_8_29_1 doi: 10.1109/IPDPS.2015.18 – ident: e_1_2_8_25_1 doi: 10.1007/s11704-015-4104-3 – ident: e_1_2_8_8_1 – volume: 36 start-page: 117 issue: 4 year: 2018 ident: e_1_2_8_14_1 article-title: Data classification method of fuzzy weighted k‐nearest neighbor based on affinity publication-title: J Appl Sci – ident: e_1_2_8_18_1 – ident: e_1_2_8_4_1 doi: 10.1007/s11227-016-1766-z – volume: 36 start-page: 118 issue: 3 year: 2018 ident: e_1_2_8_12_1 article-title: HKM clustering algorithm design and research based on Hadoop platform publication-title: J Appl Sci – ident: e_1_2_8_22_1 doi: 10.14778/3402707.3402747 – ident: e_1_2_8_26_1 doi: 10.1109/ICDE.2014.6816682 – issue: 6 year: 2016 ident: e_1_2_8_13_1 article-title: Fast topology discovery for campus network publication-title: J Appl Sci – ident: e_1_2_8_31_1 doi: 10.1109/FSKD.2010.5569309 – ident: e_1_2_8_10_1 doi: 10.1145/2723372.2749447 – start-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‐5, 2014, Proceedings year: 2014 ident: e_1_2_8_23_1 doi: 10.1007/978-3-662-43352-2_15 – ident: e_1_2_8_27_1 doi: 10.1109/HPCC-CSS-ICESS.2015.190
SSID	ssj0011031
Score	2.2714834
Snippet	Summary 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... 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...
SourceID	proquest crossref wiley
SourceType	Aggregation Database Enrichment Source Index Database Publisher
SubjectTerms	Algorithms edge partitioning Graph theory minimum degree vertex parallel query Partitioning RDF graph RDF sentence graph Segmentation vertex cut set
Title	Research on partitioning algorithm based on RDF graph
URI	https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.5612 https://www.proquest.com/docview/2509259396
Volume	33
WOSCitedRecordID	wos000501116000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: DRFUL dateStart: 20010101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7o5sGL8ydOp0QQPdWlWdYkR9lWPIwxhoPdSpKmOpjd2KZ_v0l_bAoKgqce-gLl9b1-7yWv3wdwq5kkUsfUawct26Awd0jIjfa4pEooTjnOVUv6bDDgk4kYFlOV7l-YnB9is-HmMiP7XrsEl2rV3JKG6oV5cNKOu1AlNmxpBardUTjub84QnIBBzpZKPGzr9pJ6FpNmufY7GG0rzK91agY0Ye0_j3gIB0V5iR7zeDiCHZMeQ62UbkBFJp9Au5y4Q_MULVz4FBuzSM5e5svp-vUNOYCL3f1RN0QZsfUpjMPec-fJKxQUPG1hnFi3xzL2lSPZYlhbOPYD1WKCC4xjpilRKpFScW6kYBbMk4T5icCaBjIQibCeO4NKOk_NOaCWUL4hJhA-D6j0tSQxj5XtlphQOElkHe5LV0a6oBd3KhezKCdGJpH1RuS8UYebjeUip9T4waZRvo2oSKpVZKs1Ybu1lgjqcJf5_df1UWfYc9eLvxpewj5x0yqYeqTdgMp6-W6uYE9_rKer5XURWp9V0c_u
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7oJuiL84rTqRVEn-rSrG0SfJJtZWIdY2ywt5KkrQ5mN7bp7zfpZVNQEHzqQ0-gfD2n55L0-wCuJeGYy9A2HbehGhSiNwlpJE3KbcEEtSnKVEt80u3S0Yj1NuC--Bcm44dYDdx0ZKTfax3geiBdX7OGyll0p7UdN6FsKy9ySlBu9b2hv9pE0AoGGV0qNpEq3AvuWYTrxdrv2WhdYn4tVNNM41X-9Yx7sJsXmMZD5hH7sBElB1ApxBuMPJYPwSnO3BnTxJhpB8pHswafvEzn4-Xrm6FTXKjv91uekVJbH8HQaw-aHTPXUDClSuRYAR_y0BKaZosgqRKy5YoGYZQhFBJpYyFizgWlEWdEpfM4JlbMkLRd7rKYKeiOoZRMk-gEjAYTVoQjl1nUtbklOQ5pKFS_RJhAccyrcFtgGcicYFzrXEyCjBoZBwqNQKNRhauV5Swj1fjBpla8jiAPq0Wg6jWm-rUGc6twkwL_6_qg2Wvr6-lfDS9huzN49gP_sft0BjtYn11BtomdGpSW8_foHLbkx3K8mF_kfvYJ1t_T3g
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dS8MwFL3MTcQX5ydOp1YQfapL048k-CTbiuIYYzjYW0nSVAdzG9v095v0Y1NQEHzqQ2-gnOb23Juk5wBcScIxl7Fn-4GrGxRiNgmpkjblnmCCehRlriUd0u3S4ZD1SnBX_AuT6UOsFtxMZqTfa5PgahYnjbVqqJypW-PtuAEVz2eBzspKqx8OOqtNBONgkMmlYhvpwr3QnkW4UYz9zkbrEvNroZoyTVj91zPuwk5eYFr32YzYg5Ka7EO1MG-w8lw-AL84c2dNJ9bMTKB8adbi45fpfLR8fbMMxcXmfr8VWqm09SEMwvZz88HOPRRsqYkca-BjHjvCyGwRJDUhO4FwCaMMoZhIDwuRcC4oVZwRTedJQpyEIekFPGAJ09AdQXkynahjsFwmHIVVwBwaeNyRHMc0FrpfIkygJOE1uCmwjGQuMG58LsZRJo2MI41GZNCoweUqcpaJavwQUy9eR5Sn1SLS9RrT_ZrLghpcp8D_Oj5q9trmevLXwAvY6rXCqPPYfTqFbWyOriDPxn4dysv5uzqDTfmxHC3m5_k0-wSiJtNZ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Research+on+partitioning+algorithm+based+on+RDF+graph&rft.jtitle=Concurrency+and+computation&rft.au=Zhi%E2%80%90yun+Zheng&rft.au=Chen%E2%80%90yu+Wang&rft.au=Ding%2C+Yang&rft.au=Li%2C+Lun&rft.date=2021-04-25&rft.pub=Wiley+Subscription+Services%2C+Inc&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=33&rft.issue=8&rft_id=info:doi/10.1002%2Fcpe.5612&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon