Hashbased subgraph query processing method for graphstructured XML documents

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 478-489

  Wang, Hongzhi ^a   Li, Jianzhong ^a   Luo, Jizhou ^a   Gao, Hong ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; PROCESSING; QUERY PROCESSING; TREES (MATHEMATICS);

BIPARTITE GRAPHS; GENERAL GRAPH; PROCESSING METHOD; QUERY PROCESSING TECHNIQUES; REACHABILITY QUERIES; STRUCTURAL JOIN; STRUCTURAL QUERY; TREE-STRUCTURED;

XML;

EID: 77949516821     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453909     Document Type: Article

References (28)

1. Introduction to Algorithms. MIT Press, Cambridge MA, 1990.
2. S. Al-Khalifa, H. V. Jagadish, J. M. Patel, Y. Wu, N. Koudas, and D. Srivastava. Structural joins: A primitive for efficient XML query pattern matching. ICDE 2002.
3. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: Optimal XML pattern matching. SIGMOD 2002.
4. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. VLDB 2005.
5. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. EDBT 2006.
6. S.-Y. Chien, Z. Vagena, D. Zhang, V. J. Tsotras, and C. Zaniolo. Efficient structural joins on indexed XML documents. VLDB 2002.
7. T. Grust. Accelerating XPath location steps. SIGMOD 2002.
8. H. He, H. Wang, J. Yang, and P. S. Yu. Compact reachability labeling for graph-structured data. CIKM2005.
9. H. Jiang, H. Lu, W. Wang, and B. C. Ooi. XR-Tree: Indexing XML data for efficient structural join. ICDE 2003.
10. H. Jiang, W. Wang, H. Lu, and J. X. Yu. Holistic twig joins on indexed xml documents. VLDB 2003.
11. T. Kameda. On the vector representation of the reachability in planar directed graphs. Information Process Letters, 3(3):78-80, 1975.
12. R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. SIGMOD 2002.
13. Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. VLDB 2001.
14. T. Milo and D. Suciu. Index structures for path expressions. ICDE 1999.
15. N. Polyzotis and M. N. Garofalakis. Structure and value synopses for XML data graphs. VLDB 2002.
16. N. Polyzotis, M. N. Garofalakis, and Y. E. Ioannidis. Selectivity estimation for XML twigs. ICDE 2004.
17. H. V. J. Rakesh Agrawal, Alexander Borgida. Efficient management of transitive relationships in large data and knowledge bases. SIGMOD 1989.
18. G. W. Ralf Schenkel, Anja Theobald. Hopi: An efficient connection index for complex xml document collections. EDBT 2004.
19. P. Rao and B. Moon. Prix: Indexing and querying xml using prÄufer sequences. ICDE 2004.
20. A. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse. XMark: A benchmark for XML data management. VLDB 2002.
21. M. S. S. T. Vassilis Christophides, Dimitris Plexousakis. On labeling schemes for the semantic web. WWW 2003.
22. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. ICDE 2006.
23. H. Wang, S. Park, W. Fan, and P. S. Yu. Vist: A dynamic index method for querying xml data by tree structures. SIGMOD 2003.
24. H. Wang, W. Wang, X. Lin, and J. Li. Labeling scheme and structural joins for graph-structured xml data. APWeb 2005.
25. W. Wang, H. Jiang, H. Lu, and J. X. Yu. PBiTree coding and efficient processing of containment joins. ICDE 2003.
26. C. Zhang, J. F. Naughton, D. J. DeWitt, Q. Luo, and G. M. Lohman. On supporting containment queries in relational database management systems. SIGMOD 2001.
27. V. J. T. Zografoula Vagena, Mirella Moura Moro. Twig query processing over graph-structured xml data. WebDB 2004.
28. H. K. U. Z. Edith Cohen, Eran Halperin. Reachability and distance queries via 2-hop labels. SODA 2002.