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

Cost-based optimization in DB2 XML - References

 by A. Balmin,
T. Eliaz,
J. Hornibrook,
L. Lim,
G. M. Lohman,
D. Simmen,
M. Wang,
and C. Zhang
Cited references

  1. Information Technology-Database Languages—SQL-Part 14: XML-Related Specifications (SQL/XML), ISO/IEC 9075-14:2003/Cor 1:2005, International Organization for Standardization (2005), http://www.iso.org/iso/en/CatalogueDetailPage.CatalogueDetail?CSNUMBER=41905&ICS1=35&ICS2=60&ICS3=&scopelist=.
  2. XQuery 1.0: An XML Query Language, S. Boag, D. Chamberlin, M. F. Fernández, D. Florescu, J. Robie, and J. Siméon (Editors), W3C Candidate Recommendation, (November 2005), http://www.w3.org/TR/xquery.
  3. XML Path Language (XPath) Version 2.0, A. Berglund, S. Boag, D. Chamberlin, M. F. Fernández, M. Kay, J. Robie, and J. Siméon (Editors), W3C Candidate Recommendation, (November 2005), http://www.w3.org/TR/xpath20.
  4. K. Beyer, R. Cochrane, V. Josifovski, J. Kleewein, G. Lapis, G. Lohman, B. Lyle, F. Özcan, 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 2005 ACM International Conference on the Management of Data (SIGMOD 2005), ACM Press, New York (2005), pp. 347–358.
  5. XQuery 1.0 and XPath 2.0 Data Model (XDM), M. Fernández, A. Malhotra, J. Marsh, M. Nagy, and N. Walsh (Editors), W3C Candidate Recommendation, (November 2005), http://www.w3.org/TR/xpath-datamodel.
  6. J. McHugh, S. Abiteboul, R. Goldman, D. Quass, and J. Widom, “Lore: A Database Management System for Semi-structured Data,” ACM SIGMOD Record 26, No. 3, 54–66 (1997).
  7. J. F. Naughton, D. J. DeWitt, D. Maier, A. Aboulnagaa, J. Chen, L. Galanis, J. Kang, R. Krishnamurthy, Q. Luo, N. Prakash, R. Ramamurthy, J. Shanmugasundaram, F. Tian, K. Tufte, S. Viglas, Y. Wang, C. Zhang, B. Jackson, A. Gupta, and R. Chen, “The Niagara Internet Query System,” IEEE Data Engineering Bulletin 24, No. 2, 27–33 (2001).
  8. H. V. Jagadish, S. Al-Khalifa, A. Chapman, L. V. S. Lakshmanan, A. Nierman, S. Paparizos, J. M. Patel, D. Srivastava, N. Wiwatwattana, Y. Wu, and C. Yu, “TIMBER: A Native XML Database,” VLDB Journal 11, No. 4, 274–291 (2002).
  9. T. Fiebig, S. Helmer, C.-C. Kanne, J. Mildenberger, G. Moerkotte, R. Schiele, and T. Westmann, “Anatomy of a Native XML Base Management System,” VLDB Journal 11, No. 4, 292–314 (2002).
  10. D. Barbosa, A. Barta, A. Mendelzon, G. Mihaila, F. Rizzolo, and P. Rodriguez-Gianolli, “ToX—the Toronto XML Engine,” University of Toronto, Department of Computer Science (2001), http://www.cs.toronto.edu/tox/papers/wiiw.pdf.
  11. M. Rys, “XML and Relational Database Management Systems: Inside Microsoft SQL Server 2005,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (2005), pp. 958–962, http://portal.acm.org/citation.cfm?doid=1066301.
  12. R. Murthy, Z. H. Liu, M. Krishnaprasad, S. Chandrasekar, A.-T. Tran, E. Sedlar, D. Florescu, S. Kotsovolos, N. Agarwal, V. Arora, and V. Krishnamurthy, “Toward an Enterprise XML Architecture,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (2005), pp. 953–957.
  13. V. Josifovski, M. Fontoura, and A. Barta, “Querying XML Streams,” VLDB Journal 14, No. 2, 197–210 (2005).
  14. J. McHugh and J. Widom, “Query Optimization for XML,” Proceedings of the 25th International Conference on Very Large Data Bases (VLDB 1999), Morgan Kaufmann Publishers, San Francisco, CA (1999), pp. 315–326.
  15. A. Aboulnaga, A. R. Alameldeen, and J. F. Naughton, “Estimating the Selectivity of XML Path Expressions for Internet Scale Applications,” Proceedings of the International Conference on Very Large Data Bases (VLDB '01), Morgan Kaufmann Publishers, San Francisco, CA (2001), pp. 591–600.
  16. L. Lim, M. Wang, S. Padmanabhan, J. S. Vitter, and R. Parr, “XPath-Learner: An On-line Self-tuning Markov Histogram for XML Path Selectivity Estimation,” Proceedings of the International Conference on Very Large Data Bases (VLDB '02), Morgan Kaufmann Publishers, San Francisco, CA (2002), pp. 442–453.
  17. Z. Chen, H. V. Jagadish, F. Korn, N. Koudas, S. Muthukrishnan, R. T. Ng, and D. Srivastava, “Counting Twig Matches in a Tree,” Proceedings of the 17th International Conference on Data Engineering (ICDE 2001), IEEE Computer Society, Los Alamitos, CA (2001), pp. 595–604.
  18. N. Polyzotis and M. N. Garofalakis, “Statistical Synopses for Graph-Structured XML Databases,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (2002), pp. 358–369.
  19. N. Polyzotis and M. N. Garofalakis, “Structure and Value Synopses for XML Data Graphs,” Proceedings of the 28th International Conference on Very Large Data Bases, Morgan Kaufmann Publishers, San Francisco, CA (2002), pp. 466–477.
  20. N. Polyzotis, M. N. Garofalakis, and Y. E. Ioannidis, “Approximate XML Query Answers,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (2004), pp. 263–274.
  21. J. Freire, J. R. Haritsa, M. Ramanath, P. Roy, and J. Simeon, “StatiX: Making XML Count,” Proceedings of the 2002 ACM International Conference on the Management of Data (SIGMOD 2002), ACM Press, New York (2002), pp. 181–191.
  22. Y. Wu, J. M. Patel, and H. V. Jagadish, “Estimating Answer Sizes for XML Queries,” Proceedings of the 8th International Conference on Extending Database Technology (EDBT 2002), LNCS 2287, Springer-Verlag, New York (2002), pp. 590–608.
  23. W. Wang, H. Jiang, H. Lu, and J. X. Yu, “Bloom Histogram: Path Selectivity Estimation for XML Data with Updates,” Proceedings of the 30th International Conference on Very Large Data Bases (VLDB 2004), Morgan Kaufmann Publishers, San Francisco, CA (2004), pp. 240–251.
  24. L. Lim, M. Wang, and J. S. Vitter, “CXHist: An On-line Classification-Based Histogram for XML String Selectivity Estimation,” Proceedings of the 31st International Conference on Very Large Data Bases (VLDB 2005), ACM Press, New York (2005), pp. 1187–1198.
  25. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price, “Access Path Selection in a Relational Database Management System,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (1979), pp. 23–24.
  26. G. M. Lohman, C. Mohan, L. M. Haas, D. Daniels, B. G. Lindsay, P. G. Selinger, and P. F. Wilms, “Query Processing in R*,” in Query Processing in Database Systems, W. Kim, D. Reiner, and D. Batory (Editors), Springer-Verlag, New York (1985), pp. 31–47.
  27. L. M. Haas, W. Chang, G. M. Lohman, J. McPherson, P. F. Wilms, G. Lapis, B. G. Lindsay, H. Pirahesh, M. J. Carey, and E. J. Shekita, “Starburst Mid-flight: As the Dust Clears,” IEEE Transactions on Knowledge and Data Engineering 2, No. 1, 143–160, (1990).
  28. G. M. Lohman, “Grammar-like Functional Rules for Representing Query Optimization Alternatives,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (1988), pp. 18–27.
  29. H. Pirahesh, J. Hellerstein, and W. Hasan, “Extensible/Rule-based Query Rewrite Optimization in Starburst,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (1992), pp. 39–48.
  30. P. Gassner, G. M. Lohman, K. B. Schiefer, and Y. Wang, “Query Optimization in the IBM DB2 Family,” IEEE Data Engineering Bulletin 16, No. 4, 4–18 (1993).
  31. TPC-H, Transaction Processing Performance Council, http://www.tpc.org/tpch/.
  32. K. Ono and G. M. Lohman, “Measuring the Complexity of Join Enumeration in Query Optimization,” Proceedings of the 16th International Conference on Very Large Data Bases (VLDB 1990), Morgan Kaufmann Publishers, San Francisco, CA (1990), pp. 314–325.
  33. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita, “Improved Histograms for Selectivity Estimation of Range Predicates,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (1996), pp. 294–305.
  34. A. Balmin, F. Ozcan, K. Beyer, R. Cochrane, and H. Pirahesh, “A Framework for Using Materialized XPath Views in XML Query Processing,” Proceedings of the 30th International Conference on Very Large Data Bases (VLDB '04), Morgan Kaufmann Publishers, San Francisco, CA (2004), pp. 60–71.
  35. N. Bruno, N. Koudas, and D. Srivastava, “Holistic Twig Joins: Optimal XML Pattern Matching,” Proceedings of the 2002 ACM International Conference on the Management of Data (SIGMOD 2002), ACM Press, New York (2002), pp. 310–321.
  36. C. Mohan, D. J. Haderle, Y. Wang, and J. M. Cheng, “Single Table Access Using Multiple Indexes: Optimization, Execution, and Concurrency Control Techniques,” Proceedings of the International Conference on Extending Data Base Technology (EDBT '90) LNCS 416, Springer-Verlag, New York (1990), pp. 29–43.
  37. B. H. Bloom, “Space/Time Trade-offs in Hash Coding with Allowable Errors,” Communications of the ACM 13, No. 7, 422–426 (1970).
  38. J. S. Vitter, “Random Sampling with a Reservoir,” ACM Transactions on Mathematical Software 11, No. 1, 37–57 (1985).
  39. N. Zhang, P. J. Haas, V. Josifovski, G. M. Lohman, and C. Zhang, “Statistical Learning Techniques for Costing XML Queries,” Proceedings of the 31st International Conference on Very Large Data Bases (VLDB 2005), ACM Press, New York (2005), pp. 289–300.
  40. D. Simmen, E. Shekita, and T. Malkemus, “Fundamental Techniques for Order Optimization,” Proceedings of the ACM SIGMOD Conference on the Management of Data, ACM Press, New York (1996), pp. 625–628.


    About IBM    Privacy    Contact