Incomplete Information in Relational Databases
From MaRDI portal
Cited in
(75)- Valuations in incomplete information databases
- Null values in nested relational databases
- On the representation and querying of sets of possible worlds
- A semantics for complex objects and approximate answers
- Inferring null join dependencies in relational databases
- Fuzzy information in extended fuzzy relational databases
- Unique complements and decompositions of database schemata
- The nested universal relation data model
- On representation and querying incomplete information in databases with bags
- Non-determinism in logic-based languages
- Incomplete deductive databases
- The complexity of query evaluation in indefinite temporal constraint databases
- Models of approximation in databases
- Scalar aggregation in inconsistent databases.
- An initial approach to the evaluation of possibilistic queries addressed to possibilistic databases.
- Querying temporal and spatial constraint networks in PTIME
- Towards an understanding of cloud services under uncertainty: a possibilistic approach
- Data summarization in relational databases through fuzzy dependencies
- Query answering over inconsistent knowledge bases: a probabilistic approach
- \(k\)-dominant skyline queries on incomplete data
- Invariance to ordinal transformations in rank-aware databases
- An information-theoretic approach to hierarchical clustering of uncertain data
- Evaluating Datalog via tree automata and cycluits
- Computing possible and certain answers over order-incomplete data
- A temporal database forecasting algebra
- Policy-based inconsistency management in relational databases
- Regular queries on graph databases
- Reasoning about functional and full hierarchical dependencies over partial relations
- About the processing of possibilistic queries involving a difference operation
- Games for query inseparability of description logic knowledge bases
- Certain answers as objects and knowledge
- Certain answers over incomplete XML documents: extending tractability boundary
- Querying incomplete information in RDF with SPARQL
- Extending relational algebra with similarities
- Classification of annotation semirings over containment of conjunctive queries
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Querying regular graph patterns
- Foundations for a fourth normal form over SQL-like databases
- Data cleaning and query answering with matching dependencies and matching functions
- Foundations of RDF Databases
- Solutions and query rewriting in data exchange
- A domain theoretic characterisation of the universal relation
- On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees
- FLEXIBLE ADJUSTMENT OF DATA: AN EXERCISE IN RELATIONAL ALGEBRA
- Probabilistic query answering over inconsistent databases
- Efficient processing of probabilistic set-containment queries on uncertain set-valued data
- Consistency and trust in peer data exchange systems
- Similarity-based relations in Datalog programs
- A Correspondence Between Variable Relations And Three-Valued Propositional Logic
- A paraconsistent relational data model
- Rough sets in incomplete information systems with order relations under Lipski's approach
- Fragments of Bag Relational Algebra: Expressiveness and Certain Answers
- Schema mappings: a case of logical dynamics in database theory
- Negative knowledge for certain query answers
- Queries and materialized views on probabilistic databases
- Data exchange and schema mappings in open and closed worlds
- Twofold rough approximations under incomplete information
- The notion of abstraction in ontology-based data management
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- Query languages for data exchange: beyond unions of conjunctive queries
- Containment of conjunctive queries on annotated relations
- Provenance in databases: principles and applications
- Provenance calculus and possibilistic logic: a parallel and a discussion
- \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models
- Query evaluation in probabilistic relational databases
- Approximating queries on probabilistic graphs
- Conjunctive queries on probabilistic graphs: the limits of approximability
- How database theory helps teach relational queries in database education (invited talk)
- A domain calculus based on Heyting-valued logic
- Consistent query answering in multi-relation databases
- Querying incomplete data: complexity and tractability via Datalog and first-order rewritings
- Querying data exchange settings beyond positive queries
- Towards an algebraic theory of information integration
- World-set decompositions: Expressiveness and efficient algorithms
- On database query languages for K-relations
This page was built for publication: Incomplete Information in Relational Databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770001)
