PUBLICATIONS

A Temporal Database Forecasting Algebra

Parisi1, F., Sliva2, A., and Subrahmanian3, V.

International Journal of Approximate Reasoning, vol. 54, no. 7. (September 2013)

Though forecasting methods are used in numerous fields, we have seen no work on providing a general theoretical framework to build forecast operators into temporal databases, producing an algebra that extends the relational algebra. In this paper, we first develop a formal definition of a forecast operator as a function that satisfies a suite of forecast axioms. Based on this definition, we propose three families of forecast operators called deterministic, probabilistic, and possible worlds forecast operators. Additional properties of coherence, orthogonality, monotonicity, and fact preservation are identified that these operators may satisfy (but are not required to). We show how deterministic forecast operators can always be encoded as probabilistic forecast operators, and how both deterministic and probabilistic forecast operators can be expressed as possible worlds forecast operators. Issues related to the complexity of these operators are studied, showing the relative computational tradeoffs of these types of forecast operators. We explore the integration of different forecast operators with standard relational operators in temporal databases—including extensions of the relational algebra for the probabilistic and possible worlds cases—and propose several policies for answering forecast queries. Instances where these different forecast policies are equivalent have been identified, and can form the basis of query optimization in forecasting. These policies are evaluated empirically using a prototype implementation of a forecast query answering system and several forecast operators.

1 Universita della Calabria
2 Charles River Analytics
3 University of Maryland

For More Information

To learn more or request a copy of a paper (if available), contact Amy Sliva.

(Please include your name, address, organization, and the paper reference. Requests without this information will not be honored.)