Fast LH

Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not...

Full description

Saved in:
Bibliographic Details
Main Authors: Chabkinian, Juan, Schwarz, Thomas
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Cloud Computing
Data structures
Linear Hashing
Merging
Niobium
Quality of service
Radiation detectors
Scalable Distributed Data Structure
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 64
container_issue
container_start_page 57
container_title
container_volume
creator Chabkinian, Juan
Schwarz, Thomas
description Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not use a central component for the key-based operations of insertion, deletion, actualization, and retrieval and for the scan operation. LHast allows a client or a server to commit an addressing error by sending a request to the wrong server. In this case, the server forwards to the correct server directly or in one more forward operation. We discuss here methods to avoid the double forward, which is rare but might breach quality of service guarantees. We compare our methods with LHast P2P that pushes information about changes in the file structure to clients, whether they are active or not.
doi_str_mv 10.1109/SBAC-PAD.2013.15
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_6702580</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6702580</ieee_id><sourcerecordid>6702580</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a4fbea9e069dedd4d6917e913062fed39dec2cd00fff99a29bcce8f232fc462b3</originalsourceid><addsrcrecordid>eNotzMtKw0AUgOFRFE2re8GNLzDxXObSs4yptUJAQV2XycwZiChI041vr6CrH77Fb8wVQosIcvty1_X2uVu3BMgt-iOzQBdFSCjisWkoOLYMgCemQe_BBs98bhbz_A7AgSQ05myT5sPNsL0wpzV9zHr536V529y_9ls7PD089t1gJ4z-YJOroyZRCFK0FFeCYFRBhkBVC_9qplwAaq0iiWTMWVeVmGp2gUZemuu_76Squ6_99Jn237sQgfwK-AfVgzYd</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fast LH</title><source>IEEE Xplore All Conference Series</source><creator>Chabkinian, Juan ; Schwarz, Thomas</creator><creatorcontrib>Chabkinian, Juan ; Schwarz, Thomas</creatorcontrib><description>Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not use a central component for the key-based operations of insertion, deletion, actualization, and retrieval and for the scan operation. LHast allows a client or a server to commit an addressing error by sending a request to the wrong server. In this case, the server forwards to the correct server directly or in one more forward operation. We discuss here methods to avoid the double forward, which is rare but might breach quality of service guarantees. We compare our methods with LHast P2P that pushes information about changes in the file structure to clients, whether they are active or not.</description><identifier>ISSN: 1550-6533</identifier><identifier>EISSN: 2643-3001</identifier><identifier>EISBN: 1479929271</identifier><identifier>EISBN: 9781479929283</identifier><identifier>EISBN: 9781479929276</identifier><identifier>EISBN: 147992928X</identifier><identifier>DOI: 10.1109/SBAC-PAD.2013.15</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Cloud Computing ; Data structures ; Linear Hashing ; Merging ; Niobium ; Quality of service ; Radiation detectors ; Scalable Distributed Data Structure ; Servers</subject><ispartof>2013 25th International Symposium on Computer Architecture and High Performance Computing, 2013, p.57-64</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/6702580$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6702580$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chabkinian, Juan</creatorcontrib><creatorcontrib>Schwarz, Thomas</creatorcontrib><title>Fast LH</title><title>2013 25th International Symposium on Computer Architecture and High Performance Computing</title><addtitle>CAHPC</addtitle><description>Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not use a central component for the key-based operations of insertion, deletion, actualization, and retrieval and for the scan operation. LHast allows a client or a server to commit an addressing error by sending a request to the wrong server. In this case, the server forwards to the correct server directly or in one more forward operation. We discuss here methods to avoid the double forward, which is rare but might breach quality of service guarantees. We compare our methods with LHast P2P that pushes information about changes in the file structure to clients, whether they are active or not.</description><subject>Algorithm design and analysis</subject><subject>Cloud Computing</subject><subject>Data structures</subject><subject>Linear Hashing</subject><subject>Merging</subject><subject>Niobium</subject><subject>Quality of service</subject><subject>Radiation detectors</subject><subject>Scalable Distributed Data Structure</subject><subject>Servers</subject><issn>1550-6533</issn><issn>2643-3001</issn><isbn>1479929271</isbn><isbn>9781479929283</isbn><isbn>9781479929276</isbn><isbn>147992928X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotzMtKw0AUgOFRFE2re8GNLzDxXObSs4yptUJAQV2XycwZiChI041vr6CrH77Fb8wVQosIcvty1_X2uVu3BMgt-iOzQBdFSCjisWkoOLYMgCemQe_BBs98bhbz_A7AgSQ05myT5sPNsL0wpzV9zHr536V529y_9ls7PD089t1gJ4z-YJOroyZRCFK0FFeCYFRBhkBVC_9qplwAaq0iiWTMWVeVmGp2gUZemuu_76Squ6_99Jn237sQgfwK-AfVgzYd</recordid><startdate>201310</startdate><enddate>201310</enddate><creator>Chabkinian, Juan</creator><creator>Schwarz, Thomas</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201310</creationdate><title>Fast LH</title><author>Chabkinian, Juan ; Schwarz, Thomas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a4fbea9e069dedd4d6917e913062fed39dec2cd00fff99a29bcce8f232fc462b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithm design and analysis</topic><topic>Cloud Computing</topic><topic>Data structures</topic><topic>Linear Hashing</topic><topic>Merging</topic><topic>Niobium</topic><topic>Quality of service</topic><topic>Radiation detectors</topic><topic>Scalable Distributed Data Structure</topic><topic>Servers</topic><toplevel>online_resources</toplevel><creatorcontrib>Chabkinian, Juan</creatorcontrib><creatorcontrib>Schwarz, Thomas</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 Xplore</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>Chabkinian, Juan</au><au>Schwarz, Thomas</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fast LH</atitle><btitle>2013 25th International Symposium on Computer Architecture and High Performance Computing</btitle><stitle>CAHPC</stitle><date>2013-10</date><risdate>2013</risdate><spage>57</spage><epage>64</epage><pages>57-64</pages><issn>1550-6533</issn><eissn>2643-3001</eissn><eisbn>1479929271</eisbn><eisbn>9781479929283</eisbn><eisbn>9781479929276</eisbn><eisbn>147992928X</eisbn><coden>IEEPAD</coden><abstract>Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not use a central component for the key-based operations of insertion, deletion, actualization, and retrieval and for the scan operation. LHast allows a client or a server to commit an addressing error by sending a request to the wrong server. In this case, the server forwards to the correct server directly or in one more forward operation. We discuss here methods to avoid the double forward, which is rare but might breach quality of service guarantees. We compare our methods with LHast P2P that pushes information about changes in the file structure to clients, whether they are active or not.</abstract><pub>IEEE</pub><doi>10.1109/SBAC-PAD.2013.15</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1550-6533
ispartof 2013 25th International Symposium on Computer Architecture and High Performance Computing, 2013, p.57-64
issn 1550-6533
2643-3001
language eng
recordid cdi_ieee_primary_6702580
source IEEE Xplore All Conference Series
subjects Algorithm design and analysis
Cloud Computing
Data structures
Linear Hashing
Merging
Niobium
Quality of service
Radiation detectors
Scalable Distributed Data Structure
Servers
title Fast LH
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T16%3A10%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Fast%20LH&rft.btitle=2013%2025th%20International%20Symposium%20on%20Computer%20Architecture%20and%20High%20Performance%20Computing&rft.au=Chabkinian,%20Juan&rft.date=2013-10&rft.spage=57&rft.epage=64&rft.pages=57-64&rft.issn=1550-6533&rft.eissn=2643-3001&rft.coden=IEEPAD&rft_id=info:doi/10.1109/SBAC-PAD.2013.15&rft.eisbn=1479929271&rft.eisbn_list=9781479929283&rft.eisbn_list=9781479929276&rft.eisbn_list=147992928X&rft_dat=%3Cieee_CHZPO%3E6702580%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-a4fbea9e069dedd4d6917e913062fed39dec2cd00fff99a29bcce8f232fc462b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6702580&rfr_iscdi=true