Database Paper Browser

Back to papers

A Semantics for Complex Objects and Approximate Queries

Summary: Defines semantics for complex objects (incomplete tuples, partially described sets) by "sandwiching" set values between Smyth and Hoare powerdomains to allow maximal values as arbitrary subsets of domain maxima. Examines rule-based queries over them. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
841
Venue
PODS
Year
1988
Pagerank
6.9016174e-05
Overall Rank
3,630 | 74.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
361 Histogram-Based Approximation of Set-Valued Query Answers 1999 VLDB 0.00025775749
6,442 A Multi-Resolution Relational Data Model 1992 VLDB 5.060174e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
440 A Calculus for Complex Objects 1986 PODS 0.00023084404
1,052 A Normal Form for Nested Relations 1985 PODS 0.00014436103
3,383 IFO: A Formal Semantic Database Model (Preliminary Report) 1984 PODS 7.1595023e-05
Previous Page 1 / 1 Next

Semantically Similar Papers