The problem of incomplete information in relational databases
From MaRDI portal
Publication:1202165
zbMath0779.68023MaRDI QIDQ1202165
Publication date: 23 January 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)
Related Items (16)
Certain answers over incomplete XML documents: extending tractability boundary ⋮ Querying incomplete information in RDF with SPARQL ⋮ On representation and querying incomplete information in databases with bags ⋮ Querying disjunctive databases through nonmonotonic logics ⋮ The complexity of query evaluation in indefinite temporal constraint databases ⋮ Rough Sets in Incomplete Information Systems with Order Relations Under Lipski’s Approach ⋮ Models of approximation in databases ⋮ Sound and efficient closed-world reasoning for planning ⋮ \(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 ⋮ Data exchange and schema mappings in open and closed worlds ⋮ Towards an algebraic theory of information integration ⋮ A practical measure of the information in a logical theory ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ Unique complements and decompositions of database schemata
This page was built for publication: The problem of incomplete information in relational databases
