Probabilistic aggregates

Robert Ross, V. S. Subrahmanian, John Grant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


Though extensions of the relational model of data have beenproposed to handle probabilistic information, there has been no work todate on handling aggregate operators in such databases. In this paper, we show how classical aggregation operators (like COUNT, SUM, etc.)as well as other statistical operators (like weighted average, variance, etc.) can be defined as well as implemented over probabilistic databases. We define these operations, develop a formal linear program model for computing answers to such queries, and then develop a generic algorithm to compute aggregates.

Original languageEnglish (US)
Title of host publicationFoundations of Intelligent Systems - 13th International Symposium, ISMIS 2002, Proceedings
EditorsMohand-Said Hacid, Zbigniew W. Ras, Djamel A. Zighed, Yves Kodratoff
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540437851, 9783540437857
StatePublished - 2002
Externally publishedYes
Event13th International Symposium on Methodologies for Intelligent Systems, ISMIS 2002 - Lyon, France
Duration: Jun 27 2002Jun 29 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2366 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Symposium on Methodologies for Intelligent Systems, ISMIS 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Probabilistic aggregates'. Together they form a unique fingerprint.

Cite this