1983
DOI: 10.1007/bf03037022
|View full text |Cite
|
Sign up to set email alerts
|

Application of hash to data base machine and its architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
92
0
1

Year Published

1985
1985
2017
2017

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 254 publications
(93 citation statements)
references
References 6 publications
0
92
0
1
Order By: Relevance
“…Bitton et al have discussed a number of parallel sorting techniques [Bitton et al 1984], only a few of which are really used in database systems. Mishra and Eich's recent survey of relational join algorithms [Mishra and Eich 1992] compares their behavior using diagrams derived from one by Kitsuregawa et al [Kitsuregawa, Tanaka, and Motooka 1983] and also describes join methods using index structures and join methods for distributed systems. The present survey is much broader in scope as it also considers system architectures for complex query plans and for parallel execution, selection and aggregation algorithms, the relationship of sorting and hashing as it pertains to database query processing, special operations for non-traditional data models, and auxiliary techniques such as compression.…”
Section: Query Evaluation Techniquesmentioning
confidence: 99%
“…Bitton et al have discussed a number of parallel sorting techniques [Bitton et al 1984], only a few of which are really used in database systems. Mishra and Eich's recent survey of relational join algorithms [Mishra and Eich 1992] compares their behavior using diagrams derived from one by Kitsuregawa et al [Kitsuregawa, Tanaka, and Motooka 1983] and also describes join methods using index structures and join methods for distributed systems. The present survey is much broader in scope as it also considers system architectures for complex query plans and for parallel execution, selection and aggregation algorithms, the relationship of sorting and hashing as it pertains to database query processing, special operations for non-traditional data models, and auxiliary techniques such as compression.…”
Section: Query Evaluation Techniquesmentioning
confidence: 99%
“…A centralized Grace join algorithm [KITS83] works in three phases. In the first phase, the algorithm partitions relation R into N disk buckets by hashing on the join attribute of each tuple in R. In phase 2, relation S is partitioned into N buckets using the same hash function.…”
Section: Grace Hash-joinmentioning
confidence: 99%
“…Hence, it is a very old and long studied topic. Hash joins were pioneered in the 1980s [12,10] , and have been implemented in almost all DBMSs since then, and undergone numerous improvements. For example, Microsoft SQL Server 2000 starts using an in-memory hash join and gradually transitions to grace hash join, and recursive hash join, depending on the size of the build input [2] .…”
Section: Related Workmentioning
confidence: 99%