{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:22:54Z","timestamp":1743121374333,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811604782"},{"type":"electronic","value":"9789811604799"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-0479-9_10","type":"book-chapter","created":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T05:02:42Z","timestamp":1617166962000},"page":"116-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Storage and Query for Domain Knowledge Graphs"],"prefix":"10.1007","author":[{"given":"Xiaohuan","family":"Shan","sequence":"first","affiliation":[]},{"given":"Xiyi","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Wenyuan","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Junlu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.future.2020.02.011","volume":"107","author":"H Xin","year":"2020","unstructured":"Xin, H., Jiangli, D., Jiangli, D.: Scalable aggregate keyword query over knowledge graph. Future Gener. Comput. Syst. 107, 588\u2013600 (2020)","journal-title":"Future Gener. Comput. Syst."},{"issue":"11","key":"10_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.3390\/ijgi8110496","volume":"8","author":"W Li","year":"2019","unstructured":"Li, W., Song, M., Tian, Y.: An ontology-driven cyberinfrastructure for intelligent spatiotemporal question answering and open knowledge discovery. ISPRS Int. J. Geo-Inf. 8(11), 496 (2019)","journal-title":"ISPRS Int. J. Geo-Inf."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"108821","DOI":"10.1109\/ACCESS.2020.2993727","volume":"8","author":"A Barnawi","year":"2020","unstructured":"Barnawi, A., Alharbi, M., Chen, M.: Intelligent search and find system for robotic platform based on smart edge computing service. IEEE Access 8, 108821\u2013108834 (2020)","journal-title":"IEEE Access"},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.3390\/info11050253","volume":"11","author":"A Fensel","year":"2020","unstructured":"Fensel, A., Akbar, Z., K\u00e4rle, E., et al.: Knowledge graphs for online marketing and sales of touristic services. Information 11(5), 253 (2020)","journal-title":"Information"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s12859-019-3296-1","volume":"21","author":"RT Sousa","year":"2020","unstructured":"Sousa, R.T., Silva, S., Pesquita, C.: Evolving knowledge graph similarity for supervised learning in complex biomedical domains. BMC Bioinform. 21(1), 6 (2020)","journal-title":"BMC Bioinform."},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10660-019-09392-1","volume":"20","author":"L Yuan","year":"2020","unstructured":"Yuan, L., Huang, Z., Zhao, W., et al.: Interpreting and predicting social commerce intention based on knowledge graph analysis. Electron. Commer. Res. 20(1), 197\u2013222 (2020)","journal-title":"Electron. Commer. Res."},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1002\/int.22224","volume":"35","author":"T Fan","year":"2020","unstructured":"Fan, T., Yan, L., Ma, Z.: Storing and querying fuzzy RDF(S) in HBase databases. Int. J. Intell. Syst. 35(4), 751\u2013780 (2020)","journal-title":"Int. J. Intell. Syst."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.cie.2019.03.022","volume":"130","author":"Z Zhu","year":"2019","unstructured":"Zhu, Z., Zhou, X., Shao, K.: A novel approach based on Neo4j for multi-constrained flexible job shop scheduling problem. Comput. Ind. Eng. 130, 671\u2013686 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Fernandes, D., Bernardino, J.: Graph databases comparison: AllegroGraph, ArangoDB, InfiniteGraph, Neo4J, and OrientDB. In: DATA 2018, pp. 373\u2013380 (2018)","DOI":"10.5220\/0006910203730380"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10619-019-07256-z","volume":"38","author":"NM Soudani","year":"2019","unstructured":"Soudani, N.M., Fatemi, A., Nematbakhsh, M.: An investigation of big graph partitioning methods for distribution of graphs in vertex-centric systems. Distrib. Parallel Databases 38(1), 1\u201329 (2019)","journal-title":"Distrib. Parallel Databases"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Filippidou, I., Kotid, Y.: Online partitioning of multi-labeled graphs. In: Proceedings of the GRADES 2015, pp. 1\u20136. ACM (2015)","DOI":"10.1145\/2764947.2764950"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Lotfifar, F., Johnson, M.: A serial multilevel hypergraph partitioning algorithm. Comput. Res. Repository (2016)","DOI":"10.1007\/978-3-662-48096-0_13"},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TEVC.2019.2896951","volume":"23","author":"RJ Preen","year":"2019","unstructured":"Preen, R.J., Smith, J.: Evolutionary n-level hypergraph partitioning with adaptive coarsening. IEEE Trans. Evol. Comput. 23(6), 962\u2013971 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., et al.: JA-BE-JA: a distributed algorithm for balanced graph partitioning. In: IEEE International Conference on Self-adaptive & Self-organizing Systems, pp. 51\u201360. IEEE (2013)","DOI":"10.1109\/SASO.2013.13"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-662-48096-0_27","volume-title":"Euro-Par 2015: Parallel Processing","author":"A Guerrieri","year":"2015","unstructured":"Guerrieri, A., Montresor, A.: DFEP: distributed funding-based edge partitioning. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 346\u2013358. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_27"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Thorup, M., Zadimoghaddam, M.: Consistent hashing with bounded loads. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 587\u2013604 (2018)","DOI":"10.1137\/1.9781611975031.39"}],"container-title":["Communications in Computer and Information Science","Web and Big Data. APWeb-WAIM 2020 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-0479-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T23:52:22Z","timestamp":1671753142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-0479-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811604782","9789811604799"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-0479-9_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/apwebwaim2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"259","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was organized as a fully online conference.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}