The space complexity of processing XML twig queries over indexed documents

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 824-832

  Shalem, Mirit ^a   Bar Yossef, Ziv ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Google Inc   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; CONTROL THEORY; DATA STORAGE EQUIPMENT; INFORMATION MANAGEMENT; MARKUP LANGUAGES; PATTERN MATCHING; TECHNOLOGY; XML;

DATA ENGINEERING; INTERNATIONAL CONFERENCES; JOIN ALGORITHMS; LARGE SPACES; LOWER BOUNDS; OCCURRENCE PATTERN; QUERY EVALUATION; SPACE COMPLEXITIES; SPACE OVERHEAD; TWIG QUERIES; XML DOCUMENTS; XPATH QUERIES;

ALGORITHMS;

EID: 52649116527     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497491     Document Type: Conference Paper

References (19)

1. J. Clark and S. DeRose, "XML Path Language (XPath), Version 1.0," W3C, 1999, http://www.w3.org/TR/xpath.
2. N. Bruno, N. Koudas, and D. Srivastava, "Holistic twig joins: optimal XML pattern matching," in SIGMOD, 2002, pp. 310-321.
3. T Chen, J. Lu, and T. W. Ling, "On boosting holism in XML twig pattern matching using structural indexing techniques," in SIGMOD, 2005, pp. 455-466.
4. M. Fontoura, V. Josifovski, E. Shekita, and B. Yang, "Optimizing cursor movement in holistic twig joins," in CIKM, 2005, pp. 784-791.
5. L. Qin, J. X. Yu, and B. Ding, "TwigList : make twig pattern matching fast," in DASFAA, 2007, pp. 850-862.
6. J. Lu, T. Chen, and T. W. Ling, "Efficient processing of XML twig patterns with parent child edges: a look-ahead approach," in CIKM, 2004, pp. 533-542.
7. T. Yu, T. W. Ling, and J. Lu, "TwigStackList-: A holistic twig join algorithm for twig query with not-predicates on XML data," in DASFAA, 2006, pp. 249-263.
8. H. Jiang, H. Lu, and W. Wang, "Efficient processing of XML twig queries with OR-predicates," in SIGMOD, 2004, pp. 59-70.
9. Z. Bar-Yossef, M. Fontoura, and V. Josifovski, "On the memory requirements of XPath evaluation over XML streams." J. Comput. Syst. Sci., vol. 73, no. 3, pp. 391-441, 2007.
10. V. Josifovski, M. Fontoura, and A. Barta, "Querying XML streams," The VLDB J., vol. 14, no. 2, pp. 197-210, 2005.
11. H. Jiang, W. Wang, H. Lu, and J. Yu, "Holistic twig joins on indexed XML documents," in VLDB, 2003.
12. B. Choi, M. Mahoui, and D. Wood, "On the optimality of holistic algorithms for twig queries," in DEXA, 2003, pp. 28-37.
13. A. Arasu, B. Babcock, S. Babu, J. McAlister, and J. Widom, "Characterizing memory requirements for queries over continuous data streams," ACM Trans. Database Syst., vol. 29, no. 1, pp. 162-194, 2004.
14. G. Gottlob, C. Koch, and R. Pichler, "The complex, of XPath query evaluation," in PODS, 2003, pp. 179-190.
15. L. Segoufin, "Typing and querying XML documents: Some complex. bounds," in PODS, 2003, pp. 167-178.
16. M. Götz, C. Koch, and W. Martens, "Efficient algorithms for the tree homeomorphism problem," in DBPL, 2007, pp. 17-31.
17. M. Grohe, C. Koch, and N. Schweikardt, '"light lower bounds for query processing on streaming and external memory data." in ICALP, 2005, pp. 1076-1088.
18. Z. Bar-Yossef, M. Fontoura, and V. Josifovski, "Buffering in query evaluation over XML streams," in PODS, 2005, pp. 216-227.
19. M. Grohe, Y Gurevich, D. Leindera, N. Schweikardt, J. Tyszkiewicz, and J. V. den Busse he, "Database query processing using finite cursor machines," in ICDT, 2007, pp. 284-298.