Weighted Increment Linear Search for Scatter Tables.

Saved in:
Bibliographic Details
Title: Weighted Increment Linear Search for Scatter Tables.
Authors: Luccio, Fabrizio1, Baxendale, P.
Source: Communications of the ACM. Dec1972, Vol. 15 Issue 12, p1045-1047. 3p. 1 Chart.
Subjects: Database searching, COMSKEE (Computer program language), Computers, Electronic equipment, Electronic data processing, High technology industries
Abstract: A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2R. It allows full table searching, and practically eliminates primary clustering at a very tow cost. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5263805
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Weighted Increment Linear Search for Scatter Tables.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Luccio%2C+Fabrizio%22">Luccio, Fabrizio</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Baxendale%2C+P%2E%22">Baxendale, P.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Dec1972, Vol. 15 Issue 12, p1045-1047. 3p. 1 Chart.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Database+searching%22">Database searching</searchLink><br /><searchLink fieldCode="DE" term="%22COMSKEE+%28Computer+program+language%29%22">COMSKEE (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Computers%22">Computers</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+equipment%22">Electronic equipment</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22High+technology+industries%22">High technology industries</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2R. It allows full table searching, and practically eliminates primary clustering at a very tow cost. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5263805
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/361598.361617
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 3
        StartPage: 1045
    Subjects:
      – SubjectFull: Database searching
        Type: general
      – SubjectFull: COMSKEE (Computer program language)
        Type: general
      – SubjectFull: Computers
        Type: general
      – SubjectFull: Electronic equipment
        Type: general
      – SubjectFull: Electronic data processing
        Type: general
      – SubjectFull: High technology industries
        Type: general
    Titles:
      – TitleFull: Weighted Increment Linear Search for Scatter Tables.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Luccio, Fabrizio
      – PersonEntity:
          Name:
            NameFull: Baxendale, P.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec1972
              Type: published
              Y: 1972
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 15
            – Type: issue
              Value: 12
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1