Article

Predicate result range caching for continuous queries

Authors:

Michael J. FranklinAuthors Info & Claims

SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data

Pages 646 - 657

https://doi.org/10.1145/1066157.1066231

Published: 14 June 2005 Publication History

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.

References

[1]

H. Abelson, G. J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. MIT Press, 1994.]]

Digital Library

[2]

R. L. Burden and J. D. Faires. Numerical Analysis. Brooks/Cole, 2001.]]

[3]

S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. In VLDB, 1996.]]

Digital Library

[4]

R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.]]

Digital Library

[5]

L. Clewlow and C. Strickland. Energy Derivatives: Pricing and Risk Management. Lacima, 2000.]]

[6]

L. Clewlow and C. Strickland. Implementing Derivatives Models. Wiley, 2000.]]

[7]

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.]]

[8]

E. Dyson and E. Dean. Rfid: Logistics meets identity. Release 1.0, Vol. 21, No. 6, 2003.]]

[9]

R. Carney et al. Monitoring streams - a new class of data management applications. In VLDB, 2002.]]

Digital Library

[10]

R. Motwani et al. Query processing, approximation, and resource management in a data stream management system. In CIDR, 2003.]]

[11]

S. Chandrasekaran et. al. Telegraphcq: Continuous dataflow processing for an uncertain world. In CIDR, 2003.]]

[12]

F. J. Fabozzi. Band Markets, Analysis and Strategies. Prentice Hall, 2000.]]

[13]

Global financial data. http://www.globalfindata.com/.]]

[14]

G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 1993.]]

Digital Library

[15]

J. M. Hellerstein and J. Naughton. Query execution techniques for caching expensive predicates. In SIGMOD, 1996.]]

Digital Library

[16]

J. M. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In SIGMOD, 1993.]]

Digital Library

[17]

P. Jackel. Monte Carlo Methods in Finance. Wiley, 2002.]]

[18]

J. E. Dennis Jr. and R. B. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, 1996.]]

Digital Library

[19]

A. Kemper, G. Moerkotte, K. Peithner, and M. Steinbrunn. Optimizing disjunctive queries with expensive predicates. In SIGMOD, 1994.]]

Digital Library

[20]

D. Maier and J. Stein. Indexing in an object-oriented dbms. In Workshop on Object-Oriented Database Systems, 1996.]]

Digital Library

[21]

C. Olston, J. Widom, and J. Jiang. Adaptive filters for continuous queries over distributed data streams. In SIGMOD, 2003.]]

Digital Library

[22]

N. Shivakumar, H. Garcia-Molina, and C. S. Chekuri. Filtering with approximate predicates. In VLDB, 1998.]]

Digital Library

[23]

R. Stanton. Rational prepayment and the valuation of mortgage-backed securities. In Review of Financial Studies Vol. 8, No. 3, 1995.]]

[24]

Yahoo! finance. http://finance.yahoo.com/.]]

Cited By

Le-Phuoc DXavier Parreira JHauswirth M(2012)Linked Stream Data ProcessingReasoning Web. Semantic Technologies for Advanced Query Answering10.1007/978-3-642-33158-9_7(245-289)Online publication date: 2012
https://doi.org/10.1007/978-3-642-33158-9_7
Golab LÖzsu M(2010)Data Stream ManagementSynthesis Lectures on Data Management10.2200/S00284ED1V01Y201006DTM0052:1(1-73)Online publication date: Jan-2010
https://doi.org/10.2200/S00284ED1V01Y201006DTM005
Watanabe YKitagawa H(2010)Query result caching for multiple event-driven continuous queriesInformation Systems10.1016/j.is.2009.04.00335:1(94-110)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.is.2009.04.003
Show More Cited By

Predicate result range caching for continuous queries
1. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Adaptive Caching for Continuous Queries
ICDE '05: Proceedings of the 21st International Conference on Data Engineering

We 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.
- ...
Abstract
When 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

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data

June 2005

990 pages

ISBN:1595930604

DOI:10.1145/1066157

Conference Chair:
Fatma Ozcan
IBM Almaden Research Center

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS05

Sponsor:

SIGMOD/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems

June 14 - 16, 2005

Maryland, Baltimore

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
623
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Le-Phuoc DXavier Parreira JHauswirth M(2012)Linked Stream Data ProcessingReasoning Web. Semantic Technologies for Advanced Query Answering10.1007/978-3-642-33158-9_7(245-289)Online publication date: 2012
https://doi.org/10.1007/978-3-642-33158-9_7
Golab LÖzsu M(2010)Data Stream ManagementSynthesis Lectures on Data Management10.2200/S00284ED1V01Y201006DTM0052:1(1-73)Online publication date: Jan-2010
https://doi.org/10.2200/S00284ED1V01Y201006DTM005
Watanabe YKitagawa H(2010)Query result caching for multiple event-driven continuous queriesInformation Systems10.1016/j.is.2009.04.00335:1(94-110)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.is.2009.04.003
Golab LJohnson TSpatscheck OLee B(2008)PrefilterProceedings of the 2nd international workshop on Scalable stream processing system10.1145/1379272.1379280(29-37)Online publication date: 29-Mar-2008
https://dl.acm.org/doi/10.1145/1379272.1379280
Denny MFranklin M(2006)Adaptive execution of variable-accuracy functionsProceedings of the 32nd international conference on Very large data bases10.5555/1182635.1164175(547-558)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.5555/1182635.1164175
Krishnamurthy SWu CFranklin MYu CScheuermann PChaudhuri S(2006)On-the-fly sharing for streamed aggregationProceedings of the 2006 ACM SIGMOD international conference on Management of data10.1145/1142473.1142543(623-634)Online publication date: 27-Jun-2006
https://dl.acm.org/doi/10.1145/1142473.1142543
Denny MFranklin M(2006)Operators for Expensive Functions in Continuous QueriesProceedings of the 22nd International Conference on Data Engineering10.1109/ICDE.2006.110Online publication date: 3-Apr-2006
https://dl.acm.org/doi/10.1109/ICDE.2006.110

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten