HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM

HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM

In one embodiment, a computer-implemented method includes issuing, to a DRAM with EIP, a first group of two or more load requests to load data from a hash table constructed from hashed join-key values of a dimension table for a hash-join procedure. A second group of two or more load requests is issu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: VANDERWIEL STEVEN P, JOHNSON CHARLES, DERBY JEFFREY H, MONTOYE ROBERT K, SREEDHAR DHEERAJ
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator VANDERWIEL STEVEN P
JOHNSON CHARLES
DERBY JEFFREY H
MONTOYE ROBERT K
SREEDHAR DHEERAJ
description In one embodiment, a computer-implemented method includes issuing, to a DRAM with EIP, a first group of two or more load requests to load data from a hash table constructed from hashed join-key values of a dimension table for a hash-join procedure. A second group of two or more load requests is issued. First response data is received, responsive to the first group of load requests. The first response data is processed while awaiting second response data responsive to the second group. Processing the first response data includes identifying matches between the join-key values corresponding to entries in the load requests of the first group and one or more hash buckets in the first response data. The size of the second group of load requests is selected such that a time for processing the first response data is approximately equal to the latency in receiving the second response data.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2016147450A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2016147450A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2016147450A13</originalsourceid><addsrcrecordid>eNqNyjsKwkAQANA0FqLeYcA6kNUY6yVMMiP7CTsbP1UIslaigXh_bDyA1WveMjPELeUdhsYHq12NQFoITp6dQC_sWrBofbjBhSMBXiM64TMCu4jBaQOdDtoYNCx2nS0e43NOm5-rbNtgrClP03tI8zTe0yt9hl52hapUeSwPhVb7_9YXlkovMg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM</title><source>esp@cenet</source><creator>VANDERWIEL STEVEN P ; JOHNSON CHARLES ; DERBY JEFFREY H ; MONTOYE ROBERT K ; SREEDHAR DHEERAJ</creator><creatorcontrib>VANDERWIEL STEVEN P ; JOHNSON CHARLES ; DERBY JEFFREY H ; MONTOYE ROBERT K ; SREEDHAR DHEERAJ</creatorcontrib><description>In one embodiment, a computer-implemented method includes issuing, to a DRAM with EIP, a first group of two or more load requests to load data from a hash table constructed from hashed join-key values of a dimension table for a hash-join procedure. A second group of two or more load requests is issued. First response data is received, responsive to the first group of load requests. The first response data is processed while awaiting second response data responsive to the second group. Processing the first response data includes identifying matches between the join-key values corresponding to entries in the load requests of the first group and one or more hash buckets in the first response data. The size of the second group of load requests is selected such that a time for processing the first response data is approximately equal to the latency in receiving the second response data.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20160526&amp;DB=EPODOC&amp;CC=US&amp;NR=2016147450A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20160526&amp;DB=EPODOC&amp;CC=US&amp;NR=2016147450A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>VANDERWIEL STEVEN P</creatorcontrib><creatorcontrib>JOHNSON CHARLES</creatorcontrib><creatorcontrib>DERBY JEFFREY H</creatorcontrib><creatorcontrib>MONTOYE ROBERT K</creatorcontrib><creatorcontrib>SREEDHAR DHEERAJ</creatorcontrib><title>HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM</title><description>In one embodiment, a computer-implemented method includes issuing, to a DRAM with EIP, a first group of two or more load requests to load data from a hash table constructed from hashed join-key values of a dimension table for a hash-join procedure. A second group of two or more load requests is issued. First response data is received, responsive to the first group of load requests. The first response data is processed while awaiting second response data responsive to the second group. Processing the first response data includes identifying matches between the join-key values corresponding to entries in the load requests of the first group and one or more hash buckets in the first response data. The size of the second group of load requests is selected such that a time for processing the first response data is approximately equal to the latency in receiving the second response data.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyjsKwkAQANA0FqLeYcA6kNUY6yVMMiP7CTsbP1UIslaigXh_bDyA1WveMjPELeUdhsYHq12NQFoITp6dQC_sWrBofbjBhSMBXiM64TMCu4jBaQOdDtoYNCx2nS0e43NOm5-rbNtgrClP03tI8zTe0yt9hl52hapUeSwPhVb7_9YXlkovMg</recordid><startdate>20160526</startdate><enddate>20160526</enddate><creator>VANDERWIEL STEVEN P</creator><creator>JOHNSON CHARLES</creator><creator>DERBY JEFFREY H</creator><creator>MONTOYE ROBERT K</creator><creator>SREEDHAR DHEERAJ</creator><scope>EVB</scope></search><sort><creationdate>20160526</creationdate><title>HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM</title><author>VANDERWIEL STEVEN P ; JOHNSON CHARLES ; DERBY JEFFREY H ; MONTOYE ROBERT K ; SREEDHAR DHEERAJ</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2016147450A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>VANDERWIEL STEVEN P</creatorcontrib><creatorcontrib>JOHNSON CHARLES</creatorcontrib><creatorcontrib>DERBY JEFFREY H</creatorcontrib><creatorcontrib>MONTOYE ROBERT K</creatorcontrib><creatorcontrib>SREEDHAR DHEERAJ</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>VANDERWIEL STEVEN P</au><au>JOHNSON CHARLES</au><au>DERBY JEFFREY H</au><au>MONTOYE ROBERT K</au><au>SREEDHAR DHEERAJ</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM</title><date>2016-05-26</date><risdate>2016</risdate><abstract>In one embodiment, a computer-implemented method includes issuing, to a DRAM with EIP, a first group of two or more load requests to load data from a hash table constructed from hashed join-key values of a dimension table for a hash-join procedure. A second group of two or more load requests is issued. First response data is received, responsive to the first group of load requests. The first response data is processed while awaiting second response data responsive to the second group. Processing the first response data includes identifying matches between the join-key values corresponding to entries in the load requests of the first group and one or more hash buckets in the first response data. The size of the second group of load requests is selected such that a time for processing the first response data is approximately equal to the latency in receiving the second response data.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2016147450A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title HIGH-PERFORMANCE HASH JOINS USING MEMORY WITH EXTENSIVE INTERNAL PARALLELISM
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T05%3A02%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=VANDERWIEL%20STEVEN%20P&rft.date=2016-05-26&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2016147450A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true