A METHOD FOR SEARCHING AN INDEX FOR SUBSEQUENCE MATCHING IN TIME-SERIES DATABASES

摘要

Index search method in a time series in the subsequence matching database of the invention is the entry including by generating R- tree for query window within the main memory unit and the access point node in the tree for R- data point from the window to the disk node perform the range query to a e-MBR extend MBR representing ε / p ^1/2 as long as the range in the R- tree for the query window points. In this way, a pair of points corresponding to the query window point and said entry determines access whether to access the required nodes are returned to the range query to each node in the window - the effective index method, which returns the index search results by using the join It relates.; According to the invention, according to the present invention, each node from the disk is to reduce the cost of multi-dimensional index search to reduce the number of times accessed since once access and to prevent the adoption of the error index step in advance.