Article

Free access

TID hash joins

Authors:

Robert Marek,

Erhard RahmAuthors Info & Claims

CIKM '94: Proceedings of the third international conference on Information and knowledge management

Pages 42 - 49

https://doi.org/10.1145/191246.191258

Published: 29 November 1994 Publication History

PDF eReader

References

[1]

Blasgen, M.W., Eswaran, K.P.: Storage and Access in Relational Databases. IBM Syst. Journal 16 (4), 363-377, 1977

Google Scholar

[2]

Chen, J. et al.: An Efficient Hybrid Join Algorithm: A DB2 Prototype. Proc. 6th IEEE Data Engineering Conf. 171 - 180, 1991

Digital Library

Google Scholar

[3]

DeWitt, D.J. et al." Implementation Techniques Ibr Main Memory Database Systems. Proc. ACM SIGMOD, 1-8, 1984

Digital Library

Google Scholar

[4]

Grossmann, C.P.: Evolution of the DASD Storage Control. IBM Systems Journal 28 (2), 196-226, 1989

Digital Library

Google Scholar

[5]

Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Comput. Surveys 25 (2), 73-170, 1993

Digital Library

Google Scholar

[6]

Livny, M.: DeNet Users's Guide, Version 1.5. Computer Science Department, University of Wisconsin, Madison. 1989

Google Scholar

[7]

Mishra, P., Eich, M.: Join Processing in Relational Databases. ACM Comput. Surveys 24(I), 63- I 13, 1992

Digital Library

Google Scholar

[8]

Marek, R., Rahm, E.: Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems, Proc. 4th Int. PARLE Conf. (Parallel Architectures and Languages Europe), Springer-Verlag, Lecture Notes in Computer Science 605, 295-310, 1992

Digital Library

Google Scholar

[9]

Nyberg, C. et al.: AlphaSort: A RISC Machine Sort. DEC Internal Report, June t993

Google Scholar

[10]

Pang, H., Carey, M.J., Livny, M.: Partially Preernptible Hash Joins. Proc. ACM SIGMOD, 59-68, 1993

Digital Library

Google Scholar

[11]

Rahm, E., Marek, R.: Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. Proc 19th VLDB Conf., 182-193, 1993

Digital Library

Google Scholar

[12]

Valduriez, P.: Join Indices. ACM Trans. on Database Systems 12 (2), 218-246, 1987

Digital Library

Google Scholar

[13]

Zeller, H.: Parallel Query Execution in NonStop SQL. Proc. IEEE CompCon, 484-487, 1990

Crossref

Google Scholar

[14]

Zeller, H., Gray, J.: An Adaptive Hash Join Algorithm for Multiuser Environments. Proc. 16th VLDB Conf., 186-197. 1990

Digital Library

Google Scholar

Cited By

View all

Wang ZKara KZhang HAlonso GMutlu OZhang C(2019)Accelerating generalized linear models with MLWeavingProceedings of the VLDB Endowment10.14778/3317315.331732212:7(807-821)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.14778/3317315.3317322
Choi DPei JHeinis T(2017)Efficient mining of regional movement patterns in semantic trajectoriesProceedings of the VLDB Endowment10.14778/3151106.315111110:13(2073-2084)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.14778/3151106.3151111
Kunft AKatsifodimos ASchelter SRabl TMarkl V(2017)BlockjoinProceedings of the VLDB Endowment10.14778/3151106.315111010:13(2061-2072)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.14778/3151106.3151110
Show More Cited By

Index Terms

TID hash joins
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
  2. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Comprehensive study on the TID effects of 0.13µm partially depleted SOI NMOSFETs

Total ionizing dose (TID) effects of 0.13µm partially depleted (PD) SOI NMOSFETs are overviewed in this paper. For core devices with floating body, the 2nd peak of the front-gate transconductance (gm) degrades with incremental TID. Moreover, the 1st and ...
Exploiting join cardinality for faster hash joins
SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

Hash joins combine massive relations in data warehouses, decision support systems, and scientific data stores. Faster hash join performance significantly improves query throughput, response time, and overall system performance. In this work, we ...
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins

The pipelined execution of multijoin queries in a multiprocessor-based database system is explored in this paper. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CIKM '94: Proceedings of the third international conference on Information and knowledge management

November 1994

463 pages

ISBN:0897916743

DOI:10.1145/191246

Editors:
Nabil R. Adam
Rutgers Univ., New Brunswick, NJ
,
Bharat K. Bhargava
Purdue Univ., IN
,
Yelena Yesha
NIST/UMBC

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: 29 November 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM94

Sponsor:

SIGAI
UMBC
SIGIR
NIST

CIKM94: Conference on Information and Knowledge Management

November 29 - December 2, 1994

Maryland, Gaithersburg, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
427
Total Downloads

Downloads (Last 12 months)83
Downloads (Last 6 weeks)10

Reflects downloads up to 30 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang ZKara KZhang HAlonso GMutlu OZhang C(2019)Accelerating generalized linear models with MLWeavingProceedings of the VLDB Endowment10.14778/3317315.331732212:7(807-821)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.14778/3317315.3317322
Choi DPei JHeinis T(2017)Efficient mining of regional movement patterns in semantic trajectoriesProceedings of the VLDB Endowment10.14778/3151106.315111110:13(2073-2084)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.14778/3151106.3151111
Kunft AKatsifodimos ASchelter SRabl TMarkl V(2017)BlockjoinProceedings of the VLDB Endowment10.14778/3151106.315111010:13(2061-2072)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.14778/3151106.3151110
Conway NAlvaro PAndrews EHellerstein J(2014)EdelweissProceedings of the VLDB Endowment10.14778/2732279.27322857:6(481-492)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.14778/2732279.2732285
Giannikis GMakreshanski DAlonso GKossmann D(2014)Shared workload optimizationProceedings of the VLDB Endowment10.14778/2732279.27322807:6(429-440)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.14778/2732279.2732280
Lai WFan YMeng X(2013)Scan and join optimization by exploiting internal parallelism of flash-based solid state drivesProceedings of the 14th international conference on Web-Age Information Management10.1007/978-3-642-38562-9_39(381-392)Online publication date: 14-Jun-2013
https://dl.acm.org/doi/10.1007/978-3-642-38562-9_39
Tsirogiannis DHarizopoulos SShah MWiener JGraefe GÇetintemel UZdonik SKossmann D(2009)Query processing techniques for solid state drivesProceedings of the 2009 ACM SIGMOD International Conference on Management of data10.1145/1559845.1559854(59-72)Online publication date: 29-Jun-2009
https://dl.acm.org/doi/10.1145/1559845.1559854
Yahia SBenedikt MLakshmanan LStoyanovich J(2008)Efficient network aware search in collaborative tagging sitesProceedings of the VLDB Endowment10.14778/1453856.14539341:1(710-721)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.14778/1453856.1453934
Jayapandian MJagadish H(2008)Automated creation of a forms-based database query interfaceProceedings of the VLDB Endowment10.14778/1453856.14539321:1(695-709)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.14778/1453856.1453932
Shang HZhang YLin XYu J(2008)Taming verification hardnessProceedings of the VLDB Endowment10.14778/1453856.14538991:1(364-375)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.14778/1453856.1453899
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Comprehensive study on the TID effects of 0.13µm partially depleted SOI NMOSFETs

Exploiting join cardinality for faster hash joins

Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins