Article

Free access

An algebra of quotient relations

Authors:

Antonio L. Furtado,

Larry KerschbergAuthors Info & Claims

SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data

Pages 1 - 8

https://doi.org/10.1145/509404.509406

Published: 03 August 1977 Publication History

Abstract

An algebra which operates on partitioned relations is developed. Relation partitioning is achieved by defining equivalence relations on n-ary relations. It is shown that the algebra is as powerful as the original relational algebra, having the advantage of a set-processing capability. This feature provides both greater flexibility in query specification and efficient query processing.

References

[1]

Codd, E. F., "A Relational Model of Data for Large Shared Data Banks", Comm. ACM, Vol. 13, No. 6, June 1970, pp. 377-387.

Digital Library

[2]

Codd, E. F., "Relational Completeness of Data Base Sublanguages", Data Base Systems ed. by R. Rustin.

[3]

ANSI/X3/SPARC Study Group on Data Base Management Systems Interim Report, FDT, ACM-SIGMOD, Vol. 7, No. 2, 1975.

[4]

Stonebraker, M. R. and Wong, E., "INGRES: A Relational Data Base System", Proc. National Computer Conference, AFIPS Press, 1975.

[5]

Chamberlin, D. And Boyce, R., "SEQUEL: A Structured English Query Language", Proc. ACM-SIGMOD Workshop on Data Description, Access, and Control, May 1974, pp. 249-264.

Digital Library

[6]

Chamberlin, D. D., et al, "SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control", IBM Research Report RJ 1798, San Jose, June, 1976.

[7]

Zloof, M., "Query by Example", Proc. AFIPS National Computer Conf., AFIPS Press, Montvale, N.J., 1975, pp. 431-445.

[8]

Kerschberg, L., Ozkarahan, E. A. and Pacheco, J. E. S., "A Synthetic English Query Language for a Relational Associative Processor", Proc. Second International Conference on Software Engineering, San Francisco, Oct., 1976, pp. 505-519.

Digital Library

[9]

Pecherer, R. M., "Efficient Evaluation of Expressions in a Relational Algebra:, Proc. ACM Pacific 75 Regional Conf., April, 1975, pp. 44-49.

[10]

Smith, J. M. and Chang, P. Y., "Optimizing the Performance of a Relational Algebra Database Interface", Comm. ACM, Vol. 18, No. 10, Oct. 1975, pp. 568-579.

Digital Library

[11]

Furtado, A. L. and Brodie, M. L., "A Data Structure for Fast Relational Algebra Operations", Technical Report 7/76, Catholic University of Rio de Janeiro, 1976.

[12]

MacLane, S. and Birkhoff, G., Algebra, Macmillan Co., New York, 1967.

[13]

Boyce, R. F. et al, "Specifying Queries as Relational Expressions: The SQUARE Data Sublanguage", Comm. ACM, Vol. 18, No. 11, Nov. 1975, pp. 621-628.

Digital Library

[14]

Tsichritzis, D., "LSL: A Link and Selector Language", Proc. ACM-SIGMOD International Conf. on Management of Data, June, 1976, pp. 123-134.

[15]

Ozkarahan, E. A., Schuster, S. A., and Smith, K. C., "RAP - An Associate Processor for Data Management", Proc. AFIPS Conf., Vol. 44, 1975, pp. 379-387.

[16]

Reisner, P., "Use of Psychological Experimentation as an Aid to Development of a Query Language", IBM Research Report RJ 1707, San Jose, 1976.

[17]

Nijssen, G. M., "Set and CODASYL Set or Coset" in Data Base Description (edited by Douque and Nijssen) North Holland/American Elsevier, 1975.

Cited By

Furtado AZiviani N(2018)Information and data management at PUC-rio and UFMGProceedings of the VLDB Endowment10.14778/3229863.324049011:12(2114-2129)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.14778/3229863.3240490
Scholl MAbiteboul SBancilhon FBidoit NGamerman SPlateau DRichard PVerroust A(2005)Verso: A database machine based on nested relationsNested Relations and Complex Objects in Databases10.1007/3-540-51171-7_19(27-49)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-51171-7_19
Baumgartner FBraun TKurt EWeyland A(2003)Virtual routersACM SIGCOMM Computer Communication Review10.1145/956993.95700833:3(127-135)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.957008
Show More Cited By

Recommendations

Construction of quotient BCI(BCK)-algebra via a fuzzy ideal

The present paper gives a new construction of a quotient BCI(BCK)- algebra X/µ by a fuzzy ideal µ in X and establishes the Fuzzy Homomorphism Fundamental Theorem. We show that if µ is a fuzzy ideal (closed fuzzy ideal) of X. then X/µ is a commutative (...
Characterizing the result of the division of fuzzy relations

The role and properties of the division operator are well known in the framework of queries addressed to regular relational databases. However, Boolean queries may turn out to be too restrictive to answer some user needs and it is desirable to consider ...
An Extended Algebra for Constraint Databases

Constraint relational databases use constraints to both model and query data. A constraint relation contains a finite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data

August 1977

181 pages

ISBN:9781450373432

DOI:10.1145/509404

Conference Chair:
J. B. Fry
University of Michigan
,
General Chair:
W. Frank King
IBM Research Lab
,
Program Chair:
Diane C. P. Smith
University of Utah

Copyright © 1977 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

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 August 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

64
Total Citations
View Citations
368
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)8

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Furtado AZiviani N(2018)Information and data management at PUC-rio and UFMGProceedings of the VLDB Endowment10.14778/3229863.324049011:12(2114-2129)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.14778/3229863.3240490
Scholl MAbiteboul SBancilhon FBidoit NGamerman SPlateau DRichard PVerroust A(2005)Verso: A database machine based on nested relationsNested Relations and Complex Objects in Databases10.1007/3-540-51171-7_19(27-49)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-51171-7_19
Baumgartner FBraun TKurt EWeyland A(2003)Virtual routersACM SIGCOMM Computer Communication Review10.1145/956993.95700833:3(127-135)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.957008
Lockwood JNeely CZuver CLim D(2003)Automated tools to implement and test Internet systems in reconfigurable hardwareACM SIGCOMM Computer Communication Review10.1145/956993.95700633:3(103-110)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.957006
Welzl MMühlhäuser M(2003)CAVTACM SIGCOMM Computer Communication Review10.1145/956993.95700533:3(95-101)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.957005
Karagiannis TFaloutsos MMolle M(2003)A user-friendly self-similarity analysis toolACM SIGCOMM Computer Communication Review10.1145/956993.95700433:3(81-93)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.957004
Waddington DChang FViswanathan RYao B(2003)Topology discovery for public IPv6 networksACM SIGCOMM Computer Communication Review10.1145/956993.95700133:3(59-68)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.957001
Barford PLandweber L(2003)Bench-style network research in an Internet Instance LaboratoryACM SIGCOMM Computer Communication Review10.1145/956993.95699733:3(21-26)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.956997
Andersen DBalakrishnan HKaashoek MMorris R(2003)Experience with an evolving overlay network testbedACM SIGCOMM Computer Communication Review10.1145/956993.95699633:3(13-19)Online publication date: 1-Jul-2003
https://dl.acm.org/doi/10.1145/956993.956996
Bertino EFan JFerrari EHacid MElmagarmid AZhu X(2003)A hierarchical access control model for video database systemsACM Transactions on Information Systems10.1145/763693.76369521:2(155-191)Online publication date: 1-Apr-2003
https://dl.acm.org/doi/10.1145/763693.763695
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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