{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:46:57Z","timestamp":1725565617799},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156830"},{"type":"electronic","value":"9783642156847"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15684-7_3","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T02:16:37Z","timestamp":1284516997000},"page":"18-32","source":"Crossref","is-referenced-by-count":1,"title":["Linear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees"],"prefix":"10.1007","author":[{"given":"Nils","family":"Grimsmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Truls Amundsen","family":"Bj\u00f8rklund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus Lie","family":"Hetland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ba\u010da, R., Kr\u00e1tk\u00fd, M., Sn\u00e1\u0161el, V.: On the efficient search of an XML twig query in large DataGuide trees. In: Proc. IDEAS (2008)","DOI":"10.1145\/1451940.1451962"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: Proc. SIGMOD (2003)","DOI":"10.1145\/872757.872776"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-44585-4_8","volume-title":"Computer Aided Verification","author":"A. Dovier","year":"2001","unstructured":"Dovier, A., Piazza, C., Policriti, A.: A fast bisimulation algorithm. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, p. 79. Springer, Heidelberg (2001)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Fernandez, J.-C.: An implementation of an efficient algorithm for bisimulation equivalence. Sci. Comput. Program.\u00a013(2-3) (1990)","DOI":"10.1016\/0167-6423(90)90071-K"},{"key":"3_CR5","unstructured":"Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: Proc. VLDB (1997)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Gou, G., Chirkova, R.: Efficiently querying large XML data repositories: A survey. Knowl. and Data Eng. (2007)","DOI":"10.1109\/TKDE.2007.1060"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Grimsmo, N., Bj\u00f8rklund, T.A., Hetland, M.L.: Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees (extended version). Technical Report IDI-TR-2010-10, NTNU, Trondheim, Norway (2010)","DOI":"10.1007\/978-3-642-15684-7_3"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. FOCS (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: Proc. SIGMOD (2002)","DOI":"10.1145\/564691.564707"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Shenoy, P.: Updates for structure indexes. In: Proc. VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50029-9"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: Proc. ICDE (2002)","DOI":"10.1109\/ICDE.2002.994703"},{"key":"3_CR12","unstructured":"Liu, X., Li, J., Wang, H.: SAM: An efficient algorithm for F&B-index construction. In: Proc. APWeb\/WAIM (2007)"},{"key":"3_CR13","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Englewood Cliffs (1989)"},{"key":"3_CR14","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\u201999","author":"T. Milo","year":"1998","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. (1987)","DOI":"10.1137\/0216062"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Saha, D.: An incremental bisimulation algorithm. In: Proc. FSTTCS (2007)","DOI":"10.1007\/978-3-540-77050-3_17"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Wu, X., Liu, G.: XML twig pattern matching using version tree. Data & Knowl. Eng. (2008)","DOI":"10.1016\/j.datak.2007.09.013"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Yang, B., Fontoura, M., Shekita, E., Rajagopalan, S., Beyer, K.: Virtual cursors for XML joins. In: Proc. CIKM (2004)","DOI":"10.1145\/1031171.1031271"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Yi, K., He, H., Stanoi, I., Yang, J.: Incremental maintenance of XML structural indexes. In: Proc. SIGMOD (2004)","DOI":"10.1145\/1007568.1007624"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Cheng, J.: Graph reachability queries: A survey. In: Managing and Mining Graph Data (2010)","DOI":"10.1007\/978-1-4419-6045-0_6"}],"container-title":["Lecture Notes in Computer Science","Database and XML Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15684-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T15:41:01Z","timestamp":1559662861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15684-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156830","9783642156847"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15684-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}