Giedrius Slivinskas
Christian S. Jensen
Richard Thomas Snodgrass
ABSTRACT
Time-referenced data are pervasive in most real-world databases. Recent advances in temporal query languages show that such database applications may benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query optimization and evaluation mechanisms must be provided, either within the DBMS proper or as a source level translation from temporal queries to conventional SQL. This paper proposes a new approach: using a middleware component on top of a conventional DBMS. This component accepts temporal SQL statements and produces a corresponding query plan consisting of algebraic as well as regular SQL parts. The algebraic parts are processed by the middleware, while the SQL parts are processed by the DBMS. The middleware uses performance feedback from the DBMS to adapt its partitioning of subsequent queries into middleware and DBMS parts. The paper describes the architecture and implementation of the temporal middleware component, termed TANGO, which is based on the Volcano extensible query optimizer and the XXL query processing library. Experiments with the system demonstrate the utility of the middleware's internal processing capability and its cost-based mechanism for apportioning the processing between the middleware and the underlying DBMS.
- 1.J. Van der Bercken, J. P. Dittrich, and B. Seeger. javax.XXL: A Prototype for a Library of Query Processing Algorithms. In Proceedings of ACM SIGMOD, Dallas, TX, p. 588 (2000).]] Google Scholar
Digital Library
- 2.M. H. Bohlen. Temporal Database System Implementations. ACM SIGMOD Record, 24(4): 53-60 (1995).]] Google ScholarDigital Library
- 3.M. H. Bohlen. The Tiger Temporal Database System. URL: <www.cs.auc.dk/tigeradm/>(current as of February 23, 2001).]]Google Scholar
- 4.W. Du, R. Krishnamurthy, and M.-C. Shan. Query Optimization in a Heterogeneous DBMS. In Proceedings of VLDB, Vancouver, Canada, pp. 277-291 (1992).]] Google ScholarDigital Library
- 5.R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Third Edition. Addison-Wesley (2000).]] Google ScholarDigital Library
- 6.O. Etzion, S. Jajodia, and S. Sripada (eds.). Temporal Databases: Research and Practice. LNCS 1399. Springer-Verlag (1998).]]Google Scholar
- 7.J. A. G. Gendrano, R. Shah, R. T. Snodgrass, and J. Yang. University Information System (UIS) Dataset. TIMECENTER CD-1, September, 1998.]]Google Scholar
- 8.G. Graefe and W. J. McKenna. The Volcano Optimizer Generator: Extensibility and Efficient Search. In Proceedings of IEEE ICDE, Vienna, Austria, pp. 209-218 (1993).]] Google ScholarDigital Library
- 9.H. Gunadhi and A. Segev. A Framework for Query Optimization in Temporal Databases. In Proceedings of SSDBM, Charlotte, NC, pp. 131-147 (1990).]] Google ScholarDigital Library
- 10.W. H. Inmon. Building the Data Warehouse. Second Edition. John Wiley and Sons (1996).]] Google ScholarDigital Library
- 11.M. Jarke and J. Koch. Query Optimization in Database Systems. ACM Computing Surveys, 16(2): 111-152 (1984).]] Google ScholarDigital Library
- 12.C. S. Jensen and R. T. Snodgrass. Temporal Data Management. IEEE Transactions on Knowledge and Data Engineering, 11(1):36-45, 1999.]] Google ScholarDigital Library
- 13.N. Kline and R. T. Snodgrass. Computing Temporal Aggregates. In Proceedings of IEEE ICDE, Taipei, Taiwan, pp. 222-231 (1995).]] Google ScholarDigital Library
- 14.T. Y. C. Leung and R. R. Muntz. Stream Processing: Temporal Query Processing and Optimization. In Temporal Databases: Theory, Design, and Implementation, A. U. Tansel et al. (eds.), Benjamin/Cummings, pp. 329-355 (1993).]]Google Scholar
- 15.T. M. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Second Edition. Prentice Hall (1999).]] Google ScholarDigital Library
- 16.M. T. Roth and P. M. Schwarz. Don't Scrap it, Wrap It! A Wrapper Architecture for Legacy Data Sources. In Proceedings of VLDB, Athens, Greece, pp. 266-275 (1997).]] Google ScholarDigital Library
- 17.A. Segev, G. Himawan, R. Chandra, and J. Shanthikumar. Selectivity Estimation of Temporal Data Manipulations. Information Sciences, 74(1-2): 111-149 (1993).]] Google ScholarDigital Library
- 18.I. Sitzmann and P. J. Stuckey. Improving Temporal Joins Using Histograms. In Proceedings of DEXA, London/Greenwich, UK, pp. 488-498 (2000).]] Google ScholarDigital Library
- 19.G. Slivinskas, C. S. Jensen, and R. T. Snodgrass. Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering. In Proceedings of IEEE ICDE,San Diego, CA, pp. 547-558 (2000).]] Google ScholarDigital Library
- 20.G. Slivinskas, C. S. Jensen, and R. T. Snodgrass. Adaptable Query Optimization and Evaluation in Temporal Middleware. TIMECENTER Technical Report TR-56, URL: <www.cs.auc.dk/TimeCenter/>(2001).]]Google Scholar
- 21.R. T. Snodgrass. Developing Time-Oriented Database Applications in SQL. Morgan Kaufmann (1999).]] Google ScholarDigital Library
- 22.K. Torp, C. S. Jensen, and R. T. Snodgrass. Stratum Approaches to Temporal DBMS Implementation. In Proceedings of IDEAS, Cardiff, Wales, pp. 4-13 (1998).]] Google ScholarDigital Library
- 23.K. Torp, C. S. Jensen, and R. T. Snodgrass. Effective Timestamping in Databases. The VLDB Journal, 8(3-4): 267-288 (2000).]] Google ScholarDigital Library
- 24.C. Vassilakis. An Optimisation Scheme for Coalesce/Valid Time Selection Operator Sequences. SIGMOD Record, 29(1): 38-43 (2000).]] Google ScholarDigital Library
- 25.C. Vassilakis, N. A. Lorentzos, and P. Georgiadis. Implementation of Transaction and Concurrency Control Support in a Temporal DBMS. Information Systems, 23(5): 335-350 (1998).]] Google ScholarDigital Library
- 26.G. Wiederhold. Mediation in Information Systems. ACM Computing Surveys, 27(2): 265-267 (1995).]] Google ScholarDigital Library
- 27.J. Yang, H. C. Ying, and J. Widom. TIP: A Temporal Extension to Informix. In Proceedings of ACM SIGMOD, Dallas, TX, p. 596 (2000).]] Google ScholarDigital Library
- 28.C. Yu and W. Meng. Principles of Database Query Processing for Advanced Applications. Morgan Kaufmann (1998).]] Google ScholarDigital Library
Index Terms
- Adaptable query optimization and evaluation in temporal middleware
Recommendations
Adaptable query optimization and evaluation in temporal middleware
Time-referenced data are pervasive in most real-world databases. Recent advances in temporal query languages show that such database applications may benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query ...
On adaptable middleware product lines
ARM '04: Proceedings of the 3rd workshop on Adaptive and reflective middlewareMiddleware helps to manage the complexity and heterogeneity inherent in distributed systems. Traditional middleware has a monolithic architecture, which makes it difficult to adapt to special requirements such as those present in embedded applications. ...
Adaptable Query Evaluation Using QBF
IDEAS '04: Proceedings of the International Database Engineering and Applications SymposiumThis paper shows how to provide adaptable query evaluation using QBF, a Query Broker Framework that provides a set of tools facilitating the design and implementation of query function in data-intensive distributed applications. The framework allows the ...
Comments