View in EDS PDF Full Text

Jump Searching: A Fast Sequential Search Technique.

Saved in:
Bibliographic Details
Title: Jump Searching: A Fast Sequential Search Technique.
Authors: Shneiderman, Ben, Graham, S.L., Rivest, R.L.
Source: Communications of the ACM. Oct78, Vol. 21 Issue 10, p831-834. 4p. 2 Charts.
Subjects: Sequential processing (Computer science), Database searching
Abstract: Examines the variants of the classic jump searching scheme in sequential file structures. Problem on locating record in file management; Comparison of costs between binary searching with sequential searching; Applicability of binary tree search for records placed in random access memory.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5225338
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Jump Searching: A Fast Sequential Search Technique.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Shneiderman%2C+Ben%22">Shneiderman, Ben</searchLink><br /><searchLink fieldCode="AR" term="%22Graham%2C+S%2EL%2E%22">Graham, S.L.</searchLink><br /><searchLink fieldCode="AR" term="%22Rivest%2C+R%2EL%2E%22">Rivest, R.L.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Oct78, Vol. 21 Issue 10, p831-834. 4p. 2 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Sequential+processing+%28Computer+science%29%22">Sequential processing (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Database+searching%22">Database searching</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Examines the variants of the classic jump searching scheme in sequential file structures. Problem on locating record in file management; Comparison of costs between binary searching with sequential searching; Applicability of binary tree search for records placed in random access memory.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5225338
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/359619.359623
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 4
        StartPage: 831
    Subjects:
      – SubjectFull: Sequential processing (Computer science)
        Type: general
      – SubjectFull: Database searching
        Type: general
    Titles:
      – TitleFull: Jump Searching: A Fast Sequential Search Technique.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Shneiderman, Ben
      – PersonEntity:
          Name:
            NameFull: Graham, S.L.
      – PersonEntity:
          Name:
            NameFull: Rivest, R.L.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct78
              Type: published
              Y: 1978
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 21
            – Type: issue
              Value: 10
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1