{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:55Z","timestamp":1725562675182},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145889"},{"type":"electronic","value":"9783642145896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14589-6_19","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T10:38:13Z","timestamp":1281955093000},"page":"179-190","source":"Crossref","is-referenced-by-count":1,"title":["Benchmarking the Compression of XML Node Streams"],"prefix":"10.1007","author":[{"given":"Radim","family":"Ba\u010da","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Walder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pawlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Kr\u00e1tk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"141","volume-title":"Proceedings of ICDE 2002","author":"S. Al-Khalifa","year":"2002","unstructured":"Al-Khalifa, S., Jagadish, H.V., Koudas, N.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of ICDE 2002, pp. 141\u2013152. IEEE CS, Los Alamitos (2002)"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TIT.1987.1057284","volume":"33","author":"A. Apostolico","year":"1987","unstructured":"Apostolico, A., Fraenkel, A.: Robust Transmission of Unbounded Strings Using Fibonacci Representations. IEEE Transactions on Information Theory\u00a033(2), 238\u2013245 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/978-3-642-04205-8_3","volume-title":"Database Systems for Advanced Applications","author":"R. Ba\u010da","year":"2009","unstructured":"Ba\u010da, R., Kr\u00e1tk\u00fd, M.: TJDewey \u2013 On the Efficient Path Labeling Scheme Holistic Approach. In: Chen, L., Liu, C., Liu, Q., Deng, K. (eds.) Database Systems for Advanced Applications. LNCS, vol.\u00a05667, pp. 6\u201320. Springer, Heidelberg (2009)"},{"key":"19_CR4","unstructured":"Ba\u010da, R., Pawlas, M.: Compression of the Stream Array Data Structure. In: Proceedings of the 9th Annual International Workshop on DAtabases, TExts, Specfications and Objects, DATESO 2009. CEUR Workshop Proceedings, vol.\u00a0471, pp. 23\u201331 (2009)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1145\/564691.564727","volume-title":"Proceedings of ACM SIGMOD 2002","author":"N. Bruno","year":"2002","unstructured":"Bruno, N., Srivastava, D., Koudas, N.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proceedings of ACM SIGMOD 2002, pp. 310\u2013321. ACM Press, New York (2002)"},{"key":"19_CR6","unstructured":"Chen, S., Li, H.-G., Tatemura, J., Hsiung, W.-P., Agrawal, D., Candan, K.S.: Twig2Stack: Bottom-up Processing of Generalized-tree-pattern Queries Over XML documents. In: Proceedings of VLDB 2006, pp. 283\u2013294 (2006)"},{"key":"19_CR7","first-page":"1273","volume-title":"Proceedings of ICDE 2005","author":"Z. Chen","year":"2005","unstructured":"Chen, Z., Korn, G., Koudas, F., Shanmugasundaram, N., Srivastava, J.: Index Structures for Matching XML Twigs Using Relational Query Processors. In: Proceedings of ICDE 2005, p. 1273. IEEE CS, Los Alamitos (2005)"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal Codeword Sets and Representations of the Integers. IEEE Transactions on Information Theory\u00a021(2), 194\u2013203 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR9","unstructured":"Fraenkel, A., Klein, S.: Robust Universal Complete Codes as Alternatives to Huffiman Codes. Technical Report Tech. Report CS85-16, Dept. of Appl. Math., The Weizmann Institute of Science, Rehovot (1985)"},{"key":"19_CR10","volume-title":"Database Systems: The Complete Book","author":"H. Garcia-Molina","year":"2002","unstructured":"Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book. Prentice Hall, Englewood Cliffs (2002)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Grust, T., van Keulen, M., Teubner, J.: Staircase Join: Teach a Relational DBMS to Watch Its (Axis) Steps. In: Proceedings of VLDB 2003, pp. 524\u2013535 (2003)","DOI":"10.1016\/B978-012722442-8\/50053-7"},{"key":"19_CR12","first-page":"253","volume-title":"Proceedings of ICDE","author":"H. Jiang","year":"2003","unstructured":"Jiang, H., Lu, H., Wang, W., Ooi, B.: XR-Tree: Indexing XML Data for Efficient Structural Join. In: Proceedings of ICDE, India, pp. 253\u2013264. IEEE CS, Los Alamitos (2003)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-30192-9_21","volume-title":"Current Trends in Database Technology - EDBT 2004 Workshops","author":"M. Kr\u00e1tk\u00fd","year":"2004","unstructured":"Kr\u00e1tk\u00fd, M., Pokorn\u00fd, J., Sn\u00e1\u0161el, V.: Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML\u00a0Data. In: Lindner, W., Mesiti, M., T\u00fcrker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol.\u00a03268, pp. 219\u2013229. Springer, Heidelberg (2004)"},{"key":"19_CR14","unstructured":"Leonardo of Pisa (known as Fibonacci). Liber Abaci. 1202"},{"key":"19_CR15","volume-title":"Data Compression: The Complete Reference","author":"D. Salomon","year":"2004","unstructured":"Salomon, D.: Data Compression: The Complete Reference, 3rd edn. Springer, New York (2004)","edition":"3"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1145\/564691.564715","volume-title":"Proceedings of ACM SIGMOD 2002","author":"I. Tatarinov","year":"2002","unstructured":"Tatarinov, I., et al.: Storing and Querying Ordered XML Using a Relational Database System. In: Proceedings of ACM SIGMOD 2002, pp. 204\u2013215. ACM Press, New York (2002)"},{"key":"19_CR17","unstructured":"Walder, J., Kr\u00e1tk\u00fd, M., Ba\u010da, R.: Benchmarking Coding Algorithms for the R-tree Compression. In: Proceedings of the 9th Annual International Workshop on Databases, Texts, Specifications and Objects, DATESO 2009. CEUR Workshop Proceedings, vol.\u00a0471, pp. 32\u201343 (2009)"},{"key":"19_CR18","unstructured":"Walder, J., Kr\u00e1tk\u00fd, M., Ba\u010da, R., Plato\u0161, J., Sn\u00e1\u0161el, V.: Fast Decoding Algorithms for Variable-Lengths Codes. Submitted in Information Science (February 2010)"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","volume":"42","author":"H.E. Williams","year":"1999","unstructured":"Williams, H.E., Zobel, J.: Compressing Integers for Fast File Access. The Computer Journal\u00a042(3), 193\u2013201 (1999)","journal-title":"The Computer Journal"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1145\/375663.375722","volume-title":"Proceedings of ACM SIGMOD 2001","author":"C. Zhang","year":"2001","unstructured":"Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: Proceedings of ACM SIGMOD 2001, pp. 425\u2013436. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14589-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:55:02Z","timestamp":1606168502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14589-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145889","9783642145896"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14589-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}