Sequence query processing
Praveen Seshadri, Miron Livny, Raghu Ramakrishnan · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1994
Many applications require the ability to manipulate sequences of data. We motivate the importance of sequence query processing, and present a framework for the optimization of sequence queries based on several novel techniques. These include query transformations, optimizations that utilize meta-data, and caching of intermediate results. We present a bottom-up algorithm that generates an efficient query evaluation plan based on cost estimates. This work also identifies a number of directions in which future research can be directed.
Cited by 125 works. doi:10.1145/191839.191926 Open-access PDF
Authors
References
- Access path selection in a relational database management system
- On optimizing an SQL-like nested query
- The temporal query language TQuel
- Composite Event Specification in Active Databases: Model & Implementation
- Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers
- Optimization of nested SQL queries revisited
- SEQ: A model for sequence databases
- Logical modeling of temporal data
- Query optimization for parallel execution
- The historical relational data model (HRDM) and algebra based on lifespans