{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:57:40Z","timestamp":1743098260153,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319635576"},{"type":"electronic","value":"9783319635583"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63558-3_47","type":"book-chapter","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T10:03:05Z","timestamp":1500372185000},"page":"552-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Subsumption Between Rooted Labeled Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8742-0152","authenticated-orcid":false,"given":"Olivier","family":"Carloni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,19]]},"reference":[{"key":"47_CR1","series-title":"International Handbooks on Information Systems","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-92673-3_1","volume-title":"Handbook on Ontologies","author":"F Baader","year":"2009","unstructured":"Baader, F., Horrocks, I., Sattler, U.: Description logics. In: Staab, S., Studer, R. (eds.) Handbook on Ontologies. IHIS, pp. 21\u201343. Springer, Heidelberg (2009). doi:10.1007\/978-3-540-92673-3_1"},{"issue":"9","key":"47_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"5","key":"47_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable searching problems. Inf. Process. Lett. 8(5), 244\u2013251 (1979)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002. ACM Press (2002)","key":"47_CR4","DOI":"10.1145\/564691.564727"},{"unstructured":"Eppstein, D.: Are there small machines which can efficiently match regular expressions? (Krishnaswami) (2010). https:\/\/cstheory.stackexchange.com\/questions\/1132\/are-there-small-machines-which-can-efficiently-match-regular-expressions\/1273#1273","key":"47_CR5"},{"issue":"01n02","key":"47_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1142\/S0218195908002568","volume":"18","author":"D Eppstein","year":"2008","unstructured":"Eppstein, D., Goodrich, M.T., Sun, J.Z.: Skip quadtrees: dynamic data structures for multidimensional point sets. Int. J. Comput. Geom. Appl. 18(01n02), 131\u2013160 (2008)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Inform. 4(1), 1\u20139 (1974)","journal-title":"Acta Inform."},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-22256-6_25","volume-title":"Implementation and Application of Automata","author":"T Flouri","year":"2011","unstructured":"Flouri, T., Janou\u0161ek, J., Melichar, B., Iliopoulos, C.S., Pissis, S.P.: Tree template matching in ranked ordered trees by pushdown automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 273\u2013281. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22256-6_25"},{"doi-asserted-by":"crossref","unstructured":"Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008. ACM Press (2008)","key":"47_CR9","DOI":"10.1145\/1376616.1376676"},{"issue":"1","key":"47_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Inform. 1(1), 14\u201325 (1971)","journal-title":"Acta Inform."},{"issue":"128","key":"47_CR11","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.2307\/2005383","volume":"28","author":"MT McClellan","year":"1974","unstructured":"McClellan, M.T., Minker, J., Knuth, D.E.: The art of computer programming, vol. 3: sorting and searching. Math. Comput. 28(128), 1175 (1974)","journal-title":"Math. Comput."},{"issue":"3","key":"47_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1080\/09528139508953815","volume":"7","author":"M-L Mugnier","year":"1995","unstructured":"Mugnier, M.-L.: On generalization\/specialization for conceptual graphs. J. Exp. Theor. Artif. Intell. 7(3), 325\u2013344 (1995)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"2","key":"47_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63558-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:37:16Z","timestamp":1710333436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63558-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319635576","9783319635583"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63558-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2017","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":"ksem2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ksem2017.conferences.academy\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}