Efficiency of a Binary Comparison Storage Technique

Efficiency of a Binary Comparison Storage Technique

The efficiency of an information storage technique based on binary comparisons is analyzed. Generating functions are applied to finding the mean and variance of the number of comparisons needed to retrieve one item from a store of n items. Surprisingly, the variance approaches 7 - 2/3π 2 for large n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of the ACM 1974-07, Vol.21 (3), p.376-384
Hauptverfasser: Palmer, E. M., Rahimi, M. A., Robinson, R. W.
Format: Artikel
Sprache:eng
Schlagworte:
Information storage
Stores
Variance
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 384
container_issue 3
container_start_page 376
container_title Journal of the ACM
container_volume 21
creator Palmer, E. M.
Rahimi, M. A.
Robinson, R. W.
description The efficiency of an information storage technique based on binary comparisons is analyzed. Generating functions are applied to finding the mean and variance of the number of comparisons needed to retrieve one item from a store of n items. Surprisingly, the variance approaches 7 - 2/3π 2 for large n .
doi_str_mv 10.1145/321832.321836
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28918456</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808075702</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-172ee32c3bd3a917f2f6f705b379d5567200041ce72dc1192303be014c431fb53</originalsourceid><addsrcrecordid>eNp9kDFPwzAQRi0EEqUwsmdCLC53vjhORqhaQKrEQJHYIse1wSiNg90O_fekhJnp6aSn7-4-xq4RZoi5vCOBJYnZL4oTNkEpFVck30_ZBAByLnPEc3aR0tcwggA1YbRwzhtvO3PIgst09uA7HQ_ZPGx7HX0KXfa6C1F_2GxtzWfnv_f2kp053SZ79ccpe1su1vMnvnp5fJ7fr7ghKncclbCWhKFmQ7pC5YQrnALZkKo2UhZKHI9CY5XYGMRKEFBjAXOTE7pG0pTdjLl9DMPatKu3PhnbtrqzYZ9qUVZY5rIYxNt_RSyhBCUViEHlo2piSClaV_fRb4ePa4T62GI9tjiioB9JFGGi</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1808075702</pqid></control><display><type>article</type><title>Efficiency of a Binary Comparison Storage Technique</title><source>ACM Digital Library Complete</source><creator>Palmer, E. M. ; Rahimi, M. A. ; Robinson, R. W.</creator><creatorcontrib>Palmer, E. M. ; Rahimi, M. A. ; Robinson, R. W.</creatorcontrib><description>The efficiency of an information storage technique based on binary comparisons is analyzed. Generating functions are applied to finding the mean and variance of the number of comparisons needed to retrieve one item from a store of n items. Surprisingly, the variance approaches 7 - 2/3π 2 for large n .</description><identifier>ISSN: 0004-5411</identifier><identifier>EISSN: 1557-735X</identifier><identifier>DOI: 10.1145/321832.321836</identifier><language>eng</language><subject>Information storage ; Stores ; Variance</subject><ispartof>Journal of the ACM, 1974-07, Vol.21 (3), p.376-384</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-172ee32c3bd3a917f2f6f705b379d5567200041ce72dc1192303be014c431fb53</citedby><cites>FETCH-LOGICAL-c338t-172ee32c3bd3a917f2f6f705b379d5567200041ce72dc1192303be014c431fb53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Palmer, E. M.</creatorcontrib><creatorcontrib>Rahimi, M. A.</creatorcontrib><creatorcontrib>Robinson, R. W.</creatorcontrib><title>Efficiency of a Binary Comparison Storage Technique</title><title>Journal of the ACM</title><description>The efficiency of an information storage technique based on binary comparisons is analyzed. Generating functions are applied to finding the mean and variance of the number of comparisons needed to retrieve one item from a store of n items. Surprisingly, the variance approaches 7 - 2/3π 2 for large n .</description><subject>Information storage</subject><subject>Stores</subject><subject>Variance</subject><issn>0004-5411</issn><issn>1557-735X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1974</creationdate><recordtype>article</recordtype><recordid>eNp9kDFPwzAQRi0EEqUwsmdCLC53vjhORqhaQKrEQJHYIse1wSiNg90O_fekhJnp6aSn7-4-xq4RZoi5vCOBJYnZL4oTNkEpFVck30_ZBAByLnPEc3aR0tcwggA1YbRwzhtvO3PIgst09uA7HQ_ZPGx7HX0KXfa6C1F_2GxtzWfnv_f2kp053SZ79ccpe1su1vMnvnp5fJ7fr7ghKncclbCWhKFmQ7pC5YQrnALZkKo2UhZKHI9CY5XYGMRKEFBjAXOTE7pG0pTdjLl9DMPatKu3PhnbtrqzYZ9qUVZY5rIYxNt_RSyhBCUViEHlo2piSClaV_fRb4ePa4T62GI9tjiioB9JFGGi</recordid><startdate>19740701</startdate><enddate>19740701</enddate><creator>Palmer, E. M.</creator><creator>Rahimi, M. A.</creator><creator>Robinson, R. W.</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19740701</creationdate><title>Efficiency of a Binary Comparison Storage Technique</title><author>Palmer, E. M. ; Rahimi, M. A. ; Robinson, R. W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-172ee32c3bd3a917f2f6f705b379d5567200041ce72dc1192303be014c431fb53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1974</creationdate><topic>Information storage</topic><topic>Stores</topic><topic>Variance</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Palmer, E. M.</creatorcontrib><creatorcontrib>Rahimi, M. A.</creatorcontrib><creatorcontrib>Robinson, R. W.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of the ACM</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Palmer, E. M.</au><au>Rahimi, M. A.</au><au>Robinson, R. W.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficiency of a Binary Comparison Storage Technique</atitle><jtitle>Journal of the ACM</jtitle><date>1974-07-01</date><risdate>1974</risdate><volume>21</volume><issue>3</issue><spage>376</spage><epage>384</epage><pages>376-384</pages><issn>0004-5411</issn><eissn>1557-735X</eissn><abstract>The efficiency of an information storage technique based on binary comparisons is analyzed. Generating functions are applied to finding the mean and variance of the number of comparisons needed to retrieve one item from a store of n items. Surprisingly, the variance approaches 7 - 2/3π 2 for large n .</abstract><doi>10.1145/321832.321836</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0004-5411
ispartof Journal of the ACM, 1974-07, Vol.21 (3), p.376-384
issn 0004-5411
1557-735X
language eng
recordid cdi_proquest_miscellaneous_28918456
source ACM Digital Library Complete
subjects Information storage
Stores
Variance
title Efficiency of a Binary Comparison Storage Technique
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T02%3A01%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficiency%20of%20a%20Binary%20Comparison%20Storage%20Technique&rft.jtitle=Journal%20of%20the%20ACM&rft.au=Palmer,%20E.%20M.&rft.date=1974-07-01&rft.volume=21&rft.issue=3&rft.spage=376&rft.epage=384&rft.pages=376-384&rft.issn=0004-5411&rft.eissn=1557-735X&rft_id=info:doi/10.1145/321832.321836&rft_dat=%3Cproquest_cross%3E1808075702%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1808075702&rft_id=info:pmid/&rfr_iscdi=true