Article

Free access

Semantic representations and query languages for or-sets

Authors:

Limsoon WongAuthors Info & Claims

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

Pages 37 - 48

https://doi.org/10.1145/153850.153854

Published: 01 August 1993 Publication History

Abstract

Or-sets were introduced by Imielinski, Naqvi and Vadaparty for dealing with limited forms of disjunctive information in database queries. Independently, Rounds used a similar notion for representing disjunctive and conjunctive information in the context of situation theory. In this paper we formulate a query language with adequate expressive power for or-sets. Using the notion of normalization of or-sets, queries at the “structural” and “conceptual” levels are distinguished. Losslessness of normalization is established for a large class of queries. We have obtained upper bounds for the cost of normalization. An approach related to that of Rounds is used to provide semantics for or-sets.

References

[1]

S. Abiteboul, C. Beeri, On the power of languages for the manipulation of complex objects, In Proc. of Int. Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988.

[2]

S. Abiteboul, P. Fischer and tt.-J. Schek, eds, LNCS 361: Nested Relations and Complex Objects in Databases, Springer-Verlag, 1989.

Digital Library

[3]

V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query language. In Proc. of 3rd Int. Workshop on Database Programming Languages, pages 9-19, Naphlion, Greece, August 1991.

Digital Library

[4]

V. Breazu-Tannen and R. Subrahmanyam. Logical and computational aspects of programming with sets/bags/lists. In LNCS 510: Proc. of 18th ICALP, Madrid, Spain, July 1991, pages 60-75. Springer Verlag, 1991.

Digital Library

[5]

V. Breazu-Tannen, P. Buneman, and L. Wong. Natually embedded query languages. In LNCS 646: Proc. ICD T, Berlin, Germany, October, 1992, pages 140-154. Springer-Verlag, October 92.

Digital Library

[6]

P. Buneman, S. Davidson, A. Watters, A semantics for complex objects and approximate answers, JCSS 43(1991), 170-218.

Digital Library

[7]

P. Buneman, A. Jung, A. Ohori, Using powerdomains to generalize relational databases, TCS 91( 1991 ), 23-55.

Digital Library

[8]

N. Dershowitz and J.-P. Jouannand, Rewrite Systems, In: Handbook on Theoretical Computer Science, Horth Holland, 1990, pago.# 243-320.

Digital Library

[9]

M. Garey and D. Johnson, "Computers and intractability : A Guide to the Theory of NP- completeness", San Francisco, W.H. Freeman, 1979.

Digital Library

[10]

it. Harper, It. Milner, and M. Torte. "The Definition of Standard ML', The MIT Press, 1990.

Digital Library

[11]

R. Heckmann, Lower and upper power domain constructions commute on all cpos, Inform. Process. Letters 40(1991), 7-11.

Digital Library

[12]

T. imielinski, W. Lipski. Incomplete information in relational databases. J. of A CM 31(1984), 761-791.

Digital Library

[13]

T. imielinski, S. Naqvi, and K. Vadaparty. Incomplete objects --- a data model for design and planning applications. In Proc. of ACM-SIGMOD, Denver, Colorado, May 1991, pages 288-297.

Digital Library

[14]

T. Imielinski, S. Naqvi, and K. Vadaparty. Querying design and planning databases. In LNCS 566: Deductive and Object Oriented Databases, pages 524-545, Berlin, 1991. Springer-Verlag.

[15]

L. Libkin, A relational algebra for complex objects based on partial information, In LNCS 495: Proc. of Syrup. on Math. Fundamentals of Database Systems 91, pages 36-41, Rostock, 1991. Springer-Verlag.

Digital Library

[16]

L. Libkin, An elementary proof that upper and lower powerdomain constructions commute, Bulletin of the EATCS, 48 (1992), 175- 177.

[17]

L. Libkin, L. Wong, Semantic representations and query languages for or-sets, Technical Report MS-CIS-92-88, University of Pennsylvania, 1992.

[18]

E. Moggi. Notions of computation and monads. Information and Computation, 93(1991), 55-92.

Digital Library

[19]

S. Naqvi and S. Tsur. "A Logical Language for Data and Knowledge Bases", Computer Science Press, 1989.

Digital Library

[20]

