Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document

The information in many applications can be naturally represented as graph-structured XML document. Structural query on graph structured XML document matches the subgraph of graph structured XML document on some given schema. The query processing of graph-structured XML document brings new challenges. In this paper, for the processing of subgraph query, we design a subgraph join algorithm based on reachability coding. Using efficient data structure, subgraph join algorithm can process subgraph query with various structures efficiently.

[1]  Joseph Gil,et al.  Efficient subtyping tests with PQ-encoding , 2001, OOPSLA '01.

[2]  Ioannis G. Tollis,et al.  Dynamic Reachability in Planar Digraphs with One Source and One Sink , 1993, Theor. Comput. Sci..

[3]  Vassilis J. Tsotras,et al.  Twig query processing over graph-structured XML data , 2004, WebDB '04.

[4]  Beng Chin Ooi,et al.  XR-tree: indexing XML data for efficient structural joins , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[5]  Donald D. Chamberlin,et al.  XQuery: a query language for XML , 2003, SIGMOD '03.

[6]  Stefano Crespi-Reghizzi,et al.  A Decidability Theorem for a Class of Vector-Addition Systems , 1975, Inf. Process. Lett..

[7]  Dan Suciu,et al.  Index Structures for Path Expressions , 1999, ICDT.

[8]  Gerhard Weikum,et al.  HOPI: An Efficient Connection Index for Complex XML Document Collections , 2004, EDBT.

[9]  Jeffrey F. Naughton,et al.  Covering indexes for branching path queries , 2002, SIGMOD '02.

[10]  Ralf Schenkel.  FliX: A Flexible Framework for Indexing Complex XML Document Collections , 2004, EDBT Workshops.

[11]  Carlo Zaniolo,et al.  Efficient Structural Joins on Indexed XML Documents , 2002, VLDB.

[12]  Jan Chomicki,et al.  Hippo: A System for Computing Consistent Answers to a Class of SQL Queries , 2004, EDBT.

[13]  Vassilis Christophides,et al.  On labeling schemes for the semantic web , 2003, WWW '03.

[14]  Quanzhong Li,et al.  Indexing and Querying XML Data for Regular Path Expressions , 2001, VLDB.

[15]  Hongjun Lu,et al.  Holistic Twig Joins on Indexed XML Documents , 2003, VLDB.

[16]  Tiko Kameda,et al.  On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..

[17]  Steven J. DeRose,et al.  XML Path Language (XPath) , 1999 .

[18]  Stephen Alstrup,et al.  Small induced-universal graphs and compact implicit graph representations , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[19]  Torsten. Grust,et al.  Accelerating XPath location steps , 2002, SIGMOD '02.

[20]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[21]  Ioana Manolescu,et al.  XMark: A Benchmark for XML Data Management , 2002, VLDB.

[22]  Jignesh M. Patel,et al.  Structural joins: a primitive for efficient XML query pattern matching , 2002, Proceedings 18th International Conference on Data Engineering.

[23]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[24]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[25]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[26]  David J. DeWitt,et al.  On supporting containment queries in relational database management systems , 2001, SIGMOD '01.

[27]  Haim Kaplan,et al.  A comparison of labeling schemes for ancestor queries , 2002, SODA '02.

[28]  Ioana Manolescu,et al.  Assessing XML Data Management with XMark , 2002, EEXTT.

[29]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[30]  Hongjun Lu,et al.  PBiTree coding and efficient processing of containment joins , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[31]  Stéphane Bressan,et al.  Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web , 2003, Lecture Notes in Computer Science.