{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:13:56Z","timestamp":1748751236236,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276526"},{"type":"electronic","value":"9783319276533"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27653-3_17","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T05:21:31Z","timestamp":1450848091000},"page":"171-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents"],"prefix":"10.1007","author":[{"given":"Eli\u0161ka","family":"\u0160est\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Janou\u0161ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"RA Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences. Theoret. Comput. Sci. 78(2), 363\u2013376 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-46093-4_8","volume-title":"Database Programming Languages","author":"P Buneman","year":"2002","unstructured":"Buneman, P., Davidson, S.B., Fan, W., Hara, C., Tan, W.-C.: Reasoning about Keys for XML. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, pp. 133\u2013148. Springer, Heidelberg (2002)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chung, C.-W., Min, J.-K., Shim, K.: Apex: an adaptive path index for xml data. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002, pp. 121\u2013132. ACM, New York (2002)","DOI":"10.1145\/564691.564706"},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"issue":"3\u20134","key":"17_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S1570-8667(03)00029-7","volume":"1","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Melichar, B., Tronicek, Z.: Directed acyclic subsequence graph\u2013Overview. J. Discrete Algorithms 1(3\u20134), 255\u2013280 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR7","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45735-6_6","volume-title":"String Processing and Information Retrieval","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Tron\u00ed\u010dek, Z.: On the size of DASG for multiple texts. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 58\u201364. Springer, Heidelberg (2002)"},{"key":"17_CR9","unstructured":"Goldman, R., Widom, J.: Dataguides: enabling query formulation and optimization in semistructured databases (1997)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: Online construction of subsequence automata for multiple texts. In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000. Proceedings, pp. 146\u2013152 (2000)","DOI":"10.1109\/SPIRE.2000.878190"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-319-09704-6_18","volume-title":"Descriptional Complexity of Formal Systems","author":"J Janou\u0161ek","year":"2014","unstructured":"Janou\u0161ek, J., Melichar, B., Pol\u00e1ch, R., Poliak, M., Tr\u00e1vn\u00ed\u010dek, J.: A full and linear index of a tree for tree patterns. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 198\u2013209. Springer, Heidelberg (2014)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002, pp. 133\u2013144. ACM, New York (2002)","DOI":"10.1145\/564691.564707"},{"key":"17_CR13","unstructured":"Li, Q., Moon, B.: Indexing and querying xml data for regular path expressions. In: Proceedings of the 27th International Conference on Very Large Data Bases, VLDB 2001, pp. 361\u2013370. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"issue":"3","key":"17_CR14","first-page":"402","volume":"48","author":"B Melichar","year":"2012","unstructured":"Melichar, B., Janou\u0161ek, J., Flouri, T.: Arbology: trees and pushdown automata. Kybernetika 48(3), 402\u2013428 (2012)","journal-title":"Kybernetika"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for an xpath fragment. In: Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2002, pp. 65\u201376. ACM, New York (2002)","DOI":"10.1145\/543613.543623"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of xpath. J. ACM 51(1), 2\u201345 (2004)","journal-title":"J. ACM"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT 1999","author":"T Milo","year":"1998","unstructured":"Milo, T.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Mark Pettovello, P., Fotouhi, F.: Mtree: an xml xpath graph index. In: Proceedings of the 2006 ACM Symposium on Applied Computing, SAC 2006, pp. 474\u2013481. ACM, New York (2006)","DOI":"10.1145\/1141277.1141389"},{"key":"17_CR19","unstructured":"Rao, P., Moon, B.: Prix: indexing and querying xml using prufer sequences. In: 20th International Conference on Data Engineering, 2004. Proceedings, pp. 288\u2013299, March 2004"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Tang, N., Yu, J.X., Ozsu, M.T., Wong, K.-F.: Hierarchical indexing approach to support xpath queries. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 1510\u20131512, April 2008","DOI":"10.1109\/ICDE.2008.4497606"},{"key":"17_CR21","unstructured":"\u0160est\u00e1kov\u00e1, E.: Indexing XML documents. Master\u2019s thesis, Czech Technical University in Prague, Faculty of Information Technology, Prague (2015)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Wang, H., Park, S., Fan, W., Yu, P.S.: Vist: a dynamic index method for querying xml data by tree structures. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 110\u2013121. ACM, New York (2003)","DOI":"10.1145\/872757.872774"}],"container-title":["Communications in Computer and Information Science","Languages, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27653-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T22:32:35Z","timestamp":1748730755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27653-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319276526","9783319276533"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27653-3_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}