Models of approximation in databases

DOI10.1016/S0304-3975(97)00090-XzbMath0903.68059OpenAlexW1991388416MaRDI QIDQ1389445

Leonid O. 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

zbMATH Keywords

powerdomainspartial informationdatabasesapproximate answers

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Query languages for bags and aggregate functions ⋮ Querying linguistic trees

Cites Work

• Principles of programming with complex objects and collection types
• Database relations with null values
• The relational model with relation-valued attributes
• A semantics for complex objects and approximate answers
• Using powerdomains to generalize relational databases
• The mixed powerdomain
• The problem of incomplete information in relational databases
• Direct decompositions of atomistic algebraic lattices
• On representation and querying incomplete information in databases with bags
• A deontic approach to database integrity
• Query languages for bags and aggregate functions
• Can datalog be approximated?
• Semantic representations and query languages for or-sets
• Incomplete Information in Relational Databases
• On Databases with Incomplete Information
• On distributive quad-lattices
• Decomposition of domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Models of approximation in databases