article

Free access

Using Semi-Joins to Solve Relational Queries

Authors:

Philip A. Bernstein,

Dah-Ming W. ChiuAuthors Info & Claims

Journal of the ACM (JACM), Volume 28, Issue 1

Pages 25 - 40

https://doi.org/10.1145/322234.322238

Published: 01 January 1981 Publication History

PDF eReader

References

[1]

AHO, A., HOPCROFT, J., AND ULLMAN, J. The Design and Analysis of ComputerAIgorithms. Addison- Wesley, Reading, Mass., 1974.

Crossref

Google Scholar

[2]

AHO, A., SAGIV, Y., AND ULLMAN, J.D. Equivalence among relational expressions. SIAM J. Comput. 2 (May 1979), 218-246,

Google Scholar

[3]

BERNSTEIN, P.A., AND GOODMAN, N. Full reducers for relational queries using multi-attribute semijoins. Proc. Computer Networking Symposium, Gaithersburg, Md., 1979, pp. 206-215.

Google Scholar

[4]

CHAMBERLIN, D.D., ASTRAHAN, M.M., ESWARAN, K.P., GRIFFITHS, P.P., LORIE, R.A., MEHL, J.W., REISNER, P., AND WADE, B.W. SEQUEL 2: A unified approach to data definition, manipulation, and control. IBM J. Res. Dev. 20, 6 (Nov. 1976), 560-575.

Google Scholar

[5]

CHANDRA, A.K., AND MERLIN, P.M. Optimal implementation of conjunctive queries in relational data bases. Proc. 9th Ann. ACM Syrup. on Theory of Computing, Boulder, Colo., May 1976, pp. 77- 90.

Crossref

Google Scholar

[6]

CODD, E.F. A relational model of data for large shared data banks. Commun. ACM 13, 6 (June 1970), 377-387.

Crossref

Google Scholar

[7]

CODD, E.F. Relational completeness of data base sublanguages. In Data Base Systems, R. Rustin, Ed., Courant Computer Science Symposia Series, Vol. 6, Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 65-9O.

Google Scholar

[8]

HELD, G.D., STONEBRAKER, M., AND WONG, E. INGRES--A relational data base management system. Proe. AFIPS 1975 National Computer Conf., AFIPS Press, Arlington, Va., 1975, pp. 409-416.

Google Scholar

[9]

OZKARAHAN, E.A., SCHUSTER, S.A., AND SEVCIK, K.C. Performance evaluation of a relational associative processor. ACM Trans. Database Syst. 2, 2 (June 1977), 175-196.

Crossref

Google Scholar

[10]

ROTHNIE, J.B. Evaluating inter-entry retrieval expressions in a relational database management system. Proc. AFIPS 1975 National Computer Conf., AFIPS Press, Arlington, Va., 1975, pp. 417-423.

Google Scholar

[11]

ROTHNIE, J.B., AND GOODMAN, N. A survey of research and development in distributed database management. Proc. 3rd lnter. Conf. on Very Large Data Bases, Tokyo, Japan, 1977, pp. 48-61.

Google Scholar

[12]

SMIT, J.M., AND CHANG, P.Y.-T. Optimizing the performance of a relational algebra database inte.rface. Commun. ACM 18, 10 (Oct. 1975), 568-579.

Crossref

Google Scholar

[13]

WON(:;, E., AND YOUSSEFI, K. Decomposition--A strategy for query processing. ACM Trans. Database Syst. 1, 3 (Sept. 1976), 223-241.

Crossref

Google Scholar

[14]

WONO, E. Retrieving dispersed data from SDD-I: A system for distributed databases. Proc. 1977 Berkeley Workshop on Distributed Data Management and Computer Networks, Berkeley, Calif., May 1977.

Google Scholar

Cited By

View all

Pradhan AKarthik SS. R(2024)Optimal Query Plans for Geo-distributed Data Analytics at ScaleProceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)10.1145/3632410.3632424(247-251)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3632410.3632424
Kang H(2023)In-Network Processing of Skyline Join Queries in Wireless Sensor Networks Using Synopses of Skyline Attribute Value RangesSensors10.3390/s2306302223:6(3022)Online publication date: 10-Mar-2023
https://doi.org/10.3390/s23063022
Zhang YChronis YPatel JRekatsinas T(2023)Simple Adaptive Query Processing vs. Learned Query Optimizers: Observations and AnalysisProceedings of the VLDB Endowment10.14778/3611479.361150116:11(2962-2975)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611501
Show More Cited By

