Time-constrained query processing in CASE-DB
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 7 (6) , 865-884
- https://doi.org/10.1109/69.476494
Abstract
CASE-DB is a real-time, single-user, relational prototype DBMS that permits the specification of strict time constraints for relational algebra queries. Given a time constrained nonaggregate relational algebra query and a 驴fragment chain驴 for each relation involved in the query, CASE-DB initially obtains a response to a modified version of the query and then uses an 驴iterative query evaluation驴 technique to successively improve and evaluate the modified version of the query. CASE-DB controls the risk of overspending the time quota at each step using a 驴risk control technique.驴Keywords
This publication has 10 references indexed in Scilit:
- Monotonically improving approximate answers to relational algebra queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An object-oriented query processor that produces monotonically improving approximate answersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generalization and a framework for query modificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Processing time-constrained aggregate queries in CASE-DBACM Transactions on Database Systems, 1993
- Statistical estimators for aggregate relational algebra queriesACM Transactions on Database Systems, 1991
- Processing aggregate relational queries with hard time constraintsACM SIGMOD Record, 1989
- Statistical profile estimation in database systemsACM Computing Surveys, 1988
- Statistical estimators for relational algebra expressionsPublished by Association for Computing Machinery (ACM) ,1988
- Set query optimization in distributed database systemsACM Transactions on Database Systems, 1986
- Estimating record selectivitiesInformation Systems, 1983