%0 Conference Paper %1 Halverson:2003:MMX:1315451.1315472 %A Halverson, Alan %A Burger, Josef %A Galanis, Leonidas %A Kini, Ameet %A Krishnamurthy, Rajasekar %A Rao, Ajith Nagaraja %A Tian, Feng %A Viglas, Stratis D. %A Wang, Yuan %A Naughton, Jeffrey F. %A DeWitt, David J. %B Proceedings of the 29th international conference on Very large data bases - Volume 29 %D 2003 %I VLDB Endowment %K brokenmirror mixed mode processing query rdbms xml %P 225--236 %T Mixed mode XML query processing %U http://dl.acm.org/citation.cfm?id=1315451.1315472 %X Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should support query plans that mix these two processing paradigms. We describe our prototype native XML system, and report on experiments demonstrating that even for simple queries, there are a number of options for how to combine tree-based navigation and structural joins based on information retrieval-style inverted lists, and that these options can have widely varying performance. We present ways of transparently using both techniques in a single system, and provide a cost model for identifying efficient combinations of the techniques. Our preliminary experimental results prove the viability of our approach. %@ 0-12-722442-4

@inproceedings{Halverson:2003:MMX:1315451.1315472, abstract = {Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should support query plans that mix these two processing paradigms. We describe our prototype native XML system, and report on experiments demonstrating that even for simple queries, there are a number of options for how to combine tree-based navigation and structural joins based on information retrieval-style inverted lists, and that these options can have widely varying performance. We present ways of transparently using both techniques in a single system, and provide a cost model for identifying efficient combinations of the techniques. Our preliminary experimental results prove the viability of our approach.}, acmid = {1315472}, added-at = {2012-08-23T16:45:06.000+0200}, author = {Halverson, Alan and Burger, Josef and Galanis, Leonidas and Kini, Ameet and Krishnamurthy, Rajasekar and Rao, Ajith Nagaraja and Tian, Feng and Viglas, Stratis D. and Wang, Yuan and Naughton, Jeffrey F. and DeWitt, David J.}, biburl = {https://www.bibsonomy.org/bibtex/2d55d895221891923241b17c8dcfb6abd/sac}, booktitle = {Proceedings of the 29th international conference on Very large data bases - Volume 29}, description = {Mixed mode XML query processing}, interhash = {c75496fcf9e333879e14632b9b42e5d6}, intrahash = {d55d895221891923241b17c8dcfb6abd}, isbn = {0-12-722442-4}, keywords = {brokenmirror mixed mode processing query rdbms xml}, location = {Berlin, Germany}, numpages = {12}, pages = {225--236}, publisher = {VLDB Endowment}, series = {VLDB '03}, timestamp = {2012-08-23T16:45:07.000+0200}, title = {Mixed mode XML query processing}, url = {http://dl.acm.org/citation.cfm?id=1315451.1315472}, year = 2003 }