IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Systems Journal
Celebrating 10 Years of XML   Volume 45, Number 2, 2006
Table of contents: HTMLPDF This article: HTMLPDF   Copyright info

The importance of sibling clustering for efficient bulkload of XML document trees - References

 by C. C. Kanne
and G. Moerkotte
Cited references

  1. T. Fiebig, S. Helmer, C.-C. Kanne, G. Moerkotte, J. Neumann, R. Schiele, and T. Westmann, “Anatomy of a Native XML Base Management System,” VLDB Journal 11, 4, 292–314, (2002).
  2. K. Beyer, R. J. Cochrane, V. Josifovski, J. Kleewein, G. Lapis, G. Lohman, B. Lyle, F. Ozcan, H. Pirahesh, N. Seemann, T. Truong, B. Van der Linden, B. Vickery, and C. Zhang, “System RX: One Part Relational, One Part XML,” Proceedings of the ACM SIGMOD Conference (2005), pp. 347–358.
  3. C.-C. Kanne, M. Brantner, and G. Moerkotte, “Cost-Sensitive Reordering of Navigational Primitives,” Proceedings of the ACM SIGMOD Conference (2005), pp. 742–753.
  4. C.-C. Kanne and G. Moerkotte, Efficient Storage of XML Data, Technical Report TR-1999-008, Department for Mathematics and Computer Science, University of Mannheim (June 1999).
  5. C.-C. Kanne and G. Moerkotte, “Efficient Storage of XML Data,” Proceedings of the 16th International Conference on Data Engineering (ICDE), IEEE Computer Society (2000), page 198.
  6. M. M. Tsangaris and J. F. Naughton, “On the Performance of Object Clustering Techniques,” In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, San Diego, California, June 2–5, 1992, Michael Stonebraker (Editor), ACM Press (1992), pp. 144–153.
  7. J. A. Lukes, “Efficient Algorithm for the Partitioning of Trees,” IBM Journal of Research and Development 18, No. 3, 217–224 (1974).
  8. R. Bordawekar and O. Shmueli, “Flexible Workload-Aware Clustering of XML Documents,” Database and XML Technologies, Proceedings of Second International XML Database Symposium, XSym 2004, Lecture Notes in Computer Science 3186, Springer, New York (2004), pp. 204–218.
  9. M. Schkolnick, “A Clustering Algorithm for Hierarchical Structures,” ACM Transactions on Database Systems 2, No. 1, 27–44 (1977).
  10. S. Kundu and J. Misra, “A Linear Tree Partitioning Algorithm,” SIAM Journal on Computing 6, No. 1, 151–154 (March 1977).
  11. D. Megginson, SAX: A Simple API for XML, Technical Report, Megginson Technologies Ltd. (2001).
  12. D. Veillard, The XML C Parser and Toolkit of Gnome (2002), http://www.xmlsoft.org/index.html.
  13. A. Schmidt, F. Waas, M. Kersten, M. J. Carey, I. Manolescu, and R. Busse, “XMark: A Benchmark for XML Data Management,” Proceedings of the 28th VLDB Conference (2002), pp. 974–985.
  14. D. Barbosa, A. Mendelzon, J. Keenleyside, and K. Lyons, “ToXgene: a Template-Based Data Generator for XML,” Proceedings of the ACM SIGMOD Conference (2002), pp. 616–616.
  15. C-C. Kanne and G. Moerkotte, The Importance of Sibling Clustering for Efficient Bulkload of XML Document Trees, Technical Report TR-2005-009, Department of Mathematics and Computer Science, University of Mannheim (November 2005).
  16. P. A. Boncz, T. Grust, S. Manegold, J. Rittinger, and J. Teubner, Pathfinder: Relational XQuery over Multi-Gigabyte XML Inputs In Interactive Time, Technical Report INS-E0503, CWI, Amsterdam, Netherland (March 2005).
  17. R. Bordawekar and O. Shmueli, Flexible Workload-Aware Clustering of XML Documents, IBM Thomas J. Watson Research Center, Yorktown Heights, NY (May 2004) (available from the author).


    About IBM    Privacy    Contact