{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:30:24Z","timestamp":1743096624152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031217555"},{"type":"electronic","value":"9783031217562"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21756-2_29","type":"book-chapter","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T04:39:27Z","timestamp":1670301567000},"page":"377-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Efficient Data Access Through Multiple Relationship in\u00a0Graph-Structured Digital Archives"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3379-8720","authenticated-orcid":false,"given":"Kazuma","family":"Kusu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3041-4330","authenticated-orcid":false,"given":"Takahiro","family":"Komamizu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7079-8247","authenticated-orcid":false,"given":"Kenji","family":"Hatano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","unstructured":"Angles, R., et al.: G-CORE: a core for future graph query languages. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD 2018, pp. 1421\u20131432. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3190654","DOI":"10.1145\/3183713.3190654"},{"key":"29_CR2","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L., P\u00f3sfai, M.: Network Science. University Press, Cambridge (2016)"},{"key":"29_CR3","volume-title":"Linked: The New Science of Networks Science of Networks","author":"AL Barab\u00e1si","year":"2002","unstructured":"Barab\u00e1si, A.L., Frangos, J.: Linked: The New Science of Networks Science of Networks. Perseus Books Group, New York (2002)"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1177\/0165551520930951","volume":"48","author":"G Candela","year":"2022","unstructured":"Candela, G., Escobar, P., Carrasco, R.C., Marco-Such, M.: Evaluating the quality of linked open data in digital libraries. J. Inf. Sci. 48(1), 21\u201343 (2022). https:\/\/doi.org\/10.1177\/0165551520930951","journal-title":"J. Inf. Sci."},{"key":"29_CR5","unstructured":"DB-Engines: Ranking of Graph DBMS. https:\/\/db-engines.com\/en\/ranking\/graph+dbms. Accessed 8 Aug 2022"},{"key":"29_CR6","doi-asserted-by":"publisher","unstructured":"Erling, O., et al.: The LDBC social network benchmark: interactive workload. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD 2015, pp. 619\u2013630. ACM (2015). https:\/\/doi.org\/10.1145\/2723372.2742786","DOI":"10.1145\/2723372.2742786"},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"Francis, N., et al.: Cypher: an evolving query language for property graphs. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD 2018, pp. 1433\u20131445. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3190657","DOI":"10.1145\/3183713.3190657"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-91669-5_24","volume-title":"Towards Open and Trustworthy Digital Societies","author":"M Haris","year":"2021","unstructured":"Haris, M., Farfar, K.E., Stocker, M., Auer, S.: Federating scholarly infrastructures with GraphQL. In: Ke, H.-R., Lee, C.S., Sugiyama, K. (eds.) ICADL 2021. LNCS, vol. 13133, pp. 308\u2013324. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91669-5_24"},{"issue":"4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447772","volume":"54","author":"A Hogan","year":"2021","unstructured":"Hogan, A., et al.: Knowledge graphs. ACM Comput. Surv. 54(4), 1\u201337 (2021). https:\/\/doi.org\/10.1145\/3447772","journal-title":"ACM Comput. Surv."},{"key":"29_CR10","doi-asserted-by":"publisher","unstructured":"Kusu, K., Hatano, K.: A hub-based graph management for efficient repetition path traversing. In: 2021 IEEE International Conference on Big Data and Smart Computing (BigComp), pp. 188\u2013191. IEEE (2021). https:\/\/doi.org\/10.1109\/BigComp51126.2021.00043","DOI":"10.1109\/BigComp51126.2021.00043"},{"key":"29_CR11","unstructured":"LDBC: ldbc\/ldbc_snb_datagen.git. https:\/\/github.com\/ldbc\/ldbc_snb_datagen. Accessed 8 Aug 2022"},{"key":"29_CR12","unstructured":"LDBC: LDBC\u2019s HP. http:\/\/ldbcouncil.org\/. Accessed 8 Aug 2022"},{"key":"29_CR13","unstructured":"LDBC: ldbc_snb_implementations.git. https:\/\/github.com\/ldbc\/ldbc_snb_implementations. Accessed 8 Aug 2022"},{"issue":"4","key":"29_CR14","doi-asserted-by":"publisher","first-page":"390","DOI":"10.14778\/3297753.3297759","volume":"12","author":"M Lissandrini","year":"2018","unstructured":"Lissandrini, M., Brugnara, M., Velegrakis, Y.: Beyond macrobenchmarks: microbenchmark-based graph database evaluation. Proc. VLDB Endow. 12(4), 390\u2013403 (2018). https:\/\/doi.org\/10.14778\/3297753.3297759","journal-title":"Proc. VLDB Endow."},{"key":"29_CR15","unstructured":"Neo4j Inc: Neo4j\u2019s HP. https:\/\/neo4j.com\/. Accessed 8 Aug 2022"},{"key":"29_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Pareto, V.F.D.: La courbe des revenus. In: Cours d\u2019\u00c8conomie Politique, vol. $$\\rm (II)$$, chap. $$\\rm (\\, I\\,)$$, pp. 299\u2013345. Librairie Droz (1964)","DOI":"10.3917\/droz.paret.1964.01"},{"key":"29_CR18","doi-asserted-by":"publisher","unstructured":"van Rest, O., Hong, S., Kim, J., Meng, X., Chafi, H.: PGQL: a property graph query language. In: Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems, GRADES 2016, pp. 1\u20136. ACM (2016). https:\/\/doi.org\/10.1145\/2960414.2960421","DOI":"10.1145\/2960414.2960421"},{"key":"29_CR19","unstructured":"Robinson, I., Webber, J., Eifrem, E.: Graph Databases. O\u2019Reilly Media, Inc., Sebastopol (2015)"},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Rodriguez, M.A., Neubauer, P.: The graph traversal pattern. In: Sakr, S., Pardede, E. (eds.) Graph Data Management: Techniques and Applications, chap. 2, pp. 29\u201346. IGI Global (2012). https:\/\/doi.org\/10.4018\/978-1-61350-053-8.ch002","DOI":"10.4018\/978-1-61350-053-8.ch002"},{"key":"29_CR21","doi-asserted-by":"publisher","unstructured":"Sakr, S., Al-Naymat, G.: The overview of graph indexing and querying techniques. In: Sakr, S., Pardede, E. (eds.) Graph Data Management: Techniques and Applications, chap. 4, pp. 71\u201388. IGI Global (2012). https:\/\/doi.org\/10.4018\/978-1-61350-053-8.ch004","DOI":"10.4018\/978-1-61350-053-8.ch004"},{"key":"29_CR22","volume-title":"Graph Data Management: Techniques and Applications","author":"S Sakr","year":"2011","unstructured":"Sakr, S., Pardede, E.: Graph Data Management: Techniques and Applications. IGI Global, Hershey (2011)"},{"key":"29_CR23","unstructured":"Seaborne, A.: SPARQL 1.1 Property Paths. World Wide Web Consortium (W3C). https:\/\/www.w3.org\/TR\/sparql11-property-paths\/"},{"key":"29_CR24","unstructured":"THE GQL MANIFESTO: GQL Is Now a Global Standards Project alongside SQL. https:\/\/gql.today\/. Accessed 8 Aug 2022"}],"container-title":["Lecture Notes in Computer Science","From Born-Physical to Born-Virtual: Augmenting Intelligence in Digital Libraries"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21756-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T04:49:23Z","timestamp":1670302163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21756-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031217555","9783031217562"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21756-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Asian Digital Libraries","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icadl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"14","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":"18","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":"18% - 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.08","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.07","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}