Recommendations
Cites work
- A deontic approach to database integrity
- A semantics for complex objects and approximate answers
- Can datalog be approximated?
- Database relations with null values
- Decomposition of domains
- Direct decompositions of atomistic algebraic lattices
- scientific article; zbMATH DE number 3880783 (Why is no real title available?)
- scientific article; zbMATH DE number 46995 (Why is no real title available?)
- scientific article; zbMATH DE number 176725 (Why is no real title available?)
- scientific article; zbMATH DE number 1231466 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Incomplete Information in Relational Databases
- On Databases with Incomplete Information
- On distributive quad-lattices
- On representation and querying incomplete information in databases with bags
- Principles of programming with complex objects and collection types
- Query languages for bags and aggregate functions
- Semantic representations and query languages for or-sets
- The mixed powerdomain
- The problem of incomplete information in relational databases
- The relational model with relation-valued attributes
- Using powerdomains to generalize relational databases
Cited in
(7)- Query languages for bags and aggregate functions
- Can datalog be approximated?
- Querying linguistic trees
- Random databases with approximate record matching
- Approximate answers in databases of labeled objects
- Three approaches to partiality in the sketch data model
- Approximate databases: a support tool for approximate reasoning
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)
