A semantics for complex objects and approximate queries

Authors:
Peter Buneman;Susan Davidson;Aaron Watters
Affiliations:
Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Venue:
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1988

Citing 9
Cited 5

A new normal form for nested relations

ACM Transactions on Database Systems (TODS)
A calculus for complex objects

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An algebraic semantics approach to the effective resolution of type equations

Theoretical Computer Science
Querying independent databases

Information Sciences: an International Journal
Using powerdomains to generalize relational databases

Theoretical Computer Science
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
IFO: a formal semantic database model

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Domains for Denotational Semantics

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Extended Algebra and Calculus for ~1NF Relational Databases

Extended Algebra and Calculus for ~1NF Relational Databases

Relating total and partial correctness interpretations of non-deterministic programs

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Outer Joins and Filters for Instantiating Objects from Relational Databases Through Views

IEEE Transactions on Knowledge and Data Engineering
Histogram-Based Approximation of Set-Valued Query-Answers

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Multi-Resolution Relational Data Model

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
A calculus of logical relations for over- and underapproximating static analyses

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new definition of complex objects is introduced which provides a denotation for incomplete tuples as well as partially described sets. Set values are “sandwiched” between “complete” and “consistent” descriptions (representing the Smyth and Hoare powerdomains respectively), allowing the maximal values to be arbitrary subsets of maximal elements in the domain of the set. We also examine the use of rules in defining queries over such objects.