TemProRA: Top-k temporal-probabilistic results analysis
Authors:
- 1 May 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1382-1385
Abstract
The study of time and probability, as two combined dimensions in database systems, has focused on the correct and efficient computation of the probabilities and time intervals. However, there is a lack of analytical information that allows users to understand and tune the probability of time-varying result tuples. In this demonstration, we present TemProRA, a system that focuses on the analysis of the top-k temporal probabilistic results of a query. We propose the Temporal Probabilistic Lineage Tree (TPLT), the Temporal Probabilistic Bubble Chart (TPBC) and the Temporal Probabilistic Column Chart (TPCC): for each output tuple these three tools are created to provide the user with the most important information to systematically modify the time-varying probability of result tuples. The effectiveness and usefulness of TemProRA are demonstrated through queries performed on a dataset created based on data from Migros, the leading Swiss supermarket branch.Keywords
This publication has 12 references indexed in Scilit:
- Comprehensive and interactive temporal query processing with SAP HANAProceedings of the VLDB Endowment, 2013
- Top-k query processing in probabilistic databases with non-materialized views2013
- Query time scaling of attribute values in interval timestamped databases2013
- Temporal query processing in Teradata2013
- Sensitivity analysis and explanations for robust query evaluation in probabilistic databases2011
- Approximate confidence computation in probabilistic databases2010
- Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases2008
- Efficient Top-k Query Evaluation on Probabilistic Data2007
- MayBMS: Managing Incomplete Information with Probabilistic World-Set Decompositions2007
- MYSTIQ2005