과제정보
연구 과제 주관 기관 : 정보통신연구진흥원
참고문헌
- J. Shanmugasundaram, H. Gang, K. Tufte,, C. Zhang, D.J. DeWitt & J. Naughton, "Relational databases for querying XML documents: Limitations and opportunities," In Proceedings of the International Conference on Very Large Data Bases, pp.302-314, 1999.
- M. Yoshikawa, T. Amagasa, T. Shimura, & S. Uemura, "XRel: a path-based approach to storage and retrieval of XML documents using relational databases," ACM Transactions on Internet Technology, 1(1):110-141, 2001. https://doi.org/10.1145/383034.383038
- C. Zhang, J. Naughton, D. DeWitt, Q. Luo, & G. Lohman, "On supporting containment queries in relational database management systems," In Proceedings of the 2001 ACM SIGMOD international conference on Management of data, pp.425-436. ACM Press New York, NY, USA, 2001.
- P.J. Harding, Q. Li, & B. Moon, "XISS/R: XML indexing and storage system using RDBMS," In Proceedings of the 29th international conference on Very large data bases, pp.1073-1076. VLDB Endowment, 2003.
- S. Pal, I. Cseri, O. Seeliger, G. Schaller, L. Giakoumakis, & V. Zolotov, "Indexing XML data stored in a relational database," In Proceedings of the 30th international conference on Very large data bases, pp.1146-1157, 2004.
- K. Beyer, and Others, "System RX: one part relational, one part XML," In Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp.347-358, ACM New York, NY, USA, 2005.
- Z.H. Liu, M. Krishnaprasad & V. Arora, "Native XQuery processing in oracle XMLDB," In Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp.828-833, ACM New York, NY, USA, 2005.
- M. Rys, D. Chamberlin, & D. Florescu, "XML and relational database management systems: the inside story," In Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp.945-947, ACM New York, NY, USA, 2005.
- H. Lu, J.X. Yu, G. Wang, S. Zheng, H. Jiang, G. Yu, & A. Zhou, "What makes the differences: benchmarking XML database implementations," ACM Transactions on Internet Technology (TOIT), 5(1): 154-194, 2005. https://doi.org/10.1145/1052934.1052940
- T. Grust, J. Rittinger, & J. Teubner, "Why off-the-shelf RDBMSs are better at XPath than you might expect," In Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 949-958. ACM Press New York, NY, USA, 2007.
- G. Gou & R. Chirkova, "Efficiently querying large xml data repositories: a survey," IEEE Transactions on Knowledge and Data Engineering, 19(10):1381-1403, 2007. https://doi.org/10.1109/TKDE.2007.1060
- N. Bruno, N. Koudas, & D. Srivastava, "Holistic twig joins: optimal XML pattern matching," In Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp.310-321, 2002.
- H. Jiang, W. Wang, H. Lu, & J.X. Yu, "Holistic twig joins on indexed XML documents," In Proceedings of the 29th international conference on Very large data bases, Volume 29, pp.273-284, 2003.
- T. Chen, J. Lu, & T.W. Ling, "On boosting holism in XML twig pattern matching using structural indexing techniques," In Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp.455-466. ACM New York, NY, USA, 2005.
- P. O'Neil & D. Quass, "Improved query performance with variant indexes," In Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pp.38-49, 1997.
- J. Lu, T. Chen, & T.W. Ling, "Efficient processing of XML twig patterns with parent child edges: a look-ahead approach," In Proceedings of the 13th ACM international conference on Information and knowledge management, pp.533-542, 2004.
- H. Jiang, H. Lu & W. Wang, "Efficient processing of XML twig queries with OR-predicates," In Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pp.59-70, 2004.
- T. Yu, T.W. Ling & J. Lu, "twigStackList -: A holistic twig join algorithm for twig query with not-predicates on XML data," LECTURE NOTES IN COMPUTER SCIENCE, 3882:249-264, Springer, 2006.
- R. Kaushik, R. Krishnamurthy, J.F. Naughton & R. Ramakrishnan, "On the integration of structure indexes and inverted lists," In Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pp.779-790, 2004.
- B. Choi, M. Mahoui & D. Wood, "On the optimality of holistic algorithms for twig queries," LECTURE NOTES IN COMPUTER SCIENCE, pp.28-37, Springer, 2003.
- K. Wu, E. Otoo, & A. Shoshani, "On the performance of bitmap indices for high cardinality attributes," In Proceedings of the 30th international conference on Very large data bases, pp.24-35. VLDB Endowment, 2004.
- R. Kaushik, P. Bohannon, J. Naughton & H. Korth, "Covering indexes for branching path queries," In Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp.133-144, 2002.
- Scientific Data Management Group, University of California Berkeley Lab, "FastBit: An Efficient Bitmap Index Technology," https://sdm.lbl.gov/ fastbit/
- J. Lu, T.W. Ling, C.Y. Chan, & T. Chen, "From region encoding to extended dewey: on efficient processing of XML twig pattern matching," In Proceedings of the 31st international conference on Very large data bases, pp.193-204, 2005.
- C. Chan & Y. Ioannidis, "An efficient bitmap encoding scheme for selection queries," In Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pp.215-226, 1999.
- J.P. Yoon, V. Raghavan, V. Chakilam, & L. Kerschberg, "BitCube: a three-dimensional Bitmap indexing for XML documents," Journal of Intelligent Information Systems, 17(2):241-254, 2001. https://doi.org/10.1023/A:1012861931139