ABSTRACT
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be expressed declaratively, but the continuous query processors developed to date are not designed to optimize queries with expensive functions. To speed up such queries, we present CASPER: the CAching System for PrEdicate Result ranges. CASPER computes and caches predicate result ranges, which are ranges of stream input values where the system knows the results of expensive predicate evaluations. Over time, CASPER expands ranges so that they are more likely to contain future stream values. This paper presents the CASPER architecture, as well as algorithms for computing and expanding ranges for a large class of predicates. We demonstrate the effectiveness of CASPER using a prototype implementation and a financial application using real bond market data.
- H. Abelson, G. J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. MIT Press, 1994.]] Google ScholarDigital Library
- R. L. Burden and J. D. Faires. Numerical Analysis. Brooks/Cole, 2001.]]Google Scholar
- S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. In VLDB, 1996.]] Google ScholarDigital Library
- R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.]] Google ScholarDigital Library
- L. Clewlow and C. Strickland. Energy Derivatives: Pricing and Risk Management. Lacima, 2000.]]Google Scholar
- L. Clewlow and C. Strickland. Implementing Derivatives Models. Wiley, 2000.]]Google Scholar
- C. Downing, R. Stanton, and N. Wallace. An empirical test of a two-factor mortgage valuation model: Do housing prices matter? Working Paper, UC Berkeley, 2002.]]Google Scholar
- E. Dyson and E. Dean. Rfid: Logistics meets identity. Release 1.0, Vol. 21, No. 6, 2003.]]Google Scholar
- R. Carney et al. Monitoring streams - a new class of data management applications. In VLDB, 2002.]] Google ScholarDigital Library
- R. Motwani et al. Query processing, approximation, and resource management in a data stream management system. In CIDR, 2003.]]Google Scholar
- S. Chandrasekaran et. al. Telegraphcq: Continuous dataflow processing for an uncertain world. In CIDR, 2003.]]Google Scholar
- F. J. Fabozzi. Band Markets, Analysis and Strategies. Prentice Hall, 2000.]]Google Scholar
- Global financial data. http://www.globalfindata.com/.]]Google Scholar
- G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 1993.]] Google ScholarDigital Library
- J. M. Hellerstein and J. Naughton. Query execution techniques for caching expensive predicates. In SIGMOD, 1996.]] Google ScholarDigital Library
- J. M. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In SIGMOD, 1993.]] Google ScholarDigital Library
- P. Jackel. Monte Carlo Methods in Finance. Wiley, 2002.]]Google Scholar
- J. E. Dennis Jr. and R. B. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, 1996.]] Google ScholarDigital Library
- A. Kemper, G. Moerkotte, K. Peithner, and M. Steinbrunn. Optimizing disjunctive queries with expensive predicates. In SIGMOD, 1994.]] Google ScholarDigital Library
- D. Maier and J. Stein. Indexing in an object-oriented dbms. In Workshop on Object-Oriented Database Systems, 1996.]] Google ScholarDigital Library
- C. Olston, J. Widom, and J. Jiang. Adaptive filters for continuous queries over distributed data streams. In SIGMOD, 2003.]] Google ScholarDigital Library
- N. Shivakumar, H. Garcia-Molina, and C. S. Chekuri. Filtering with approximate predicates. In VLDB, 1998.]] Google ScholarDigital Library
- R. Stanton. Rational prepayment and the valuation of mortgage-backed securities. In Review of Financial Studies Vol. 8, No. 3, 1995.]]Google ScholarCross Ref
- Yahoo! finance. http://finance.yahoo.com/.]]Google Scholar
- Predicate result range caching for continuous queries
Recommendations
Adaptive Caching for Continuous Queries
ICDE '05: Proceedings of the 21st International Conference on Data EngineeringWe address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as conventional maintenance of materialized join views. Our ...
Query result caching for multiple event-driven continuous queries
With the increasing demands for advanced use of streaming data, efficient execution of continuous queries is an important research issue. This paper focuses on event-driven continuous queries that are activated by foreign events such as data arrival and ...
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
Highlights- Using containments of conjunctive queries (CQ) to express boolean queries.
- ...
AbstractWhen a relational database is queried, the result is normally a relation. Some queries, however, only require a yes/no answer; such queries are often called boolean queries. It is customary in database theory to express boolean queries ...
Comments