An Improved XML Index Structural Connection Algorithm Based on Orthogonal B+ tree

Structural connection is one of the core operations in XML database query processing, and an efficient algorithm is the key to the query processing, which has been greatly concerned by the computer research community. After analyzing some current existed structural connection algorithms, this paper uses orthogonal B+ tree as storage and gives the structural connection algorithm with stack. The algorithm is further improved by considering of data replication during the algorithm process. The time complexity about the two algorithms is discussed, and the sample result is shown that the improved algorithm can perform query function better.