Abstract: In recent years, with the explosive growth of XML data, research on XML keyword query technology has received increasing attention. Data coding is the basis of keyword query. There are two main ways at present: path-based coding and interval coding. Interval coding can better adapt to the dynamic updating of XML data in queries, and thus has more advantages. This paper studies the keyword query problem based on interval coding and puts forward a new query algorithm. The algorithm firstly establishes an index according to the reserved interval value, and then selects and traverses the index according to the minimum range value, thereby reducing unnecessary comparison and achieving the purpose of improving query efficiency. The study found that the choice of reserved space has a certain impact on query efficiency. This paper designs an Interval Reservation Based on Node (IRBN) based on the node itself, sets the weight for the node, and sets the interval value according to the weight, forming an interval more balanced coding method according to the node’s own allocation. Experiments show that IRBN coding is reasonable and has high query efficiency.

Key words: XML, keyword query, interval reservation, IRBN