iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1145/319830.319831
Maximal objects and the semantics of universal relation databases | ACM Transactions on Database Systems skip to main content
article
Free access

Maximal objects and the semantics of universal relation databases

Published: 01 March 1983 Publication History

Abstract

The universal relation concept is intended to provide the database user with a simplified model in which he can compose queries without regard to the underlying structure of the relations in the database. Frequently, the lossless join criterion provides the query interpreter with the clue needed to interpret the query as the user intended. However, some examples exist where interpretation by the lossless-join rule runs contrary to our intuition. To handle some of these cases, we propose a concept called maximal objects, which modifies the universal relation concept in exactly those situations where it appears to go awry—when the underlying relational structure has “cycles.” We offer examples of how the maximal object concept provides intuitively correct interpretations. We also consider how one might construct maximal objects mechanically from purely syntactic structural information—the relation schemes and functional dependencies—about the database.

References

[1]
AHO, A.V. Private communication, June 1981.
[2]
ARo, A.V., B~R, C., AND ULLMAN, J.D. The theory of joins in relational databases. A CM Trans. Database Syst. 4, 3 (Sept. 1979), 297-314.
[3]
AHO, A.V, SAGIV, Y., AND ULLMAN, J.D. Efficient optimization of a class of relational expressions. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 435-454.
[4]
ATZENI, P., AND PARKER, D.S. Assumptions in relational database theory. In Proc. ACM Syrup. Principles of Database Systems (Los Angeles, Calif., March 29-31), ACM, New York, 1982, pp. 1-9.
[5]
BEERI, C., FAGIN, R., MAIER, D., AND YANNAKAKIS, Y. On the desirability of acyclic database schemes. RJ3131, IBM Research Labs., San Jose, Calif., 198i.
[6]
BERNSTEIN, P.A., AND GOODMAN, N. What does Boyce-Codd normal form do? In Proc. Int. Conf. Very Large Data Bases (Montreal, Canada, Oct. 1-3), ACM, New York, 1980, pp. 245-259.
[7]
CODD, E.F. Extending the database relational model to capture more meaning. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 397-434.
[8]
FAGIN, R., MENDELZON, A.O., AND ULLMAN, J.D. A simplified universal relation assumption and its properties. RJ2900, IBM Research Labs., San Jose, Calif., 1980.
[9]
HONEYMAN, P, LADNER, R.E., AND YANNAKAKIS, M. Testing the universal instance assumption. Inf. Proces. Lett. 10, 1 (1980), 14-19.
[10]
KENT, W. Consequences of assuming a universal relation.ACM Trans. Database Syst. 6, 4 (Dec. 1981), 539-556.
[11]
KLUG, A. inequality tableaux. To appear.
[12]
MAIER, D. Discarding the universal instance assumption. In Proc. XP/1 Workshop (Stony Brook, N.Y., June 1980).
[13]
M^IER, D. The Theory of Relational Databases. Computer Science Press, Potomac, Md., 1982.
[14]
MAIER, D., MENDELZ0N, A.O., AND SAGIV, Y. Testing implications of data dependencies. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 455-469.
[15]
MAIER, D., SAGIV, Y., AND YANNAKAKIS, M. On the complexity of testing implications of functional and join dependencies. JACM 28, 4 (Oct. 1981}, 680-695.
[16]
MAIER, D., AND ULLMAN, J.D. Connections in acyclic hypergraphs. In Proc. A CM Syrup. Principles of Database Systems (Los Angeles, Calif., March 29-31}, ACM, New York, 1982, pp. 34-39.
[17]
SAGIV, Y. Can we use the universal instance assumption without using nulls? In Proc. ACM SIGMOD int. Conf. Management of Data (Ann Arbor, Mich., April 29-May 1), ACM, New York, 1981, pp. 108-I20.
[18]
SCIOR~, E. Null values, updates, and normalization in relational databases. Ph.D. dissertation, Princeton Univ., Princeton, N.J., 1980.
[19]
STONEBRAKER, M., WON6, E., KREPS, P., AND HELD, G. The design and implementation of INGRES. ACM Trans. Database Syst. 1, 3 (Sept. 1976), 189-222.
[20]
ULLMAN, J.D. Principles of Database Systems. Computer Science Press, Potomac, Md., 1983.

Cited By

View all
  • (2020)Toward Better Evolutionary Program RepairACM Transactions on Software Engineering and Methodology10.1145/336000429:1(1-53)Online publication date: 30-Jan-2020
  • (2020)Automatically Generating SystemC Code from HCSP Formal ModelsACM Transactions on Software Engineering and Methodology10.1145/336000229:1(1-39)Online publication date: 30-Jan-2020
  • (2017)Maximal object+: An acyclic semantic structure on the universal relation modelData & Knowledge Engineering10.1016/j.datak.2017.06.004111(39-57)Online publication date: Sep-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 8, Issue 1
March 1983
165 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/319830
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1983
Published in TODS Volume 8, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. acyclic hypergraph
  2. relational database
  3. universal relation

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)54
  • Downloads (Last 6 weeks)9
Reflects downloads up to 05 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Toward Better Evolutionary Program RepairACM Transactions on Software Engineering and Methodology10.1145/336000429:1(1-53)Online publication date: 30-Jan-2020
  • (2020)Automatically Generating SystemC Code from HCSP Formal ModelsACM Transactions on Software Engineering and Methodology10.1145/336000229:1(1-39)Online publication date: 30-Jan-2020
  • (2017)Maximal object+: An acyclic semantic structure on the universal relation modelData & Knowledge Engineering10.1016/j.datak.2017.06.004111(39-57)Online publication date: Sep-2017
  • (2016)Database Schema Design In The Relational ModelINFOR: Information Systems and Operational Research10.1080/03155986.1985.1173194123:1(3-19)Online publication date: 25-May-2016
  • (2016)Automatic query rewriting schemes for multitenant SaaS applicationsAutomated Software Engineering10.1007/s10515-015-0178-223:4(535-568)Online publication date: 1-Dec-2016
  • (2014)SRT-Rank: Ranking Keyword Query Results in Relational Databases Using the Strongly Related TreeIEICE Transactions on Information and Systems10.1587/transinf.2014EDP7040E97.D:9(2398-2414)Online publication date: 2014
  • (2014)Evaluating the Performance of Multi-tenant Elastic Extension TablesProcedia Computer Science10.1016/j.procs.2014.05.05529(614-626)Online publication date: 2014
  • (2014)Data Integration: An OverviewMethods in Biomedical Informatics10.1016/B978-0-12-401678-1.00002-6(15-47)Online publication date: 2014
  • (2013)Interestingness measures for association rules within groupsIntelligent Data Analysis10.5555/2595554.259555717:2(195-215)Online publication date: 1-Mar-2013
  • (2013)Relational Databases and Bell’s TheoremIn Search of Elegance in the Theory and Practice of Computation10.1007/978-3-642-41660-6_2(13-35)Online publication date: 2013
  • 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

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media