Expressing and optimizing sequence queries in database systems

  • Authors:
  • Reza Sadri;Carlo Zaniolo;Amir Zarkesh;Jafar Adibi

  • Affiliations:
  • Procom Technology Inc., Irvine, California, CA;UCLA Computer Science Department, Los Angeles, California, CA;3Plus1 Technology, Inc., Saratoga, California, Saratoga, CA;Information Sciences Institute, USC, Marina del Rey, California, CA

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we investigate the design and optimization of a query language capable of expressing and supporting efficiently the search for complex sequential patterns in database systems. Thus, we first introduce SQL-TS, an extension of SQL to express these patterns, and then we study how to optimize the 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 interdependencies between the elements of a 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.