Incomplete Information in Relational Databases
From MaRDI portal
Publication:3770001
DOI10.1145/1634.1886zbMath0632.68094OpenAlexW1990391007WikidataQ56698644 ScholiaQ56698644MaRDI QIDQ3770001
Tomasz Imielinski, Witold jun. Lipski
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1634.1886
relational databaseincomplete informationrelational algebraquery processingnull valuesmarked nullsquery language semantics
Related Items (66)
Certain answers over incomplete XML documents: extending tractability boundary ⋮ Querying incomplete information in RDF with SPARQL ⋮ The nested universal relation data model ⋮ A domain theoretic characterisation of the universal relation ⋮ Certain answers as objects and knowledge ⋮ On representation and querying incomplete information in databases with bags ⋮ Extending relational algebra with similarities ⋮ Towards an understanding of cloud services under uncertainty: a possibilistic approach ⋮ Non-determinism in logic-based languages ⋮ Incomplete deductive databases ⋮ Querying Regular Graph Patterns ⋮ The complexity of query evaluation in indefinite temporal constraint databases ⋮ Data cleaning and query answering with matching dependencies and matching functions ⋮ Rough Sets in Incomplete Information Systems with Order Relations Under Lipski’s Approach ⋮ Regular queries on graph databases ⋮ Twofold rough approximations under incomplete information ⋮ Valuations in incomplete information databases ⋮ Null values in nested relational databases ⋮ Classification of annotation semirings over containment of conjunctive queries ⋮ Solutions and query rewriting in data exchange ⋮ Models of approximation in databases ⋮ A Correspondence Between Variable Relations And Three-Valued Propositional Logic ⋮ A paraconsistent relational data model ⋮ Foundations for a Fourth Normal Form over SQL-Like Databases ⋮ Consistency and trust in peer data exchange systems ⋮ The notion of abstraction in ontology-based data management ⋮ On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees ⋮ Scalar aggregation in inconsistent databases. ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ An initial approach to the evaluation of possibilistic queries addressed to possibilistic databases. ⋮ Query languages for data exchange: beyond unions of conjunctive queries ⋮ Containment of conjunctive queries on annotated relations ⋮ Probabilistic query answering over inconsistent databases ⋮ Efficient processing of probabilistic set-containment queries on uncertain set-valued data ⋮ Reasoning about functional and full hierarchical dependencies over partial relations ⋮ On the representation and querying of sets of possible worlds ⋮ A semantics for complex objects and approximate answers ⋮ FLEXIBLE ADJUSTMENT OF DATA: AN EXERCISE IN RELATIONAL ALGEBRA ⋮ Data summarization in relational databases through fuzzy dependencies ⋮ \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models ⋮ World-set decompositions: Expressiveness and efficient algorithms ⋮ Query evaluation in probabilistic relational databases ⋮ SIMILARITY-BASED RELATIONS IN DATALOG PROGRAMS ⋮ Inferring null join dependencies in relational databases ⋮ Queries and materialized views on probabilistic databases ⋮ Data exchange and schema mappings in open and closed worlds ⋮ Towards an algebraic theory of information integration ⋮ On database query languages for K-relations ⋮ About the processing of possibilistic queries involving a difference operation ⋮ \(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 ⋮ Foundations of RDF Databases ⋮ Fragments of Bag Relational Algebra: Expressiveness and Certain Answers ⋮ Evaluating Datalog via tree automata and cycluits ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach ⋮ Fuzzy information in extended fuzzy relational databases ⋮ Schema Mappings: A Case of Logical Dynamics in Database Theory ⋮ Computing possible and certain answers over order-incomplete data ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ Unique complements and decompositions of database schemata ⋮ Negative Knowledge for Certain Query Answers ⋮ Games for query inseparability of description logic knowledge bases ⋮ A temporal database forecasting algebra ⋮ Policy-based inconsistency management in relational databases
This page was built for publication: Incomplete Information in Relational Databases
