Efficient algorithms for processing XPath queries

@article{Gottlob2002EfficientAF,
  title={Efficient algorithms for processing XPath queries},
  author={Georg Gottlob and Christoph Koch and Reinhard Pichler},
  journal={ACM Trans. Database Syst.},
  year={2002},
  volume={30},
  pages={444-491}
}
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in the worst case. We show that XPath can be processed much more efficiently, and propose main-memory algorithms for this problem with polynomial-time combined query evaluation complexity. Moreover, we show how the main ideas of our algorithm can be profitably integrated into existing XPath processors. Finally, we present… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 383 CITATIONS, ESTIMATED 83% COVERAGE

Fast in-memory XPath search using compressed indexes

  • Softw., Pract. Exper.
  • 2015
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

SXPath: a Spatial Extension of XPath

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Fast in-memory XPath search using compressed indexes

  • 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
  • 2010
VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Four Lessons in Versatility or How Query Languages Adapt to the Web

  • REWERSE
  • 2009
VIEW 17 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

XPath leashed

  • ACM Comput. Surv.
  • 2008
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Forward node-selecting queries over trees

  • ACM Trans. Database Syst.
  • 2007
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2001
2018

CITATION STATISTICS

  • 103 Highly Influenced Citations

  • Averaged 8 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Similar Papers

Loading similar papers…