ProApproX: A Lightweight Approximation Query Processor Over Probabilistic Trees
The authors demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approximate, and observes the running behavior, pros, and cons, of each method, in terms of efficiency, precision of the result, and data model and query language supported. This paper presents the implementation of a system for querying probabilistic XML data, the probabilities expressing uncertainty about the stored information. The primary goal of this paper is to aid in exploratory tasks by providing quick approximate query results and statistical analysis with error bounds over discrete probabilistic XML data models.