{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:38:41Z","timestamp":1742917121188,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251573"},{"type":"electronic","value":"9783031251580"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-25158-0_45","type":"book-chapter","created":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T21:37:20Z","timestamp":1676324240000},"page":"553-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SgIndex: An Index Structure Supporting Multiple Graph Queries"],"prefix":"10.1007","author":[{"given":"Shibiao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhou","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zirui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-38527-8_7","volume-title":"Experimental Algorithms","author":"J Arz","year":"2013","unstructured":"Arz, J., Luxen, D., Sanders, P.: Transit node routing reconsidered. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 55\u201366. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_7"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"issue":"2","key":"45_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721846","volume":"6","author":"PN Klein","year":"2010","unstructured":"Klein, P.N., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: a linear-space o (n log2 n)-time algorithm. ACM Trans. Algorith. (TALG) 6(2), 1\u201318 (2010)","journal-title":"ACM Trans. Algorith. (TALG)"},{"issue":"1","key":"45_CR5","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s11280-019-00714-9","volume":"23","author":"L Li","year":"2020","unstructured":"Li, L., Zhang, F., Zhang, Z., Li, P., Bu, C.: Multi-fuzzy-objective graph pattern matching in big graph environments with reliability, trust and social relationship. World Wide Web 23(1), 649\u2013669 (2020)","journal-title":"World Wide Web"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Li, L., et al.: Bindex: a two-layered index for fast and robust scans. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 909\u2013923 (2020)","DOI":"10.1145\/3318464.3380563"},{"key":"45_CR7","first-page":"2","volume":"11","author":"RH M\u00f6hring","year":"2007","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speedup Dijkstra\u2019s algorithm. J. Exp. Algorith. (JEA) 11, 2\u20138 (2007)","journal-title":"J. Exp. Algorith. (JEA)"},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10589-008-9172-y","volume":"45","author":"G Nannicini","year":"2010","unstructured":"Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1), 143\u2013158 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s algorithm on-line: an empirical case study from public railroad transport. J. Exp. Algorith. (JEA) 5, 12-es (2000)","DOI":"10.1145\/351827.384254"},{"issue":"7","key":"45_CR11","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1109\/TKDE.2015.2405562","volume":"27","author":"J Seo","year":"2015","unstructured":"Seo, J., Guo, S., Lam, M.S.: Socialite: an efficient graph query language based on datalog. IEEE Trans. Knowl. Data Eng. 27(7), 1824\u20131837 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"45_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. (CSUR) 46(4), 1\u201331 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-54832-2_5","volume-title":"Advances in Databases and Information Systems","author":"B Tesfaye","year":"2020","unstructured":"Tesfaye, B., Augsten, N., Pawlik, M., B\u00f6hlen, M.H., Jensen, C.S.: An efficient index for reachability queries in public transport networks. In: Darmont, J., Novikov, B., Wrembel, R. (eds.) ADBIS 2020. LNCS, vol. 12245, pp. 34\u201348. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54832-2_5"},{"issue":"5","key":"45_CR14","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1111\/j.0824-7935.2005.00271.x","volume":"21","author":"H Zhuge","year":"2005","unstructured":"Zhuge, H., Liu, J., Feng, L., Sun, X., He, C.: Query routing in a peer-to-peer semantic link network. Comput. Intell. 21(2), 197\u2013216 (2005)","journal-title":"Comput. Intell."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25158-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T19:11:25Z","timestamp":1689880285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25158-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251573","9783031251580"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25158-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","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":"Nanjing","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","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":"297","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":"75","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":"45","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":"25% - 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":"5","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":"5 Demo papers + 23 workshop papers","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)"}}]}}