{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:26Z","timestamp":1725489146948},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322808"},{"type":"electronic","value":"9783642322815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32281-5_25","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T12:59:36Z","timestamp":1344862776000},"page":"254-265","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Processing of Updates in Dynamic Graph-Structured XML Data"],"prefix":"10.1007","author":[{"given":"Lizhen","family":"Fu","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"XQuery, \n                    \n                      http:\/\/www.w3.org\/TR\/xquery\/"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/67544.66950","volume-title":"SIGMOD Conference 1989","author":"R. Agrawal","year":"1989","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD Conference 1989, pp. 253\u2013262. ACM Press, New York (1989)"},{"issue":"1","key":"25_CR3","first-page":"478","volume":"1","author":"H. Wang","year":"2008","unstructured":"Wang, H., Li, J., Luo, J., Gao, H.: Hash-basesubgraph query processing method for graph-structured XML documents. PVLDB\u00a01(1), 478\u2013489 (2008)","journal-title":"PVLDB"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/99935.99944","volume":"15","author":"H.V. Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst.\u00a015(4), 558\u2013598 (1990)","journal-title":"ACM Trans. Database Syst."},{"key":"25_CR5","first-page":"937","volume-title":"Proceedings of the 13th Annual ACMSIAM Symposium on Discrete algorithms","author":"E. Cohen","year":"2002","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the 13th Annual ACMSIAM Symposium on Discrete algorithms, pp. 937\u2013946. ACM Press, New York (2002)"},{"key":"25_CR6","first-page":"813","volume-title":"SIGMOD Conference 2009","author":"R. Jin","year":"2009","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-HOP: a high-compression indexing scheme for reachability query. In: SIGMOD Conference 2009, pp. 813\u2013826. ACM Press, New York (2009)"},{"key":"25_CR7","first-page":"913","volume-title":"SIGMOD Conference 2011","author":"S.J. Schaik van","year":"2011","unstructured":"van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD Conference 2011, pp. 913\u2013924. ACM Press, New York (2011)"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00778-006-0021-2","volume":"17","author":"C. Li","year":"2008","unstructured":"Li, C., Ling, T.W., Hu, M.: Efficient updates in dynamic XML data: from binary string to quaternary string. VLDB J\u00a017(3), 573\u2013601 (2008)","journal-title":"VLDB J"},{"key":"25_CR9","first-page":"705","volume-title":"The 19th Int. Conf. on Data Engineering (ICDE 2003)","author":"T. Amagasa","year":"2003","unstructured":"Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: The 19th Int. Conf. on Data Engineering (ICDE 2003), pp. 705\u2013707. IEEE Press, New York (2003)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: A benchmark forXML data management. In: VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50096-2"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, C., et al.: On Supporting Containment Queries in Relational Database Management Systems. In: Proc. of ACM SIGMOD, pp. 425\u2013436 (2001)","DOI":"10.1145\/376284.375722"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32281-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:59:39Z","timestamp":1620129579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32281-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322808","9783642322815"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32281-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}