Article

Free access

A semantics for complex objects and approximate queries

Authors:

Peter Buneman,

Susan Davidson,

Aaron WattersAuthors Info & Claims

PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 305 - 314

https://doi.org/10.1145/308386.308463

Published: 01 March 1988 Publication History

PDF eReader

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.

References

[1]

F Bancflhon and S. Khcehafian, ~Calculus for Complex Objects," m PODS, March 1986

Digital Library

Google Scholar

[2]

S Abiteboul and tL Hull, ~IFO A formal semantic database mo~,el," m Proceedzngs thzrd A CM SIGACT-SIGMOD symposzum on Pnnczples of Database systems, Waterloo, Canada, Apt 1984

Digital Library

Google Scholar

[3]

A Roth, H Korth, and A Sdberschatz, "Extended Algebra and Calculus for -~INF Relational Databases,~ Techmcal Report TR-84-36, Department of Computer Sciences, The Umverslty of Texas st Austin, 1984. revased 1985

Digital Library

Google Scholar

[4]

Z Ozsoyoglu and L Yuan, "A New Normal Form for Nested Relations," A CM transac~zons on Database Systems, vol 12, pp. 111-136, March 1987

Digital Library

Google Scholar

[5]

H Alt-Kacl, A Laff)ce Theoretsc Approach to Computatzon based on Calculus of Part~ally Ordered Type Structures PhD thesis, Umverslty of Pennsylvama, 1985

Google Scholar

[6]

W Rounds and tt Kasper, "A Complete Loglcal Calculus for Record Structures Representing Lmgmstle Information," Tech Rep, Umverslty of Michigan, Electrical Engineering and Computer Sclenee Department, 1985

Google Scholar

[7]

D Scott, "Dommns for Denotatlonal Semantics,~ m ICALP, July 1982

Digital Library

Google Scholar

[8]

P Buneman and A Ohon, ~Usmg Powerdommns to Generahze Relational Databases," Theoret,cal Computer Sc)ence, To appear

Digital Library

Google Scholar

[9]

M Smyth, "Power Dommns,~ J Computer and System Scsences, vol 16, no 1, pp 23-36, 1978

Google Scholar

[10]

T Imlehnskl and W Llpski, " Incomplete Information m Relational Databases," Journal of the A CM, Oct 1984.

Google Scholar

[11]

J Stoy, Denotatsonal Semantscs The Scoff-Strachey approach to Programmzng Language Theory MIT Press, 1977.

Digital Library

Google Scholar

[12]

P Buneman, S. Davldson, and A Watters, "Querying Independent Databases," Information Sc)ences An internat, onal Journal, To appear.

Digital Library

Google Scholar

[13]

Wmskel, '~)n Powerdornams and Modahtles," Theoretscal Computer Science, vol 36, pp 127-137, 1985

Google Scholar

[14]

H Alt-Kacl, "An Algebriac Semantics Approach to the Effective Resolution on Type Equations," Theoret)cal Computer Sc)ence, vol. 45, pp 293-351, 1986

Digital Library

Google Scholar

Cited By

View all

Schmidt D(2007)A calculus of logical relations for over- and underapproximating static analysesScience of Computer Programming10.1016/j.scico.2006.03.00864:1(29-53)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1016/j.scico.2006.03.008
Ryan K(2005)Data integration for visualization systemsDatabase Issues for Data Visualization10.1007/BFb0021146(83-93)Online publication date: 8-Jun-2005
https://doi.org/10.1007/BFb0021146
Puhlmann H(2005)The snack powerdomain for database semanticsMathematical Foundations of Computer Science 199310.1007/3-540-57182-5_56(650-659)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-57182-5_56
Show More Cited By

Recommendations

Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database Theory

The problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Combined-semantics equivalence of conjunctive queries

Query containment and equivalence are fundamental problems in the context of query processing and optimization. In this paper, we consider combined-semantics equivalence of conjunctive (CQ) queries. The combined-semantics formalism 10,11 generalizes the ...
Regular path queries under approximate semantics

We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the query languages for semistructured databases. To enable approximations, we allow the ...

Comments

Information & Contributors

Information

Published In

PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

March 1988

352 pages

ISBN:0897912632

DOI:10.1145/308386

Chairmen:
Chris Edmondson-Yurkanan
Univ. of Texas at Austin, Austin
,
Mihalis Yannakakis
AT&T Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS05

Sponsor:

SIGMOD/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
188
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)3

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schmidt D(2007)A calculus of logical relations for over- and underapproximating static analysesScience of Computer Programming10.1016/j.scico.2006.03.00864:1(29-53)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1016/j.scico.2006.03.008
Ryan K(2005)Data integration for visualization systemsDatabase Issues for Data Visualization10.1007/BFb0021146(83-93)Online publication date: 8-Jun-2005
https://doi.org/10.1007/BFb0021146
Puhlmann H(2005)The snack powerdomain for database semanticsMathematical Foundations of Computer Science 199310.1007/3-540-57182-5_56(650-659)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-57182-5_56
Heckmann R(2005)Set domainsESOP '9010.1007/3-540-52592-0_63(177-196)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-52592-0_63
Levene MLoizou G(2005)A domain theoretic approach to incomplete information in nested relational databasesFoundations of Data Organization and Algorithms10.1007/3-540-51295-0_147(439-456)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-51295-0_147
Schmidt D(2004)Closed and Logical Relations for Over- and Under-Approximation of PowersetsStatic Analysis10.1007/978-3-540-27864-1_5(22-37)Online publication date: 2004
https://doi.org/10.1007/978-3-540-27864-1_5
Ioannidis YPoosala V(1999)Histogram-Based Approximation of Set-Valued Query-AnswersProceedings of the 25th International Conference on Very Large Data Bases10.5555/645925.671527(174-185)Online publication date: 7-Sep-1999
https://dl.acm.org/doi/10.5555/645925.671527
Poosala VGanti V(1999)Fast Approximate Answers to Aggregate Queries on a Data CubeProceedings of the 11th International Conference on Scientific and Statistical Database Management10.1109/SSDM.1999.787618(24-33)Online publication date: 28-Jul-1999
https://dl.acm.org/doi/10.1109/SSDM.1999.787618
Dyreson C(1997)A Bibliography on Uncertainty Management in Information SystemsUncertainty Management in Information Systems10.1007/978-1-4615-6245-0_15(413-458)Online publication date: 1997
https://doi.org/10.1007/978-1-4615-6245-0_15
Nüßler K(1995)Universality and PowerdomainsElectronic Notes in Theoretical Computer Science10.1016/S1571-0661(04)00025-81(430-446)Online publication date: 1995
https://doi.org/10.1016/S1571-0661(04)00025-8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Equivalence and minimization of conjunctive queries under combined semantics

Combined-semantics equivalence of conjunctive queries

Regular path queries under approximate semantics

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Equivalence and minimization of conjunctive queries under combined semantics

Combined-semantics equivalence of conjunctive queries

Regular path queries under approximate semantics

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations