Abstract
Query processing of graph-structured XML data is a rising topic in XML research field. This paper focuses on reachability query methods of graph-structured XML data. Encoding scheme of CDGX (Coding Directed Graph-structured XML data) is proposed in this paper, which not only can effectively solve the circle problem, but also avoiding a large number of intermediate data and saving storage space. And based on encoding scheme of CDGX, a new reachability query method RJDG (Reachability Judgment on Directed Graph) is put forward to. In RJDG, adjacent nodes in a same graph-structured XML document are got and stored beforehand. RJDG only needs to deal with the adjacent nodes to decide the reachability relationship between XML nodes. Experiments illustrate that RJDG is an efficient reachability query method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