Index Terms

Using Semi-Joins to Solve Relational Queries
1. Information systems
  1. Data management systems
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

On optimizing relational self-joins
EDBT '12: Proceedings of the 15th International Conference on Extending Database Technology

Self-join, which joins a relation with itself, is a prevalent operation in relational database systems. Despite its wide applicability, there has been little attention devoted to improving its performance. In this paper, we present SCALE (<u>S</u>ort ...
Analysis of Joins and Semi-joins in Centralized and Distributed Database Queries
ICCS '12: Proceedings of the 2012 International Conference on Computing Sciences

Database is defined as collection of files or table, where as DBMS stands for Database Management System which is collection of unified programs used to manage overall activities of the database. The two dominant approaches used for storing and managing ...
Supporting top-k join queries in relational databases

Ranking queries, also known as top-k queries, produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Top-k queries are dominant in many emerging ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 28, Issue 1

Jan. 1981

190 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322234

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in JACM Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

411
Total Citations
View Citations
3,078
Total Downloads

Downloads (Last 12 months)733
Downloads (Last 6 weeks)88

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pradhan AKarthik SS. R(2024)Optimal Query Plans for Geo-distributed Data Analytics at ScaleProceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)10.1145/3632410.3632424(247-251)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3632410.3632424
Kang H(2023)In-Network Processing of Skyline Join Queries in Wireless Sensor Networks Using Synopses of Skyline Attribute Value RangesSensors10.3390/s2306302223:6(3022)Online publication date: 10-Mar-2023
https://doi.org/10.3390/s23063022
Zhang YChronis YPatel JRekatsinas T(2023)Simple Adaptive Query Processing vs. Learned Query Optimizers: Observations and AnalysisProceedings of the VLDB Endowment10.14778/3611479.361150116:11(2962-2975)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611501
Khan MHalim ZBaig A(2023)An efficient approach for faster matching of approximate patterns in graphsKnowledge-Based Systems10.1016/j.knosys.2023.110770276(110770)Online publication date: Sep-2023
https://doi.org/10.1016/j.knosys.2023.110770
Wu XTheodoratos DSkoutas DLan M(2023)A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphsInformation Systems10.1016/j.is.2023.102249117:COnline publication date: 1-Jul-2023
https://dl.acm.org/doi/10.1016/j.is.2023.102249
Ooi BSrinivasan B(2023)Properties of semijoin sequencesJournal of Computer Science and Technology10.1007/BF029433584:2(106-115)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF02943358
Ghosh DGupta PMehrotra SYus RAltowim Y(2022)JENNERProceedings of the VLDB Endowment10.14778/3551793.355182215:11(2666-2678)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551822
Bonifati ADumbrava SFletcher GHidders JHofer MMartens WMurlak FShinavier JStaworko STomaszuk D(2022)Threshold queries in theory and in the wildProceedings of the VLDB Endowment10.14778/3510397.351040715:5(1105-1118)Online publication date: 18-May-2022
https://dl.acm.org/doi/10.14778/3510397.3510407
Atre M(2022)The Case of SPARQL UNION, FILTER and DISTINCTProceedings of the ACM Web Conference 202210.1145/3485447.3511992(1882-1892)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3485447.3511992
Tziavelis NGatterbauer WRiedewald M(2022)Toward Responsive DBMS: Optimal Join Algorithms, Enumeration, Factorization, Ranking, and Dynamic Programming2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00299(3205-3208)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00299
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

Index Terms

Recommendations

On optimizing relational self-joins

Analysis of Joins and Semi-joins in Centralized and Distributed Database Queries

Supporting top-k join queries in relational databases

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

On optimizing relational self-joins

Analysis of Joins and Semi-joins in Centralized and Distributed Database Queries

Supporting top-k join queries in relational databases

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

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