Continuous Query Processing Utilizing Follows Relationship between Queries in Stock Databases
You-Min Ha, Sang‐Wook Kim, Sanghyun Park · 2006
This paper analyzes the properties of user query for stock investment recommendation, and defines the 'following relation', which is a new relation between two queries. A following relation between two queries and a recommendation value X means 'If the recommendation value of a preceding Query is X, then a following query always has X as its recommendation value'. If there exists a following relation between , the recommendation value of is decided immediately by that of , therefore we can eliminate the running process for . We suggest two methods in this paper. The former method analyzes all the following relations among user queries and represents them as a graph. The latter searches the graph and decides the order of queries to be processed, in order to make the number of eliminated query-running process maximized. When we apply the suggested procedures that use the following relation, most of user queries do not need to be processed directly, hence the performance of running overall queries is greatly improved. We examined the superiority of the suggested methods through experiments using real stock market data. According to the results of our experiments, overall query processing time has reduced less than 10% with our proposed methods, compared to the traditional procedure.