Efficient External Table Reordering

Efficient External Table Reordering

A novel extension to binary-tree table organization suitable for external storage providing successful searches for nearly full tables requiring less than two accesses is presented. The generalizes the "efficient ordering of hash tables" effort presented in 1979. Both the experimental and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Burkhard, W.A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Binary trees
Computational modeling
Computer science
Disk drives
Indexing
Laboratories
Organizing
Performance analysis
Probes
Runtime
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 131
container_issue
container_start_page 124
container_title
container_volume
creator Burkhard, W.A.
description A novel extension to binary-tree table organization suitable for external storage providing successful searches for nearly full tables requiring less than two accesses is presented. The generalizes the "efficient ordering of hash tables" effort presented in 1979. Both the experimental and analytical results demonstrate the reductions possible. This method places no restrictions on the the table configuration parameters and requires no additional space per bucket. The insertion runtime is larger slightly than for ordinary external double hashing.
doi_str_mv 10.1109/MASCOTS.2007.21
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4674406</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4674406</ieee_id><sourcerecordid>4674406</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-1f42cb018972854431b2c3cf7dac3cfd2dc04003a717e2bb1c7616c9b2a3b42c3</originalsourceid><addsrcrecordid>eNpVjjtPwzAURs1LIpTODCyRmB3uvbZzk7GKwkMqqkTDXNmOg4xCQEkG-PctgoXpDJ_OpyPEFUKGCOXt02pbbZptRgCcER6JZckFatIaC6PxWCSk2Egg4pN_m9KnIkFDuWSjynNxMU1vAARoVCJu6q6LPoZhTuuvOYyD7dPGuj6kz-FjbMMYh9dLcdbZfgrLPy7Ey13dVA9yvbl_rFZrGZHNLLHT5B1gUTIdirRCR175jlv7g5ZaDxpAWUYO5Bx6zjH3pSOr3EFVC3H9-xtDCLvPMb7b8Xunc9YacrUH8ahC8g</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Efficient External Table Reordering</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Burkhard, W.A.</creator><creatorcontrib>Burkhard, W.A.</creatorcontrib><description>A novel extension to binary-tree table organization suitable for external storage providing successful searches for nearly full tables requiring less than two accesses is presented. The generalizes the "efficient ordering of hash tables" effort presented in 1979. Both the experimental and analytical results demonstrate the reductions possible. This method places no restrictions on the the table configuration parameters and requires no additional space per bucket. The insertion runtime is larger slightly than for ordinary external double hashing.</description><identifier>ISSN: 1526-7539</identifier><identifier>ISBN: 9781424418534</identifier><identifier>ISBN: 1424418534</identifier><identifier>EISSN: 2375-0227</identifier><identifier>EISBN: 9781424418541</identifier><identifier>EISBN: 1424418542</identifier><identifier>DOI: 10.1109/MASCOTS.2007.21</identifier><language>eng</language><publisher>IEEE</publisher><subject>Binary trees ; Computational modeling ; Computer science ; Disk drives ; Indexing ; Laboratories ; Organizing ; Performance analysis ; Probes ; Runtime</subject><ispartof>2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2007, p.124-131</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4674406$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4674406$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Burkhard, W.A.</creatorcontrib><title>Efficient External Table Reordering</title><title>2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</title><addtitle>MASCOT</addtitle><description>A novel extension to binary-tree table organization suitable for external storage providing successful searches for nearly full tables requiring less than two accesses is presented. The generalizes the "efficient ordering of hash tables" effort presented in 1979. Both the experimental and analytical results demonstrate the reductions possible. This method places no restrictions on the the table configuration parameters and requires no additional space per bucket. The insertion runtime is larger slightly than for ordinary external double hashing.</description><subject>Binary trees</subject><subject>Computational modeling</subject><subject>Computer science</subject><subject>Disk drives</subject><subject>Indexing</subject><subject>Laboratories</subject><subject>Organizing</subject><subject>Performance analysis</subject><subject>Probes</subject><subject>Runtime</subject><issn>1526-7539</issn><issn>2375-0227</issn><isbn>9781424418534</isbn><isbn>1424418534</isbn><isbn>9781424418541</isbn><isbn>1424418542</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVjjtPwzAURs1LIpTODCyRmB3uvbZzk7GKwkMqqkTDXNmOg4xCQEkG-PctgoXpDJ_OpyPEFUKGCOXt02pbbZptRgCcER6JZckFatIaC6PxWCSk2Egg4pN_m9KnIkFDuWSjynNxMU1vAARoVCJu6q6LPoZhTuuvOYyD7dPGuj6kz-FjbMMYh9dLcdbZfgrLPy7Ey13dVA9yvbl_rFZrGZHNLLHT5B1gUTIdirRCR175jlv7g5ZaDxpAWUYO5Bx6zjH3pSOr3EFVC3H9-xtDCLvPMb7b8Xunc9YacrUH8ahC8g</recordid><startdate>200710</startdate><enddate>200710</enddate><creator>Burkhard, W.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200710</creationdate><title>Efficient External Table Reordering</title><author>Burkhard, W.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-1f42cb018972854431b2c3cf7dac3cfd2dc04003a717e2bb1c7616c9b2a3b42c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Binary trees</topic><topic>Computational modeling</topic><topic>Computer science</topic><topic>Disk drives</topic><topic>Indexing</topic><topic>Laboratories</topic><topic>Organizing</topic><topic>Performance analysis</topic><topic>Probes</topic><topic>Runtime</topic><toplevel>online_resources</toplevel><creatorcontrib>Burkhard, W.A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Burkhard, W.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Efficient External Table Reordering</atitle><btitle>2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</btitle><stitle>MASCOT</stitle><date>2007-10</date><risdate>2007</risdate><spage>124</spage><epage>131</epage><pages>124-131</pages><issn>1526-7539</issn><eissn>2375-0227</eissn><isbn>9781424418534</isbn><isbn>1424418534</isbn><eisbn>9781424418541</eisbn><eisbn>1424418542</eisbn><abstract>A novel extension to binary-tree table organization suitable for external storage providing successful searches for nearly full tables requiring less than two accesses is presented. The generalizes the "efficient ordering of hash tables" effort presented in 1979. Both the experimental and analytical results demonstrate the reductions possible. This method places no restrictions on the the table configuration parameters and requires no additional space per bucket. The insertion runtime is larger slightly than for ordinary external double hashing.</abstract><pub>IEEE</pub><doi>10.1109/MASCOTS.2007.21</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1526-7539
ispartof 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2007, p.124-131
issn 1526-7539
2375-0227
language eng
recordid cdi_ieee_primary_4674406
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Binary trees
Computational modeling
Computer science
Disk drives
Indexing
Laboratories
Organizing
Performance analysis
Probes
Runtime
title Efficient External Table Reordering
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T11%3A20%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Efficient%20External%20Table%20Reordering&rft.btitle=2007%2015th%20International%20Symposium%20on%20Modeling,%20Analysis,%20and%20Simulation%20of%20Computer%20and%20Telecommunication%20Systems&rft.au=Burkhard,%20W.A.&rft.date=2007-10&rft.spage=124&rft.epage=131&rft.pages=124-131&rft.issn=1526-7539&rft.eissn=2375-0227&rft.isbn=9781424418534&rft.isbn_list=1424418534&rft_id=info:doi/10.1109/MASCOTS.2007.21&rft_dat=%3Cieee_6IE%3E4674406%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424418541&rft.eisbn_list=1424418542&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4674406&rfr_iscdi=true