PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES
A method creating a compact hash table includes a thread executing using a processor for building a linear probe hash table based on allocating space for an array of keys. Payloads are inserted into the linear probe hash table. Keys from the array of keys are inserted into the linear probe hash tabl...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| 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 | Attaluri, Gopi K Raman, Vijayshankar Barber, Ronald J Pandis, Ippokratis |
| description | A method creating a compact hash table includes a thread executing using a processor for building a linear probe hash table based on allocating space for an array of keys. Payloads are inserted into the linear probe hash table. Keys from the array of keys are inserted into the linear probe hash table with linear probing. A linear probing bitmap is generated based on occupied locations in the linear probe hash table. A compact hash table is created based on the linear probe hash table and the linear probing bitmap. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2019278759A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2019278759A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2019278759A13</originalsourceid><addsrcrecordid>eNrjZIgIcAxy9PFx9VFwCvX0cVHwd1Pw8_fTBYqGeIZ4-vu5uih4-Xv6KXg4BnsohDg6-bgGKzj6uYAVufq5-Qc5A1X4WRliqOJhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhpZG5hbmppaOhsbEqQIAW_ExjA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES</title><source>esp@cenet</source><creator>Attaluri, Gopi K ; Raman, Vijayshankar ; Barber, Ronald J ; Pandis, Ippokratis</creator><creatorcontrib>Attaluri, Gopi K ; Raman, Vijayshankar ; Barber, Ronald J ; Pandis, Ippokratis</creatorcontrib><description>A method creating a compact hash table includes a thread executing using a processor for building a linear probe hash table based on allocating space for an array of keys. Payloads are inserted into the linear probe hash table. Keys from the array of keys are inserted into the linear probe hash table with linear probing. A linear probing bitmap is generated based on occupied locations in the linear probe hash table. A compact hash table is created based on the linear probe hash table and the linear probing bitmap.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2019</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&date=20190912&DB=EPODOC&CC=US&NR=2019278759A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20190912&DB=EPODOC&CC=US&NR=2019278759A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Attaluri, Gopi K</creatorcontrib><creatorcontrib>Raman, Vijayshankar</creatorcontrib><creatorcontrib>Barber, Ronald J</creatorcontrib><creatorcontrib>Pandis, Ippokratis</creatorcontrib><title>PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES</title><description>A method creating a compact hash table includes a thread executing using a processor for building a linear probe hash table based on allocating space for an array of keys. Payloads are inserted into the linear probe hash table. Keys from the array of keys are inserted into the linear probe hash table with linear probing. A linear probing bitmap is generated based on occupied locations in the linear probe hash table. A compact hash table is created based on the linear probe hash table and the linear probing bitmap.</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>2019</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZIgIcAxy9PFx9VFwCvX0cVHwd1Pw8_fTBYqGeIZ4-vu5uih4-Xv6KXg4BnsohDg6-bgGKzj6uYAVufq5-Qc5A1X4WRliqOJhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhpZG5hbmppaOhsbEqQIAW_ExjA</recordid><startdate>20190912</startdate><enddate>20190912</enddate><creator>Attaluri, Gopi K</creator><creator>Raman, Vijayshankar</creator><creator>Barber, Ronald J</creator><creator>Pandis, Ippokratis</creator><scope>EVB</scope></search><sort><creationdate>20190912</creationdate><title>PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES</title><author>Attaluri, Gopi K ; Raman, Vijayshankar ; Barber, Ronald J ; Pandis, Ippokratis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2019278759A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2019</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Attaluri, Gopi K</creatorcontrib><creatorcontrib>Raman, Vijayshankar</creatorcontrib><creatorcontrib>Barber, Ronald J</creatorcontrib><creatorcontrib>Pandis, Ippokratis</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Attaluri, Gopi K</au><au>Raman, Vijayshankar</au><au>Barber, Ronald J</au><au>Pandis, Ippokratis</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES</title><date>2019-09-12</date><risdate>2019</risdate><abstract>A method creating a compact hash table includes a thread executing using a processor for building a linear probe hash table based on allocating space for an array of keys. Payloads are inserted into the linear probe hash table. Keys from the array of keys are inserted into the linear probe hash table with linear probing. A linear probing bitmap is generated based on occupied locations in the linear probe hash table. A compact hash table is created based on the linear probe hash table and the linear probing bitmap.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2019278759A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T05%3A31%3A16IST&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=Attaluri,%20Gopi%20K&rft.date=2019-09-12&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2019278759A1%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 |