Models of approximation in databases
From MaRDI portal
Publication:1389445
DOI10.1016/S0304-3975(97)00090-XzbMATH Open0903.68059OpenAlexW1991388416MaRDI QIDQ1389445FDOQ1389445
Authors: Leonid Libkin 
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00090-x
Recommendations
Cites Work
- Incomplete Information in Relational Databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The problem of incomplete information in relational databases
- Using powerdomains to generalize relational databases
- On Databases with Incomplete Information
- Title not available (Why is that?)
- On distributive quad-lattices
- Database relations with null values
- The relational model with relation-valued attributes
- Principles of programming with complex objects and collection types
- Direct decompositions of atomistic algebraic lattices
- Title not available (Why is that?)
- A semantics for complex objects and approximate answers
- The mixed powerdomain
- Query languages for bags and aggregate functions
- Decomposition of domains
- On representation and querying incomplete information in databases with bags
- A deontic approach to database integrity
- Can datalog be approximated?
- Semantic representations and query languages for or-sets
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Models of approximation in databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389445)
