{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T18:10:47Z","timestamp":1765303847785,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031001284"},{"type":"electronic","value":"9783031001291"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00129-1_37","type":"book-chapter","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T14:23:55Z","timestamp":1650637435000},"page":"430-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["SQLG+: Efficient k-hop Query Processing on\u00a0RDBMS"],"prefix":"10.1007","author":[{"given":"Li","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Jinhua","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Shijun","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Haoran","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Rongqian","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"issue":"1","key":"37_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W Aiello","year":"2001","unstructured":"Aiello, W., Graham, F.C., Lu, L.: A random graph model for power law graphs. Exp. Math. 10(1), 53\u201366 (2001)","journal-title":"Exp. Math."},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-11964-9_13","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"G Alu\u00e7","year":"2014","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 197\u2013212. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11964-9_13"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovic, K., Patterson, D.A.: Direction-optimizing breadth-first search. In: SC (2012)","DOI":"10.1109\/SC.2012.50"},{"issue":"11","key":"37_CR4","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.14778\/2350229.2350247","volume":"5","author":"J Cheng","year":"2012","unstructured":"Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: K-reach: who is in your small world. Proc. VLDB Endow. 5(11), 1292\u20131303 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"37_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s41019-019-00110-3","volume":"4","author":"Y Cheng","year":"2019","unstructured":"Cheng, Y., Ding, P., et al.: Which category is better: benchmarking relational and graph database management systems. Data Sci. Eng. 4(4), 309\u2013322 (2019)","journal-title":"Data Sci. Eng."},{"key":"37_CR6","unstructured":"Create Link co., L.: Galaxybase: a high-performance graph database (2016). https:\/\/www.galaxybase.com\/"},{"key":"37_CR7","unstructured":"Deutsch, A., Yu, X., Wu, M., Lee, V.: Tigergraph: a native MPP graph database. arXiv (2019)"},{"issue":"1","key":"37_CR8","first-page":"3","volume":"35","author":"O Erling","year":"2012","unstructured":"Erling, O.: Virtuoso, a hybrid RDBMS\/Graph column store. IEEE Data Eng. Bull. 35(1), 3\u20138 (2012)","journal-title":"IEEE Data Eng. Bull."},{"issue":"12","key":"37_CR9","doi-asserted-by":"publisher","first-page":"2879","DOI":"10.14778\/3476311.3476369","volume":"14","author":"W Fan","year":"2021","unstructured":"Fan, W., He, T., et al.: GraphScope: a unified engine for big graph processing. Proc. VLDB Endow. 14(12), 2879\u20132892 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-23397-5_42","volume-title":"Euro-Par 2011 Parallel Processing","author":"J Jenkins","year":"2011","unstructured":"Jenkins, J., Arkatkar, I., Owens, J.D., Choudhary, A., Samatova, N.F.: Lessons learned from exploring the backtracking paradigm on the GPU. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011. LNCS, vol. 6853, pp. 425\u2013437. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23397-5_42"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-HOP: a high-compression indexing scheme for reachability query. In: \u00c7etintemel, U., Zdonik, S.B., Kossmann, D., Tatbul, N. (eds.) SIGMOD, pp. 813\u2013826. ACM (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.B.: What is Twitter, a social network or a news media? In: WWW, pp. 591\u2013600. ACM (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Lehmann, J., et al.: Dbpedia\u2014a large-scale, multilingual knowledge base extracted from wikipedia. Semantic Web (2015)","DOI":"10.3233\/SW-140134"},{"key":"37_CR14","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Liu, H., Huang, H.H.: Enterprise: breadth-first graph traversal on GPUs. In: SC (2015)","DOI":"10.1145\/2807591.2807594"},{"issue":"6","key":"37_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/MIC.2002.1067737","volume":"6","author":"B McBride","year":"2002","unstructured":"McBride, B.: Jena: a semantic web toolkit. IEEE Internet Comput. 6(6), 55\u201359 (2002)","journal-title":"IEEE Internet Comput."},{"issue":"7","key":"37_CR17","doi-asserted-by":"publisher","first-page":"3041","DOI":"10.1007\/978-3-319-70139-4_3","volume":"12","author":"T Meng","year":"2018","unstructured":"Meng, T., Cai, L., He, T., Chen, L., Deng, Z.: K-hop community search based on local distance dynamics. KSII Trans. Internet Inf. Syst. 12(7), 3041\u20133063 (2018). https:\/\/doi.org\/10.1007\/978-3-319-70139-4_3","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Mi, Z., Yang, Y.: Connectivity restorability of mobile ad hoc sensor network based on k-hop neighbor information. In: ICC, pp. 1\u20135. IEEE (2011)","DOI":"10.1109\/icc.2011.5962715"},{"key":"37_CR19","unstructured":"Qian, Z., Min, C., et al.: GAIA: a system for interactive analysis on distributed graphs using a high-level language. In: NSDI, pp. 321\u2013335. USENIX Association (2021)"},{"issue":"4","key":"37_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/71.219757","volume":"4","author":"VN Rao","year":"1993","unstructured":"Rao, V.N., Kumar, V.: On the efficiency of parallel backtracking. IEEE Trans. Parallel Distrib. Syst. 4(4), 427\u2013437 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Umuroglu, Y., Morrison, D., Jahre, M.: Hybrid breadth-first search on a single-chip FPGA-CPU heterogeneous platform. In: FPL, pp. 1\u20138. IEEE (2015)","DOI":"10.1109\/FPL.2015.7293939"},{"key":"37_CR22","unstructured":"Zeng, L., Jiang, Y., Lu, W., Zou, L.: Deep analysis on subgraph isomorphism. arXiv (2020)"},{"issue":"4","key":"37_CR23","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s11704-018-7212-z","volume":"12","author":"Li Zeng","year":"2018","unstructured":"Zeng, Li., Zou, Lei: Redesign of the gStore system. Front. Comput. Sci. 12(4), 623\u2013641 (2018). https:\/\/doi.org\/10.1007\/s11704-018-7212-z","journal-title":"Front. Comput. Sci."},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Zou, L., Mo, J., Chen, L., \u00d6zsu, M.T., Zhao, D.: gStore: answering SPARQL queries via subgraph matching. VLDB (2011)","DOI":"10.14778\/2002974.2002976"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00129-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T09:16:12Z","timestamp":1657617372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00129-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001284","9783031001291"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00129-1_37","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":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","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":"72","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":"76","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":"13% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","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)"}}]}}