Incomplete Information in Relational Databases
Journal of the ACM (JACM)
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Horn tables-an efficient tool for handling incomplete information in databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A probabilistic relational data model
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
On the representation and querying of sets of possible worlds
Selected papers of the workshop on Deductive database theory
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Probabilistic deductive databases
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Aspects of partial information in databases
Aspects of partial information in databases
Semantic representations and query languages for or-sets
Journal of Computer and System Sciences
A probabilistic relational model and algebra
ACM Transactions on Database Systems (TODS)
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
Query evaluation in probabilistic relational databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
ProbView: a flexible probabilistic database system
ACM Transactions on Database Systems (TODS)
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logical approaches to incomplete information: a survey
Logics for databases and information systems
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tracing the lineage of view data in a warehousing environment
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Problem of Incomplete Information in Relational Databases
Problem of Incomplete Information in Relational Databases
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Modeling Uncertainty in Databases
Proceedings of the Seventh International Conference on Data Engineering
Learning Probabilistic Models of Relational Structure
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Why and Where: A Characterization of Data Provenance
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Reasoning about Uncertainty
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation
IEEE Transactions on Knowledge and Data Engineering
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Foundations of probabilistic answers to queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Working Models for Uncertain Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
From complete to incomplete information and back
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
World-set decompositions: Expressiveness and efficient algorithms
Theoretical Computer Science
High-Assurance Integrity Techniques for Databases
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Consensus answers for queries over probabilistic databases
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query Processing Techniques for Compliance with Data Confidence Policies
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
On the expressiveness of probabilistic XML models
The VLDB Journal — The International Journal on Very Large Data Bases
Representing uncertain data: models, properties, and algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
A unified approach to ranking in probabilistic databases
Proceedings of the VLDB Endowment
Foundations of uncertain-data integration
Proceedings of the VLDB Endowment
Faster query answering in probabilistic databases using read-once functions
Proceedings of the 14th International Conference on Database Theory
A unified approach to ranking in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Capturing continuous data and answering aggregate queries in probabilistic XML
ACM Transactions on Database Systems (TODS)
Local structure and determinism in probabilistic databases
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Semiring-annotated data: queries and provenance?
ACM SIGMOD Record
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
FARP: Mining fuzzy association rules from a probabilistic quantitative database
Information Sciences: an International Journal
On the connections between relational and XML probabilistic data models
BNCOD'13 Proceedings of the 29th British National conference on Big Data
| Hi-index | 0.00 |
We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite domains and we introduce a new kind of result, algebraic completion, for studying less expressive models. By viewing probabilistic models as incompleteness models with additional probability information, we define completeness and closure under query languages of general probabilistic database models and we introduce a new such model, probabilistic c-tables, that is shown to be complete and closed under the relational algebra.