arrow
Return

A temporal database forecasting algebra

delete2013-09-01
delete7
delete
OA
AI
F
Francesco Parisi *
A
Amy Sliva
V
V. S. Subrahmanian
DOI:10.1016/j.ijar.2013.01.010delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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 trade-offs 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. (C) 2013 Elsevier Inc. All rights reserved.
Keywords:
Temporal databases
Predictive databases
Forecasting algebra
Temporal algebra
Forecasting queries
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Approximate Reasoning cover
International Journal of Approximate Reasoning
IF:
3
Papers:
2.9K
Citations:
5.1K

Organization

U
University of Calabria
Scholars:
8.2K
Papers: 8.0K
Citations: 7.8K
N
Northeastern University
Scholars:
2.4W
Papers: 1.5W
Citations: 3.0W
University System of Maryland cover
University System of Maryland
Scholars:
6.4W
Papers: 5.6W
Citations: 113
researcher View more organizations