A COMPRESSED DATA MODEL FOR A BITMAPPED XML STRUCTURE

Mohammed Al-Badawi

Abstract

Developments on XML processing usually produce tools to formulate both the XML data storage and the associated query processor. PACD is one of such developments that stores the XML structure into a set of n×n bitmap matrices each of which encodes a specific XML structure related to an XPath axis. The amount of space and the complexity of storing uncompressed version of these matrices is large for huge XML databases; and such requirements may go beyond the HW/SW capabilities; this justify the need for the data compression model discussed in this paper.

References

  1. Al-Badawi, M. (2010) 'A Performance Evaluation of a New Bitmap-based XML Processing Approach', PhD Thesis, University of Sheffield, UK.
  2. Al-Badawi, M., Eaglestone, B., and North, S. (2009) 'PACD: A Bitmap-based Framework for Processing XML Data', In the proceedings of the WebIST'09, Lisbon, Portugal, pages 66-71.
  3. Berglund, A., Boag, S., Chamberlin, D., Fernández, M., Kay, M., Robie, J., and Siméon, J. (2010) XML Path Language (XPath) 2.0 (2nd Ed.), [Online] Avail: http:// www.w3.org/TR/xpath20/ [15/11/2011].
  4. Boag, S., Chamberlin, D., Fernández, M., Florescu, D., Robie, J., and Siméon, J. (2010) XQuery 1.0: An XML Query Language, (2nd Ed.) [Online] Avail: http://www .w3.org/TR/xquery/ [15/11/2011].
  5. Chung, C., Min, J., and Shim, K (2002) 'APEX: An Adaptive Path Index for XML Data', In proceedings of the 2002 ACM SIGMOD international conference on Management of data, Madison, Wisconsin, pages 121-132.
  6. Duff, I., Erisman, A., and Reid, J. (1986) Direct Methods for Sparse Matrices. Oxford University Press, New York and London.
  7. George, A., Gilbert, J., and Liu, J. (1993) Graph Theory and Sparse Matrix computation, Volume 56 of the IMA volumes in Mathematics and its Applications, Volume 56 of Partially Ordered Systems. Springer-Verlag.
  8. Goldman, R., and Widom, J. (1997) 'DataGuides: Enabling Query Formulation and Optimaization in Semistructured Database', In proceedings of the 23rd international conference on VLDB, pages 436-445.
  9. Hammerschmidt, B. (2005) 'KeyX: Selective KeyOriented Indexing in Native XML Databases', PhD Thesis Published. in: Dissertations in Database and Information Systems - Infix, Volume 93, ISBN 1586035894.
  10. Haw, S., and Lee, C. (2009) 'Extending path summary and region encoding for efficient structural query processing in native XML databases', Journal of Systems and Software, Volume 82, Issue 6, pages 1025-1035.
  11. He, H., Wang, H., Yang, J., and Yu, P. (2005) 'Compact Reachability Labeling for Graph-Structured Data', In proceedings of the 14th ACM international conference on Information and knowledge management, Bremen, Germany, pages 594-601
  12. Mackay, D., and Radford, N. (1995) 'Good Codes based on Very Sparse Matrices', Lecture notes in Computer Science, Volume 1025/1995, pages 100-111.
  13. McCord, R. (1981) 'Sizing and Data Distribution for a Distributed Database Machine', In proceedings of the 1981 ACM/SIGMOD international conference on Management of Data, Michigan, USA, pages 198-204.
  14. Milo, T., and Suciu, D. (1999) 'Index Structures for Path Expressions', In proceedings of the 7th International conference on Data Technology, Volume 1540/1998, Jerusalem, pages 277-295.
  15. O'Neil, P., and O'Neil, E. (2001) 'Database: Principles, Programming, and Performance', Morgan Kaufmann Publishers, 2nd Edition, 2001.
  16. Pettovello, P., and Fotouhi, F. (2006) 'MTree: An XML XPath Graph Index', ACM/Sym. on Applied computing, Dijon, France, pages 474-481.
  17. Sun, J., Xie, Y., Zhang, H., and Faloutsos, C. (2008) 'Less is More: Sparse Graph Mining with Compact Matrix Decomposition', Journal of Statistical Analysis and Data Mining, Volume 1, Issue 1, pages 6-22.
  18. Tarjan, R., and Yao, A. (1979) 'Storing a Sparse Table', Journal of Communications of theACM, Volume 22, Issue 11, pages 606-611.
  19. Wang, H., He, H., Yang, J., Yu, P., and J Yu. (2006) 'Dual Labeling: Answering Graph Reachability Queries in Constant Time', In the proceedings of the International conference of Data Engineering, pages 75-86.
  20. Willcock, J., and Lumsdaine, A. (2006) 'Accelerating Sparse Matrix Computations via Data Compression', In proceedings of the 20th international conference on Supercomputing, Queensland, Australia, pages 307- 316.
Download


Paper Citation


in Harvard Style

Al-Badawi M. (2012). A COMPRESSED DATA MODEL FOR A BITMAPPED XML STRUCTURE . In Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8565-08-2, pages 89-95. DOI: 10.5220/0003895400890095


in Bibtex Style

@conference{webist12,
author={Mohammed Al-Badawi},
title={A COMPRESSED DATA MODEL FOR A BITMAPPED XML STRUCTURE},
booktitle={Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2012},
pages={89-95},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003895400890095},
isbn={978-989-8565-08-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - A COMPRESSED DATA MODEL FOR A BITMAPPED XML STRUCTURE
SN - 978-989-8565-08-2
AU - Al-Badawi M.
PY - 2012
SP - 89
EP - 95
DO - 10.5220/0003895400890095