{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:54:00Z","timestamp":1743094440212,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819615476"},{"type":"electronic","value":"9789819615483"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1548-3_13","type":"book-chapter","created":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T09:15:25Z","timestamp":1739697325000},"page":"192-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CIGraph: Accelerating Graph Queries over\u00a0Database with\u00a0Compressed Index"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0180-9381","authenticated-orcid":false,"given":"Zhen","family":"Lv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6192-1877","authenticated-orcid":false,"given":"Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3743-5249","authenticated-orcid":false,"given":"Yingfan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7438-4535","authenticated-orcid":false,"given":"Kankan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3210-0714","authenticated-orcid":false,"given":"Yanguo","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Besta, M., et al.: Demystifying graph databases: analysis and taxonomy of data organization, system designs, and graph queries. ACM Comput. Surv. 56(2) (2023)","DOI":"10.1145\/3604932"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-11918-2_8","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2014","unstructured":"Brisaboa, N.R., Caro, D., Fari\u00f1a, A., Rodr\u00edguez, M.A.: A compressed suffix-array strategy for temporal-graph indexing. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 77\u201388. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11918-2_8"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-89097-3_18","volume-title":"String Processing and Information Retrieval","author":"F Claude","year":"2008","unstructured":"Claude, F., Navarro, G.: Practical rank\/select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176\u2013187. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89097-3_18"},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2019.101736","volume":"126","author":"S Das","year":"2020","unstructured":"Das, S., Santra, A., Bodra, J., Chakravarthy, S.: Query processing on large graphs: approaches to scalability and response time trade offs. Data Knowl. Eng. 126, 101736 (2020)","journal-title":"Data Knowl. Eng."},{"key":"13_CR5","doi-asserted-by":"crossref","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, pp. 619\u2013630 (2015)","DOI":"10.1145\/2723372.2742786"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Heidari, S., Simmhan, Y., Calheiros, R.N., Buyya, R.: Scalable graph processing frameworks: a taxonomy and open challenges. ACM Comput. Surv. 51(3) (2018)","DOI":"10.1145\/3199523"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"2943","DOI":"10.1109\/TKDE.2021.3114401","volume":"35","author":"H Huo","year":"2023","unstructured":"Huo, H., Long, P., Vitter, J.S.: Practical high-order entropy-compressed text self-indexing. IEEE Trans. Knowl. Data Eng. 35(3), 2943\u20132960 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"3566","DOI":"10.1109\/TEM.2023.3348991","volume":"71","author":"K Jin","year":"2024","unstructured":"Jin, K., Zhong, Z.Z., Zhao, E.Y.: Sustainable digital marketing under big data: an AI random forest model approach. IEEE Trans. Eng. Manag. 71, 3566\u20133579 (2024)","journal-title":"IEEE Trans. Eng. Manag."},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-030-00479-8_22","volume-title":"String Processing and Information Retrieval","author":"Z Li","year":"2018","unstructured":"Li, Z., Li, J., Huo, H.: Optimal in-place suffix sorting. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 268\u2013284. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_22"},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1007\/s11390-010-9402-5","volume":"25","author":"S Sakr","year":"2010","unstructured":"Sakr, S., Al-Naymat, G.: Efficient relational techniques for processing graph queries. J. Comput. Sci. Technol. 25(6), 1237\u20131255 (2010)","journal-title":"J. Comput. Sci. Technol."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, SIGMOD 2007, pp. 845\u2013856. Association for Computing Machinery, New York (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, Q., et al.: Optimizing declarative graph queries at large scale. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD 2019, pp. 1411\u20131428. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3299869.3300064"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. Proc. VLDB Endow. 3(1\u20132), 340\u2013351 (2010)","DOI":"10.14778\/1920841.1920887"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1548-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T09:15:40Z","timestamp":1739697340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1548-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819615476","9789819615483"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1548-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2024","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":"ica3pp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ica3pp2024.scimeeting.cn\/en\/web\/index\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}