Abstract
Because of the characteristics of temporal constraints, there may be a relationship between structural and temporal information in temporal XML. This chapter focuses on this and studies a temporal XML index based on linear order. Firstly, it discusses linear order partition, which provides a mathematical framework to the temporal index. Secondly, it researches algorithms on linear order branches, which are crucial in creating the index. Thirdly, it studies the querying paths based on temporal XML. Finally, it implements simulations with large number of testing data whose results indicate that the index is feasible and effective.
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.
