Incremental XPath evaluation

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 162-173

  Björklund, Henrik ^a   Marquardt, Marcel ^a   Martens, Wim ^a   Gelade, Wouter ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY DATA STRUCTURES; NODE DELETION; RELABELING; XML DATABASE; XPATH QUERIES;

DATA STRUCTURES; MARKUP LANGUAGES;

DATABASE SYSTEMS;

EID: 70349132634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514915     Document Type: Conference Paper

References (21)

1. A. Balmin, Y. Papakonstantinou, and V. Vianu. Incremental validation of XML documents. ACM TODS, 29(4):710-751, 2004.
2. Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. JCSS, 73(3):391-441, 2007.
3. D. Barbosa, A.O. Mendelzon, L. Libkin, L. Mignet, and M. Arenas. Efficient incremental validation of XML documents. In ICDE, pages 671-682, 2004.
4. M. Benedikt and C. Koch. XPath leashed. ACM Gomp. Surveys, 2008. To appear.
5. M. Bojańczyk and P. Parys. XPath evaluation in linear time. In PODS, pages 241-250, 2008.
6. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM TODS, 30(2):444-491, 2005.
7. G. Gottlob, C. Koch, R. Pichler, and L. Segoufin. The complexity of XPath query evaluation and XML typing. J. ACM, 52(2):284-335, 2005.
8. M. Götz, C. Koch, and W. Martens. Efficient algorithms for the tree homeomorphism problem. In DBPL, pages 17-31, 2007.
9. M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. TCS, 380(1-2): 199-217, 2007.
10. A. Gupta, I. Singh Mumick, and V.S. Subrahmanian. Maintaining views incrementally. In SIGMOD, pages 157-166, 1993.
11. Leonid Libkin and Cristina Sirangelo. Reasoning about XML with temporal logics and automata. In LPAR, pages 97-112, 2008.
12. H. Matsumura and K. Tajima. Incremental evaluation of a monotone XPath fragment. In CIKM, pages 245-246, 2005.
13. P.E. O'Neil, E.J. O'Neil, S. Pal, I. Cseri, G. Schaller, and N. Westbury. ORDPATHs: Insert-friendly XML node labels. In SIGMOD, pages 903-908, 2004.
14. M. Onizuka, F. Yee Chan, R. Michigami, and T. Honishi. Incremental maintenance for materialized XPath/XSLT views. In WWW, pages 671-681, 2005.
15. S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. JCSS, 55(2):199-209, 1997.
16. A. Sawires, J. Tatemura, O. Po, D. Agrawal, A. El Abbadi, and K. Selçuk Candan. Maintaining XPath views in loosely coupled systems. In VLDB, pages 583-594, 2006.
17. A. Sawires, J. Tatemura, O. Po, D. Agrawal, and K. Selçuk Candan. Incremental maintenance of path-expression views. In SIGMOD, pages 443-454, 2005.
18. N. Schweikardt. Machine models and lower bounds for query processing. In PODS, pages 41-52, 2007.
19. T. Schwentick. XPath query containment. Sigmod RECORD, 33(1):101-109, 2004.
20. O. Shmueli and A. Itai. Incremental view maintenance. In SIGMOD, pages 240-255, 1984.
21. B. ten Cate and C. Lutz. The complexity of query containment in expressive fragments of XPath 2.0. In PODS, pages 73-82, 2007.