A semantics for complex objects and approximate answers

DOI10.1016/0022-0000(91)90035-4zbMath0764.68026OpenAlexW2058366603MaRDI QIDQ1176289

O. P. Buneman, A. Watters, Susan Davidson

Publication date: 25 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/12772780/1_s2.0_0022000091900354_main.pdf

zbMATH Keywords

complex objectsentity-relationship databasessandwich ordering

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55)

Related Items (6)

Semantics of a sequential language for exact real-number computation ⋮ Models of approximation in databases ⋮ A semantics for complex objects and approximate answers ⋮ Power domains and second-order predicates ⋮ The mixed powerdomain ⋮ Deduction with uncertain conditionals

Cites Work

• Fundamental properties of infinite trees
• A calculus for complex objects
• A semantics for complex objects and approximate answers
• Using powerdomains to generalize relational databases
• Power domains
• Incomplete Information in Relational Databases
• Extended algebra and calculus for nested relational databases
• Rough sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A semantics for complex objects and approximate answers