One-Probe Search
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - ε, and otherwise returns “don’t know”. The lookup procedure uses an expand...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 450 |
|---|---|
| container_issue | |
| container_start_page | 439 |
| container_title | |
| container_volume | 2380 |
| creator | Östlin, Anna Pagh, Rasmus |
| description | We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - ε, and otherwise returns “don’t know”. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage far smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient deterministic updates, exhibiting new probabilistic guarantees on dictionary running time. |
| doi_str_mv | 10.1007/3-540-45465-9_38 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_14614288</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072620_45_459</sourcerecordid><originalsourceid>FETCH-LOGICAL-p268t-d50bf81df500eef2f2f71a3ddd8179c141f4b4f265a15979fdc82a3e167860313</originalsourceid><addsrcrecordid>eNotUMtOwzAQNE8RSiWOHLlwdPF6bcc-ooqXVKlIwNlyEpsWShLscODvcdrurrTSzM5IO4RcAZsBY-UtUikYFVIoSY1FfUDOMSNbwBySAhQARRTmaE-gVkIek4Ih49SUAk9JYaSWHLSAMzJN6ZPlQg7C6IJcLltPX2JX-etX72K9uiAnwW2Sn-73hLw_3L_Nn-hi-fg8v1vQnis90EayKmhogmTM-8Bzl-CwaRoNpalBQBCVCFxJB9KUJjS15g49qFIrhoATcrPz7V2q3SZE19brZPu4_nbxz4JQILjW-W62u0uZaj98tFXXfSULzI4BWbT5a7vNw44BZQHujWP38-vTYP2oqH07RLepV64ffEwWWckVH5V5DP4D-35gXQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072620_45_459</pqid></control><display><type>book_chapter</type><title>One-Probe Search</title><source>Springer Books</source><creator>Östlin, Anna ; Pagh, Rasmus</creator><contributor>Triguero, Francisco ; Conejo, Ricardo ; Eidenbenz, Stephan ; Morales, Rafael ; Hennessy, Matthew ; Widmayer, Peter ; Eidenbenz, Stephan ; Triguero, Francisco ; Conejo, Ricardo ; Morales, Rafael ; Hennessy, Matthew ; Widmayer, Peter</contributor><creatorcontrib>Östlin, Anna ; Pagh, Rasmus ; Triguero, Francisco ; Conejo, Ricardo ; Eidenbenz, Stephan ; Morales, Rafael ; Hennessy, Matthew ; Widmayer, Peter ; Eidenbenz, Stephan ; Triguero, Francisco ; Conejo, Ricardo ; Morales, Rafael ; Hennessy, Matthew ; Widmayer, Peter</creatorcontrib><description>We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - ε, and otherwise returns “don’t know”. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage far smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient deterministic updates, exhibiting new probabilistic guarantees on dictionary running time.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540438645</identifier><identifier>ISBN: 9783540438649</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540454659</identifier><identifier>EISBN: 9783540454656</identifier><identifier>DOI: 10.1007/3-540-45465-9_38</identifier><identifier>OCLC: 958521841</identifier><identifier>LCCallNum: Q334-342</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Bipartite Graph ; Computer science; control theory; systems ; Exact sciences and technology ; Hash Function ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Priority Queue ; Software ; Space Usage ; Word Probe</subject><ispartof>Automata, Languages and Programming, 2002, Vol.2380, p.439-450</ispartof><rights>Springer-Verlag Berlin Heidelberg 2002</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072620-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45465-9_38$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45465-9_38$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14614288$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Triguero, Francisco</contributor><contributor>Conejo, Ricardo</contributor><contributor>Eidenbenz, Stephan</contributor><contributor>Morales, Rafael</contributor><contributor>Hennessy, Matthew</contributor><contributor>Widmayer, Peter</contributor><contributor>Eidenbenz, Stephan</contributor><contributor>Triguero, Francisco</contributor><contributor>Conejo, Ricardo</contributor><contributor>Morales, Rafael</contributor><contributor>Hennessy, Matthew</contributor><contributor>Widmayer, Peter</contributor><creatorcontrib>Östlin, Anna</creatorcontrib><creatorcontrib>Pagh, Rasmus</creatorcontrib><title>One-Probe Search</title><title>Automata, Languages and Programming</title><description>We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - ε, and otherwise returns “don’t know”. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage far smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient deterministic updates, exhibiting new probabilistic guarantees on dictionary running time.</description><subject>Applied sciences</subject><subject>Bipartite Graph</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Hash Function</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Priority Queue</subject><subject>Software</subject><subject>Space Usage</subject><subject>Word Probe</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540438645</isbn><isbn>9783540438649</isbn><isbn>3540454659</isbn><isbn>9783540454656</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2002</creationdate><recordtype>book_chapter</recordtype><recordid>eNotUMtOwzAQNE8RSiWOHLlwdPF6bcc-ooqXVKlIwNlyEpsWShLscODvcdrurrTSzM5IO4RcAZsBY-UtUikYFVIoSY1FfUDOMSNbwBySAhQARRTmaE-gVkIek4Ih49SUAk9JYaSWHLSAMzJN6ZPlQg7C6IJcLltPX2JX-etX72K9uiAnwW2Sn-73hLw_3L_Nn-hi-fg8v1vQnis90EayKmhogmTM-8Bzl-CwaRoNpalBQBCVCFxJB9KUJjS15g49qFIrhoATcrPz7V2q3SZE19brZPu4_nbxz4JQILjW-W62u0uZaj98tFXXfSULzI4BWbT5a7vNw44BZQHujWP38-vTYP2oqH07RLepV64ffEwWWckVH5V5DP4D-35gXQ</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Östlin, Anna</creator><creator>Pagh, Rasmus</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2002</creationdate><title>One-Probe Search</title><author>Östlin, Anna ; Pagh, Rasmus</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p268t-d50bf81df500eef2f2f71a3ddd8179c141f4b4f265a15979fdc82a3e167860313</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Bipartite Graph</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Hash Function</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Priority Queue</topic><topic>Software</topic><topic>Space Usage</topic><topic>Word Probe</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Östlin, Anna</creatorcontrib><creatorcontrib>Pagh, Rasmus</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Östlin, Anna</au><au>Pagh, Rasmus</au><au>Triguero, Francisco</au><au>Conejo, Ricardo</au><au>Eidenbenz, Stephan</au><au>Morales, Rafael</au><au>Hennessy, Matthew</au><au>Widmayer, Peter</au><au>Eidenbenz, Stephan</au><au>Triguero, Francisco</au><au>Conejo, Ricardo</au><au>Morales, Rafael</au><au>Hennessy, Matthew</au><au>Widmayer, Peter</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>One-Probe Search</atitle><btitle>Automata, Languages and Programming</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2002</date><risdate>2002</risdate><volume>2380</volume><spage>439</spage><epage>450</epage><pages>439-450</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540438645</isbn><isbn>9783540438649</isbn><eisbn>3540454659</eisbn><eisbn>9783540454656</eisbn><abstract>We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - ε, and otherwise returns “don’t know”. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage far smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient deterministic updates, exhibiting new probabilistic guarantees on dictionary running time.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45465-9_38</doi><oclcid>958521841</oclcid><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Automata, Languages and Programming, 2002, Vol.2380, p.439-450 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_14614288 |
| source | Springer Books |
| subjects | Applied sciences Bipartite Graph Computer science control theory systems Exact sciences and technology Hash Function Memory and file management (including protection and security) Memory organisation. Data processing Priority Queue Software Space Usage Word Probe |
| title | One-Probe Search |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T21%3A15%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=One-Probe%20Search&rft.btitle=Automata,%20Languages%20and%20Programming&rft.au=%C3%96stlin,%20Anna&rft.date=2002&rft.volume=2380&rft.spage=439&rft.epage=450&rft.pages=439-450&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540438645&rft.isbn_list=9783540438649&rft_id=info:doi/10.1007/3-540-45465-9_38&rft_dat=%3Cproquest_pasca%3EEBC3072620_45_459%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540454659&rft.eisbn_list=9783540454656&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072620_45_459&rft_id=info:pmid/&rfr_iscdi=true |