Optimization of sequence queries in database systems
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophisticated sequential pattern queries in databases. Thus, we first introduce SQL-TS, an extension of SQL, to express these patterns, and then we study how to optimize search queries for this language. We take the optimal text search algorithm of Knuth, Morris and Pratt, and generalize it to handle complex queries on sequences. Our algorithm exploits the inter-dependencies between the elements of a sequential pattern to minimize repeated passes over the same data. Experimental results on typical sequence queries, such as double bottom queries, confirm that substantial speedups are achieved by our new optimization techniques.
The phenomenon of mis-placinging and chaotically laying of books is an urgent problem to be solved.In order to improve the efficiency of library loan services,it is necessary to provide more publications and information to readers,meanwhile to adopt quantitative management methods.Based on open,fair and equal grounds,it is to establish scientifically assessment and quantization criteria,to promote the systems of individual responsibitiy,to set relay shelves,and classify and arrange books on a regular basis.