Semantic-Tree-Efficient Processing Of Temporal XML

The XML, full name is Extensible Markup Language, with the advantages of simplicity, scalability, interoperability, and strong opening characteristics, is fast becoming standards for data exchange and transmission format having nothing to do with the techniques. In view of the wide range of applications in many areas, many of the XML researches are on the forefront and hot topics. For example, in the field of database, in a sense the use of XML as a database can denote nested data naturally and have stronger expression than the relational database. However, the XML indexes have a lot of imperfect places, to query the XML documents directly than the relational database is much far from up on efficiency. Academic research on the XML index has been a long time, even though there are some successes, a lot of places need to improve.In order to deal with the tense information which play an important role in e-commerce and e-government increasing areas, the tense XML generates, and becomes an emerging research branch of XML technology. Compared with the tense relational database, the tense XML has the data model which is more intuitive to express temporal information. Otherwise, the main application of XML is data storage in current. To improve inquiry efficiency on the temporal XML documents, the traditional XML indexing is not very effective, it can be said that the state still lack a number of XML-specific indexing technologies, and researches in this area is currently blank.In this paper, the data model of temporal XML is studied, based on which the indexing model is created. Through the creation of index, a query based on time is optimized. The XML model and temporal XML model are introduced in this paper firstly; followed by discussion of the general situation of research and application of the XML coding and analysis of the advantages and disadvantages of the current several popular coding methods, Simultaneously, the thought of reserve preorder coding based on preorder coding is brought forward; and then an improved method of the XMI index path is promoted, through combining node table, the semantic tree, and the semantic time division table together, the central idea of which is to encode each node of index tree of the path, stored in the node table can express XML document tree to determine inter-node ancestor / descendant relationship and parent / child relationship, can effectively support the path expression XPath query and keyword search, at the same time semantic tree is set up to constitute a semantic relationship between the relative and the same semantic node point of aggregation, to divide time period, to form a semantic form of time division, and fast search to a certain time interval corresponds to the node set; in succession, the setting indexing arithmetic, as well as updating, deleting and querying arithmetic are presented; Finally, the creation of the index is confirmed feasible and effective experimentally.