Praveen Seshadri
ABSTRACT
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.
- BR91.Catriel Beeri and Raghu Ramakrishnan. On the power of Magic. Journal of Logic Programming, 10(3&:4):255-300, 1991. Google Scholar
Digital Library
- CC87.James Clifford and Albert Croker. The historical data model and algebra based on lifespans. In Proceedings of the International Conference on Data Engineering, pages 528-537, 1987. Google ScholarDigital Library
- Day87.Umeshwar Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates and quantifiers. In Proceedings of A CM SIGMOD '87 International Conference on Management of Data, San Francisco, CA, pages 23- 33, 1987. Google ScholarDigital Library
- EWK90.Ramez Elmasri, Gene Wuu, and Yeung-Joon Kim. The time index : An access structure for temporal data. In Proceedings of the International Conference on Very Large Databases(VLDB), pages 1-12, 1990. Google ScholarDigital Library
- Gad86.S.K. Gadia. Towards a multihomogenous model for a temporal database. In Proceedings of the International Conference on Data Engineering, pages 390- 397, 1986. Google ScholarDigital Library
- GHK92.Sumit Ganguly, Waqar Hasan, and Ravi Krishnamurthy. Query optimization for parallel execution. In Proceedings of A CM SIGMOD '92 International Conference on Management of Data, San Diego, CA, pages 9-18, 1992. Google ScholarDigital Library
- GJS92.N.H Gehani, H.V. Jagadish, and O. Shmueli. Composite event specification in active databases: Model and implementation. In Proceedings of the International Conference on Very Large Databases(VLDB), pages 327-338, 1992. Google ScholarDigital Library
- GS89a.Himawan Gunadhi and Arie Segev. Event-join optimization in temporal relational databases. In Proceedings of the Fifteenth International Conference on Very Large Databases (VLDB), Amsterdam, Netherlands, 1989. Google ScholarDigital Library
- GS89b.Himawan Gunadhi and Arie Segev. A framework for query optimization in temporal databases. In Fifth International Conference on Statistical and Scientific Database Management Systems, 1989. Google ScholarDigital Library
- GS91.Himawan Gunadhi and Arie Segev. Query processing algorithms for temporal intersection joins. In Proceedings of the International Conference on Data Engineemng, 1991. Google ScholarDigital Library
- GW87.Richard A. Ganski and Harry K.T. Wong. Optimization of nested sql queries revisited. In Proceedings of A CM SIGMOD '87 International Conference on Management of Data, San Francisco, CA, pages 23- 33, 1987. Google ScholarDigital Library
- JCG+92.C.S. Jensen, J. Clifford, S.K. Gadia, A. Segev, and R.T. Snodgrass. A glossary of temporal database concepts. SIGMOD Record, 21(3), sep 1992. Google ScholarDigital Library
- Kim82.W. Kim. On optimizing an sql-like nested query. A CM Transactions on Database Systems, 7, September 1982. Google ScholarDigital Library
- LM93.Cliff T.Y. Leung and Richard R. Muntz. Temporal Databases, Theory, Design and Implementation, chapter 14. Benjamin/Cummings, 1993.Google Scholar
- LS89.David Lomet and Betty Salzberg. Access methods for multiversion data. In Proceedings of A CM SIG- MOD International COnference on Management of Data, pages 315-324, 1989. Google ScholarDigital Library
- NA89.S.B. Navathe and R. Ahmed. A temporal relational model and a query language. Information Sciences, 49:147-175, 1989. Google ScholarDigital Library
- NG93.Sunil S. Nair and Shashi K. Gadia. Algebraic optimization in a relational model for temporal databases. In Richard Snodgrass, editor, Proceedings of the International Workshop on an Infrastructure for Temporal Databases, pages 390-397, Arlington, Texas, 1993.Google Scholar
- Ric92.Joel Richardson. Supporting lists in a data model. In Proceedings of the International Conference on Very Large Databases(VLDB), pages 127-138, 1992. Google ScholarDigital Library
- RS87.Doron Rotem and Arie Segev. Physical organization of temporal data. In Proceedings of the International Conference on Data Engineering, pages 547-553, 1987. Google ScholarDigital Library
- SK86.Arie Shoshani and Kyoji Kawagoe. Temporal data management. In Proceedings of the Twelfth International Conference on Very Large Databases (VLDB), Kyoto, Japan, pages 79-88, 1986. Google ScholarDigital Library
- SLR.Praveen Seshadri, Miron Livny, and Raghu Ramakrishnan. Seq: A framework for sequence databases. Submitted for publication.Google Scholar
- SMALP79.Patricia G. Selinger, D. Chamberlin M. Astrahan, Raymond Lorie, and T. Price. Access path selection in a relational database management system. In Proceedings of A CM SIGMOD '79 International Conference on Management of Data, pages 23-34, 1979. Google ScholarDigital Library
- Sno87.Richard Snodgrass. The temporal query language tquel. A CM Transactions on Database Systems, 12(2):247-298, June 1987. Google ScholarDigital Library
- Soo91.Michael D. Soo. Bibliography on temporal databases. ACM SIGMOD Record, 20(1):14-23, March 1991. Google ScholarDigital Library
- SP90.D. Stott Parker. Stream Data Analysis in Prolog, chapter 8. MIT Press, 1990.Google Scholar
- SPL.Praveen Seshadri, Hamid Pirahesh, and Cliff Leung. Decorrelating complex queries. Submitted for Publication.Google Scholar
- SS87.Arie Segev and Arie Shoshani. Logical modelling of temporal data. In Proceedings of A CM SIGMOD '87 International Conference on Management of Data, San Francisco, CA, pages 454-466, 1987. Google ScholarDigital Library
- SS88.Arie Segev and Arie Shoshani. The representation of a temporal data model in the relational environment. In Proceedings of the #th Conference on Statistical and Sczentific Database Management, pages 39-61, June 1988. Google ScholarDigital Library
- WD92.Gene Wuu and Umeshwar Dayal. A uniform model for temporal object-oriented databases. In Proceedings of the International Conference on Data Engineering, 1992. Google ScholarDigital Library
Index Terms
- Sequence query processing
Recommendations
Interleaving a Join Sequence with Semijoins in Distributed Query Processing
The problem of combining join and semijoin reducers for distributed query processing is studied. An approach based on interleaving a join sequence with beneficial semijoins is proposed. A join sequence is mapped into a join sequence tree first. The join ...
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Comments