<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Hashed table in Application Development and Automation Discussions</title>
    <link>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311685#M506390</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi Sai,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;constant time means that the record access time is independent of the number of records stored. &lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;If the table is unsorted, the avarage search time will grow directly with the number of records. In sorted tables, the binary search will we much faster but still access time will grow with the number of records.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Using hash algorithm, a unique hash key is calculated based on records contents allowing a direct access.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Read this article about hashing techniques: &amp;lt;a href="http://en.wikipedia.org/wiki/Hash_table"&amp;gt;http://en.wikipedia.org/wiki/Hash_table#Time_complexity_and_common_uses_of_hash_tables&amp;lt;/a&amp;gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Regards,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Clemens&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Sat, 19 May 2007 09:37:19 GMT</pubDate>
    <dc:creator>Clemenss</dc:creator>
    <dc:date>2007-05-19T09:37:19Z</dc:date>
    <item>
      <title>Hashed table</title>
      <link>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311683#M506388</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;What exactly mean by the processing the time for the Hashed table is constant??&lt;/P&gt;&lt;P&gt;How can we say that time is constant... Not based on algorithm...&lt;/P&gt;&lt;P&gt;in a practical way !!&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;And what is the function code to check the attributes of the INFOTYPES..&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 19 May 2007 08:29:52 GMT</pubDate>
      <guid>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311683#M506388</guid>
      <dc:creator>Former Member</dc:creator>
      <dc:date>2007-05-19T08:29:52Z</dc:date>
    </item>
    <item>
      <title>Re: Hashed table</title>
      <link>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311684#M506389</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;se11---&amp;gt;PA0001 or P0001 for infotype 01.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Regards&lt;/P&gt;&lt;P&gt;Peram&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 19 May 2007 09:10:44 GMT</pubDate>
      <guid>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311684#M506389</guid>
      <dc:creator>Former Member</dc:creator>
      <dc:date>2007-05-19T09:10:44Z</dc:date>
    </item>
    <item>
      <title>Re: Hashed table</title>
      <link>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311685#M506390</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi Sai,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;constant time means that the record access time is independent of the number of records stored. &lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;If the table is unsorted, the avarage search time will grow directly with the number of records. In sorted tables, the binary search will we much faster but still access time will grow with the number of records.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Using hash algorithm, a unique hash key is calculated based on records contents allowing a direct access.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Read this article about hashing techniques: &amp;lt;a href="http://en.wikipedia.org/wiki/Hash_table"&amp;gt;http://en.wikipedia.org/wiki/Hash_table#Time_complexity_and_common_uses_of_hash_tables&amp;lt;/a&amp;gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Regards,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Clemens&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 19 May 2007 09:37:19 GMT</pubDate>
      <guid>https://community.sap.com/t5/application-development-and-automation-discussions/hashed-table/m-p/2311685#M506390</guid>
      <dc:creator>Clemenss</dc:creator>
      <dc:date>2007-05-19T09:37:19Z</dc:date>
    </item>
  </channel>
</rss>

