@conference {13375,
	title = {Indexing correlated probabilistic databases},
	booktitle = {Proceedings of the 35th SIGMOD international conference on Management of data},
	series = {SIGMOD {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {455 - 468},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc., effectively managing and querying them has become an important research direction. While there is an exhaustive body of literature on querying independent probabilistic data, supporting efficient queries over large-scale, correlated databases remains a challenge. In this paper, we develop efficient data structures and indexes for supporting inference and decision support queries over such databases. Our proposed hierarchical data structure is suitable both for in-memory and disk-resident databases. We represent the correlations in the probabilistic database using a junction tree over the tuple-existence or attribute-value random variables, and use tree partitioning techniques to build an index structure over it. We show how to efficiently answer inference and aggregation queries using such an index, resulting in orders of magnitude performance benefits in most cases. In addition, we develop novel algorithms for efficiently keeping the index structure up-to-date as changes (inserts, updates) are made to the probabilistic database. We present a comprehensive experimental study illustrating the benefits of our approach to query processing in probabilistic databases.},
	keywords = {caching, Indexing, inference queries, junction trees, Probabilistic databases},
	isbn = {978-1-60558-551-2},
	doi = {10.1145/1559845.1559894},
	url = {http://doi.acm.org/10.1145/1559845.1559894},
	author = {Kanagal,Bhargav and Deshpande, Amol}
}
