XPath Query Evaluation: Improving Time and Space Efficiency (2003)
Cached
Download Links
- [www.dbai.tuwien.ac.at]
- [www.xmltaskforce.com]
- [www.cs.cornell.edu]
- DBLP
Other Repositories/Bibliography
by
Georg Gottlob
,
Christoph Koch
,
Reinhard Pichler
| Venue: | IN PROCEEDINGS OF THE 19TH IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE’03 |
| Citations: | 51 - 5 self |
BibTeX
@INPROCEEDINGS{Gottlob03xpathquery,
author = {Georg Gottlob and Christoph Koch and Reinhard Pichler},
title = {XPath Query Evaluation: Improving Time and Space Efficiency},
booktitle = {IN PROCEEDINGS OF THE 19TH IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE’03},
year = {2003},
pages = {379--390},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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]). In this paper
