{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:42:58Z","timestamp":1742960578452,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031378898"},{"type":"electronic","value":"9783031378904"}],"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-37890-4_4","type":"book-chapter","created":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T21:01:44Z","timestamp":1690059704000},"page":"66-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SubTempora: A Hybrid Approach for\u00a0Optimising Subgraph Searching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8921-398X","authenticated-orcid":false,"given":"Chimi","family":"Wangmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3515-9209","authenticated-orcid":false,"given":"Lena","family":"Wiese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,23]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-16001-1_17","volume-title":"Pattern Recognition in Bioinformatics","author":"V Bonnici","year":"2010","unstructured":"Bonnici, V., Ferro, A., Giugno, R., Pulvirenti, A., Shasha, D.: Enhancing graph database indexing by suffix tree structure. In: Dijkstra, T.M.H., Tsivtsivadze, E., Marchiori, E., Heskes, T. (eds.) PRIB 2010. LNCS, vol. 6282, pp. 195\u2013203. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16001-1_17"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Cheng, J., Ke, Y., Ng, W.: Efficient query processing on graph databases. ACM Trans. Database Syst. 34(1), 2:1\u20132:48 (2009). https:\/\/doi.org\/10.1145\/1508857.1508859","DOI":"10.1145\/1508857.1508859"},{"issue":"10","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"155625","DOI":"10.1109\/ACCESS.2019.2949655","volume":"7","author":"J Fuentes-Sep\u00falveda","year":"2019","unstructured":"Fuentes-Sep\u00falveda, J., Ladra, S.: Energy consumption in compact integer vectors: a study case. IEEE Access 7, 155625\u2013155636 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2949655","journal-title":"IEEE Access"},{"issue":"10","key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0076911","volume":"8","author":"R Giugno","year":"2013","unstructured":"Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: GRAPES: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10), e76911 (2013)","journal-title":"PLoS ONE"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Giugno, R., Shasha, D.E.: GraphGrep: a fast and universal method for querying graphs. In: 16th International Conference on Pattern Recognition, ICPR 2002, Quebec, Canada, 11\u201315 August 2002, pp. 112\u2013115. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/ICPR.2002.1048250","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"4_CR7","unstructured":"Katsarou, F.: Improving the performance and scalability of pattern subgraph queries. Ph.D. thesis, University of Glasgow, UK (2018)"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Katsarou, F., Ntarmos, N., Triantafillou, P.: Hybrid algorithms for subgraph pattern queries in graph databases. In: Nie, J., et al. (eds.) 2017 IEEE International Conference on Big Data (IEEE BigData 2017), Boston, MA, USA, 11\u201314 December 2017, pp. 656\u2013665. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/BigData.2017.8257981","DOI":"10.1109\/BigData.2017.8257981"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Kim, H., Choi, Y., Park, K., Lin, X., Hong, S., Han, W.: Versatile equivalences: speeding up subgraph query processing and subgraph matching. In: Li, G., Li, Z., Idreos, S., Srivastava, D. (eds.) SIGMOD 2021: International Conference on Management of Data, Virtual Event, China, 20\u201325 June 2021, pp. 925\u2013937. ACM (2021). https:\/\/doi.org\/10.1145\/3448016.3457265","DOI":"10.1145\/3448016.3457265"},{"issue":"6","key":"4_CR10","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1002\/spe.2326","volume":"46","author":"D Lemire","year":"2016","unstructured":"Lemire, D., Boytsov, L., Kurz, N.: SIMD compression and the intersection of sorted integers. Softw. Pract. Exp. 46(6), 723\u2013749 (2016). https:\/\/doi.org\/10.1002\/spe.2326","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.datak.2009.08.006","volume":"69","author":"D Lemire","year":"2010","unstructured":"Lemire, D., Kaser, O., Aouiche, K.: Sorting improves word-aligned bitmap indexes. Data Knowl. Eng. 69(1), 3\u201328 (2010). https:\/\/doi.org\/10.1016\/j.datak.2009.08.006","journal-title":"Data Knowl. Eng."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1186\/s12859-021-04129-0","volume":"22","author":"N Licheri","year":"2021","unstructured":"Licheri, N., Bonnici, V., Beccuti, M., Giugno, R.: GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases. BMC Bioinform. 22(1), 209 (2021). https:\/\/doi.org\/10.1186\/s12859-021-04129-0","journal-title":"BMC Bioinform."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Mrzic, A., et al.: Grasping frequent subgraph mining for bioinformatics applications. BioData Min. 11(1), 20:1\u201320:24 (2018)","DOI":"10.1186\/s13040-018-0181-9"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Sun, S., Luo, Q.: Scaling up subgraph query processing with efficient subgraph matching. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, 8\u201311 April 2019, pp. 220\u2013231. IEEE (2019). https:\/\/doi.org\/10.1109\/ICDE.2019.00028","DOI":"10.1109\/ICDE.2019.00028"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Wangmo, C., Wiese, L.: Efficient subgraph indexing for biochemical graphs. In: Cuzzocrea, A., Gusikhin, O., van der Aalst, W.M.P., Hammoudi, S. (eds.) Proceedings of the 11th International Conference on Data Science, Technology and Applications, DATA 2022, Lisbon, Portugal, 11\u201313 July 2022, pp. 533\u2013540. SCITEPRESS (2022). https:\/\/doi.org\/10.5220\/0011350100003269","DOI":"10.5220\/0011350100003269"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Xie, Y., Yu, P.S.: CP-index: on the efficient indexing of large graphs. In: Macdonald, C., Ounis, I., Ruthven, I. (eds.) Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, 24\u201328 October 2011, pp. 1795\u20131804. ACM (2011). https:\/\/doi.org\/10.1145\/2063576.2063835","DOI":"10.1145\/2063576.2063835"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: Weikum, G., K\u00f6nig, A.C., De\u00dfloch, S. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, 13\u201318 June 2004, pp. 335\u2013346. ACM (2004). https:\/\/doi.org\/10.1145\/1007568.1007607","DOI":"10.1145\/1007568.1007607"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00778-012-0284-8","volume":"22","author":"D Yuan","year":"2013","unstructured":"Yuan, D., Mitra, P.: Lindex: a lattice-based index for graph databases. VLDB J. 22(2), 229\u2013252 (2013). https:\/\/doi.org\/10.1007\/s00778-012-0284-8","journal-title":"VLDB J."}],"container-title":["Communications in Computer and Information Science","Data Management Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37890-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T21:02:37Z","timestamp":1690059757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37890-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031378898","9783031378904"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37890-4_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Management Technologies and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"data2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/data.scitevents.org\/?y=2021","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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","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":"12","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":"19","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":"19% - 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","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)"}}]}}