{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:05Z","timestamp":1725550505171},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309512"},{"type":"electronic","value":"9783540314455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601524_13","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T13:28:15Z","timestamp":1133443695000},"page":"199-216","source":"Crossref","is-referenced-by-count":33,"title":["Efficient Memory Representation of XML Documents"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Busatto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Arion, A., Bonifati, A., Costa, G., D\u2019Aguanno, S., Manolescu, I., Pugliese, A.: XQueC: Pushing queries to compressed XML data. In: Proc. VLDB, pp. 1065\u20131068 (2003)","DOI":"10.1016\/B978-012722442-8\/50106-3"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Buneman, P., Choi, B., Fan, W., Hutchison, R., Mann, R., Viglas, S.: Vectorizing and querying large XML repositories. To appear in Proc. ICDE (2005)","DOI":"10.1109\/ICDE.2005.150"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Proc. VLDB, pp. 141\u2013152 (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"13_CR4","first-page":"792","volume-title":"Proc. STOC 2002","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., et al.: Approximating the smallest grammar: Kolmogorov complexity in natural models. In: Proc. STOC 2002, pp. 792\u2013801. ACM Press, New York (2002)"},{"key":"13_CR5","first-page":"428","volume-title":"Proc. DCC 1996","author":"S. Chen","year":"1996","unstructured":"Chen, S., Reif, J.H.: Efficient lossless compression of trees and graphs. In: Proc. DCC 1996, p. 428. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"13_CR6","unstructured":"Cheney, J.R.: First-order term compression: techniques and applications. Master\u2019s thesis, Carnegie Mellon University (August 1998)"},{"key":"13_CR7","unstructured":"Cheney, J.R.: Personal communication (2004)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-24741-8_14","volume-title":"Advances in Database Technology - EDBT 2004","author":"J. Cheng","year":"2004","unstructured":"Cheng, J., Ng, W.: XQzip: Querying compressed XML using structural indexing. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 219\u2013236. Springer, Heidelberg (2004)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Fernandez, M.F., Sim\u00e9on, J., Choi, B., Marian, A., Sur, G.: Implementing xquery 1.0: The galax experience. In: Proc. VLDB, pp. 1077\u20131080 (2003)","DOI":"10.1016\/B978-012722442-8\/50109-9"},{"key":"13_CR10","first-page":"188","volume-title":"Proc. LICS","author":"M. Frick","year":"2003","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: Proc. LICS, pp. 188\u2013197. IEEE, Los Alamitos (2003)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-31985-6_4","volume-title":"Compiler Construction","author":"V. Gapeyev","year":"2005","unstructured":"Gapeyev, V., Levin, M.Y., Pierce, B.C., Schmitt, A.: XML goes native: Run-time representations for Xtatic. In: Bodik, R. (ed.) CC 2005. LNCS, vol.\u00a03443, pp. 43\u201358. Springer, Heidelberg (2005)"},{"key":"13_CR12","unstructured":"Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proc. SODA, pp. 1\u201310 (2004)"},{"key":"13_CR13","volume-title":"Handbook of Formal Languages, ch. 1","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, ch. 1, vol.\u00a03. Springer, Heidelberg (1997)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1142\/S0129054190000291","volume":"1","author":"J. Katajainen","year":"1990","unstructured":"Katajainen, J., M\u00e4kinen, E.: Tree compression and optimization with applications. Intern. J. of Foundations of Comput. Sci.\u00a01, 425\u2013447 (1990)","journal-title":"Intern. J. of Foundations of Comput. Sci."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/96709.96711","volume-title":"Proc. POPL 1990","author":"J. Lamping","year":"1990","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reductions. In: Proc. POPL 1990, pp. 16\u201330. ACM Press, New York (1990)"},{"key":"13_CR16","first-page":"205","volume-title":"Proc. SODA","author":"E. Lehman","year":"2002","unstructured":"Lehman, E., Shelat, A.: Approximation algorithms for grammar-based compression. In: Proc. SODA, pp. 205\u2013212. SIAM Press, Philadelphia (2002)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/342009.335405","volume-title":"Proc. SIGMOD","author":"H. Liefke","year":"2000","unstructured":"Liefke, H., Suciu, D.: XMill: An efficient compressor for XML data. In: Chen, W., et al. (eds.) Proc. SIGMOD, pp. 153\u2013164. ACM, New York (2000)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Lohrey, M., Maneth, S.: Tree automata on compressed trees. Submitted manuscript (2005)","DOI":"10.1007\/11605157_19"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-24727-2_26","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Maneth","year":"2004","unstructured":"Maneth, S., Busatto, G.: Tree transducers and tree compressions. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 363\u2013377. Springer, Heidelberg (2004)"},{"key":"13_CR20","volume-title":"Imperfect XML: Rants, Raves, Tips, and Tricks ... from an Insider","author":"D. Megginson","year":"2004","unstructured":"Megginson, D.: Imperfect XML: Rants, Raves, Tips, and Tricks... from an Insider. Addison-Wesley, Reading (2004)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comp. Syst. Sci.\u00a066, 66\u201397 (2003)","journal-title":"J. Comp. Syst. Sci."},{"key":"13_CR22","first-page":"122","volume-title":"Proc. SIGMOD","author":"J. Min","year":"2003","unstructured":"Min, J., Park, M., Chung, C.: XPRESS: A queriable compression for XML data. In: Proc. SIGMOD, pp. 122\u2013133. ACM Press, New York (2003)"},{"key":"13_CR23","unstructured":"Murata, M., Lee, D., Mani, M.: Taxonomy of XML schema languages using formal language theory. In: Proc. Extreme Markup Languages (2000)"},{"key":"13_CR24","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-47849-3_3","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"W. Rytter","year":"1999","unstructured":"Rytter, W.: Algorithms on compressed strings and arrays. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 48\u201365. Springer, Heidelberg (1999)"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W. Rytter","year":"2002","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoret. Comput. Sci.\u00a0302, 211\u2013222 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR28","first-page":"225","volume-title":"Proc. ICDE 2002","author":"P.M. Tolani","year":"2002","unstructured":"Tolani, P.M., Hartisa, J.R.: XGRIND: A query-friendly XML compressor. In: Proc. ICDE 2002, pp. 225\u2013234. IEEE Computer Society, Los Alamitos (2002)"},{"key":"13_CR29","first-page":"621","volume-title":"Proc. ECDE 2004","author":"B.B. Yao","year":"2004","unstructured":"Yao, B.B., \u00d6zsu, M.T., Khandelwal, N.: XBench benchmark and performance testing of XML DBMSs. In: Proc. ECDE 2004, pp. 621\u2013633. IEEE Computer Society, Los Alamitos (2004)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, N., Kacholia, V., \u00d6zsu, M.T.: A succinct physical storage scheme for efficient evaluation of path queries in XML. In: Proc. ICDE, pp. 54\u201365 (2004)","DOI":"10.1109\/ICDE.2004.1319984"}],"container-title":["Lecture Notes in Computer Science","Database Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601524_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:04Z","timestamp":1619506924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601524_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309512","9783540314455"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11601524_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}