XPath Query Evaluation: Improving Time and Space E#ciency Export

@misc{citeulike:316130, abstract = {Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first mainmemory evaluation algorithm for XPath 1.0 with polynomial time combined complexity, i.e., which runs in polynomial time both with respect to the size of the data and the queries, has been published (cf. [11]).}, author = {Gottlob, G. and Koch, C. and Pichler, R.}, citeulike-article-id = {316130}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1071}, keywords = {algorithm, xml, xpath}, posted-at = {2005-09-13 08:24:59}, priority = {0}, title = {XPath Query Evaluation: Improving Time and Space E\#ciency}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1071}, year = {2003} }

TY - GEN ID - citeulike:316130 L3 - citeulike-article-id:316130 N2 - Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first mainmemory evaluation algorithm for XPath 1.0 with polynomial time combined complexity, i.e., which runs in polynomial time both with respect to the size of the data and the queries, has been published (cf. [11]). TI - XPath Query Evaluation: Improving Time and Space E#ciency KW - algorithm KW - xml KW - xpath AU - Gottlob, G AU - Koch, C AU - Pichler, R PY - 2003/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1071 ER -