In the process of analyzing the large-scale network security situation,the data we faced are always flooded and messy,and the information is difficult to obtain with respond to the query timely.Online analytical proce...In the process of analyzing the large-scale network security situation,the data we faced are always flooded and messy,and the information is difficult to obtain with respond to the query timely.Online analytical processing which use the Data-cube as a data source directly,calculated all or part of the Data-cube in advance,and it can reduce the query response time significantly.This paper considers a class of queries,called the Partial-MAX/MIN query.We introduce Rank Decision Tree(RD-Tree) and it’s searching algorithm for efficient processing of the partial-max/min queries.Through experiments,we show our approach has an efficient processing capability for partial-max/min queries.展开更多
文摘In the process of analyzing the large-scale network security situation,the data we faced are always flooded and messy,and the information is difficult to obtain with respond to the query timely.Online analytical processing which use the Data-cube as a data source directly,calculated all or part of the Data-cube in advance,and it can reduce the query response time significantly.This paper considers a class of queries,called the Partial-MAX/MIN query.We introduce Rank Decision Tree(RD-Tree) and it’s searching algorithm for efficient processing of the partial-max/min queries.Through experiments,we show our approach has an efficient processing capability for partial-max/min queries.
