Read-once functions and query evaluation in probabilistic databases
Open Access
- 1 September 2010
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 3 (1-2) , 1068-1079
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- PrDB: managing and exploiting rich correlations in probabilistic databasesThe VLDB Journal, 2009
- The trichotomy of HAVING queries on a probabilistic databaseThe VLDB Journal, 2009
- Using OBDDs for Efficient Query Evaluation on Probabilistic Databases2008
- A Simple Linear Time LexBFS Cograph Recognition AlgorithmSIAM Journal on Discrete Mathematics, 2008
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-treesDiscrete Applied Mathematics, 2006
- A simple linear time algorithm for cograph recognitionDiscrete Applied Mathematics, 2005
- A probabilistic relational algebra for the integration of information retrieval and database systemsACM Transactions on Information Systems, 1997
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- The Fanout Structure of Switching FunctionsJournal of the ACM, 1975