B. Rounds, Situation-theoretic aspects of databases, In Proc. Conf. on Situation Theory and Applications, CSLI vol. 26, 1991, pages 229-256.

[21]

P. Wadler. Comprehending monads. In Proc. of A CM Conf. on Lisp and Functional Programming, Nice, June 1990.

Digital Library

Cited By

Song SZhang AChen LWang J(2015)Enriching data imputation with extensive similarity neighborsProceedings of the VLDB Endowment10.14778/2809974.28099898:11(1286-1297)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.14778/2809974.2809989
Park SHwang S(2009)A logical account of uncertain databases based on linear logicProceedings of the 12th International Conference on Database Theory10.1145/1514894.1514912(141-148)Online publication date: 23-Mar-2009
https://dl.acm.org/doi/10.1145/1514894.1514912
Sarma ABenjelloun OHalevy ANabar SWidom J(2009)Representing uncertain dataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-009-0147-018:5(989-1019)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s00778-009-0147-0
Show More Cited By

Index Terms

Semantic representations and query languages for or-sets
1. Computing methodologies
  1. Computer graphics
    1. Image compression
2. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages

Recommendations

Semantic Representations and Query Languages for Or-Sets

Or-sets were introduced by Imielinski, Naqvi, and Vadaparty for dealing with limited forms of disjunctive information in database queries. Independently, Rounds used a similar notion for representing disjunctive and conjunctive information in the ...
Query languages for data exchange: beyond unions of conjunctive queries
ICDT '09: Proceedings of the 12th International Conference on Database Theory

The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms of data complexity). However, this is not the only class with this ...
Constraint query languages

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

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

August 1993

312 pages

ISBN:0897915933

DOI:10.1145/153850

Chairman:
Catriel Beeri

Copyright © 1993 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS93

Sponsor:

SIGMOD/PODS93: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD

May 25 - 28, 1993

D.C., Washington, USA

Acceptance Rates

PODS '93 Paper Acceptance Rate 26 of 115 submissions, 23%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
310
Total Downloads

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

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Song SZhang AChen LWang J(2015)Enriching data imputation with extensive similarity neighborsProceedings of the VLDB Endowment10.14778/2809974.28099898:11(1286-1297)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.14778/2809974.2809989
Park SHwang S(2009)A logical account of uncertain databases based on linear logicProceedings of the 12th International Conference on Database Theory10.1145/1514894.1514912(141-148)Online publication date: 23-Mar-2009
https://dl.acm.org/doi/10.1145/1514894.1514912
Sarma ABenjelloun OHalevy ANabar SWidom J(2009)Representing uncertain dataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-009-0147-018:5(989-1019)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s00778-009-0147-0
Antova LKoch COlteanu DZhou LLing TOoi B(2007)From complete to incomplete information and backProceedings of the 2007 ACM SIGMOD international conference on Management of data10.1145/1247480.1247559(713-724)Online publication date: 11-Jun-2007
https://dl.acm.org/doi/10.1145/1247480.1247559
Sarma ABenjelloun OHalevy AWidom J(2006)Working Models for Uncertain DataProceedings of the 22nd International Conference on Data Engineering10.1109/ICDE.2006.174Online publication date: 3-Apr-2006
https://dl.acm.org/doi/10.1109/ICDE.2006.174
Bosc P(2006)On diverse answers issued from flexible queriesFlexible Query Answering Systems10.1007/BFb0055991(55-67)Online publication date: 31-May-2006
https://doi.org/10.1007/BFb0055991
Beeri C(2005)Bulk types and query language designRecent Trends in Data Type Specification10.1007/BFb0014421(30-47)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0014421
Beeri CMilo TTa-Shma P(2005)Towards a language for the fully generic queriesDatabase Programming Languages10.1007/3-540-64823-2_14(239-259)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3-540-64823-2_14
Bosc PPivert O(2005)On the handling of imperfect data in relational database systems from null values to possibility distributionsFoundations of Intelligent Systems10.1007/3-540-61286-6_165(408-417)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-61286-6_165
Gunter ELibkin L(2005)Interfacing HOL90 with a functional database query languageHigher Order Logic Theorem Proving and Its Applications10.1007/3-540-60275-5_64(170-185)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-60275-5_64
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents