Engineering succinct DOM

Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2008, Pages 49-60

  Delpratt, O'Neil ^a   Raman, Rajeev ^a   Rahman, Naila ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DATA STRUCTURES; NAVIGATION; STORAGE ALLOCATION (COMPUTER); XML;

SUCCINCT DOM (SDOM); XML COMPRESSORS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 43349096828     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353343.1353354     Document Type: Conference Paper

References (28)

1. Arion, A., Bonifati, A., Manolescu, I., and Pugliese, A. 2007. XQueC: A query-conscious compressed XML database. ACM Trans. Inter. Tech. 7, Article 10. doi:10.1145/1239971.1239974
2. Boncz, P., Grust, T., van Keulen, M., Manegold, S.,Rittinger, J., and Teubner, J. 2006. MonetDB/XQuery: a fast XQuery processor powered by a relational engine. In Proc. 2006 ACM SIGMOD international Conference on Management of Data, pp. 479-490.doi: 10.1145/1142473.1142527
3. BZip2. http://www.bzip.org.
4. Busatto, G., Lohrey, M., and Maneth, S. 2005. Efficient memory representation of XML documents. In Proc. Database Programming Languages, 10th International Symposium, DBPL 2005. Springer LNCS 3774, pp. 199-216. doi:10.1007/11601524_13
5. Cheng, J., Ng, W., 2004. XQzip: Querying compressed XML using structural indexing. In Proc. 9th International Conference on Extending Database Technology, EDBT '04. Springer LNCS 2992, pp. 219-236. doi:10.1007/b95855.
6. Clark, D. R. and Munro, J. I. 1996. Efficient suffix trees on secondary storage. In Proc. Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '96, pp. 383-391.
7. Delpratt, D., Rahman, N., and Raman, R. 2007. Compressed prefix sums. In Proc. Theory and Practice of Computer Science, SOFSEM '07. Springer LNCS 4362, pp. 235-247. doi:10.1007/978-3-540-69507-3_19.
8. Delpratt, D., Rahman, N., and Raman, R. 2006. Engineering the LOUDS succinct tree representation. In Proc. 5 Workshop on Experimental Algorithms, WEA '06. Springer LNCS 4007, pp. 134-145. doi:10.1007/11764298_12.
9. Ferragina, P. and Manzini, G. 2001. An experimental study of an opportunistic index. In Proc. Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms 269-278.
10. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S. 2006. Compressing and searching XML data via two zips. In Proc. 15th International World Wide Web Conference, WWW '06. ACM Press, pp. 751-760. doi:10.1145/1135777.1135891
11. Geary, R. F., Rahman, N., Raman, R., and Raman, V. 2006. A simple optimal representation for balanced parentheses. Theoretical Computer Science, 368, pp. 231-246. doi:10.1016/j.tcs.2006.09.014
12. Jacobson, G. 1989. Space-efficient static trees and graphs. In Proc. 30th Symp. Foundations of Computer Science, FOCS '89, pp. 549-554. doi: 10.1109/SFCS. 1989.63533
13. th Workshop on Experimental Algorithms, WEA 2005. Springer LNCS 3503, pp. 315-327. doi:10.1007/11427186_28.
14. Liefke, H. and Suciu, D. 2000. XMill: an efficient compressor for XML data. In Proc. 2000 ACM SIGMOD International Conference on Management of Data. ACM Press, pp. 153-164. doi:10.1145/342009.335405
15. Min, J., Park, M., and Chung, C. 2003. XPRESS: A queriable compression for XML data. In Proc. 2003 ACM SIGMOD Intl. Conference on Management of Data, SIGMOD '03. ACM Press, pp. 122-133. doi:10.1145/872757.872775
16. Munro, J. I. and Raman, V. 2002. Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. Comput. 31, pp. 762-776. doi:S0097539799364092
17. Neumüller, M. and Wilson, J. N. 2003. Improving XML processing using adapted data structures. In Web, Web-Services, and Database Systems, NODe 2002 Web and Database-Related Workshops, Revised Papers, Springer LNCS 2593, pp. 206-220.
18. Ng, W., Lam, W., Wood, P. T., and Levene, M. 2006. XCQ: A queriable XML compression system. Knowl. Inf. Syst. 10, pp. 421-452. doi:S10115-006-0012-z
19. Raman, R. and Rao, S. S. 2003. Succinct dynamic dictionaries and trees. In Proc. ICALP 2003, Springer LNCS 2719, pp. 357-368.
20. Saxon. http://saxon.source.forge.net/
21. Tolani, P., Haritsa, J.R. 2002. XGRTND: A query-friendly XML compressor. In Proc. 18th International Conference on Data Engineering, ICDE 2002, IEEE Computer Society, pp. 225-234. doi:10.1109/ICDE.2002.994712
22. Xerces C++ Parser, http://xerces.apache.org/xerces-c/
23. Xerces Java 2 Parser, http://xerces.apache.org/xerces2-j/
24. UW XML Repository, http://www.cs.washingon.edu/research/xmldatasets/www/ repository.html
25. VOTable Documentation. http://www.us-vo.org/VOTable/
26. W3C DOM API documentation. 2004. http://www.w3.org/TR/2004/REC-DOM-Level- 3-Core-20040407/
27. W3C DOM Traversal, 2000. http://www.w3.org/TR/DOM-Level-2- Traversal-Range/traversal.html
28. Zhang, N., Kacholia, V., and Özsu, M. T. 2004. A succinct physical storage scheme for efficient evaluation of path queries in XML. In Proc. 20th Intl. Conference on Data Engineering, pp. 54-65. doi:10.1109/ICDE.2004. 1319984