Abstract
The key to achieve the XML query language lies in creating valid XML algebra system. Most of the existing solutions for XML algebra system are an extension of the nested relational algebra and the major difficulty is that the computational complexity of the nested model - instance binding is too great to be effectively solved. This paper proposes an algorithm of XML algebraic system based on the distributed open computing model and then demonstrates its effectiveness in detail. By decomposing the binding process of query mode in the instance graph, this paper utilizes the message delivery to assemble the resulting tree and improve the overall computing performance. Therefore, it can provide effective support for the massive information integration and service system with the distributed open computing environment.
Sign-in/Register to access full text options 
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.
