zum Inhalt wechseln
Superimposed Coding Versus Sequential and Inverted Files. Titelvorschau
SchließenTitelvorschau
Prüfung…

Superimposed Coding Versus Sequential and Inverted Files.

Verfasser/in: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
Verlag: Ft. Belvoir Defense Technical Information Center MAR 1977.
Ausgabe/Format   Buch : EnglischAlle Ausgaben und Formate anzeigen
Datenbank:WorldCat
Zusammenfassung:
The relative efficiency of three computer search algorithms was compared for searching large bibliographic files with Boolean search strategies. The sequential and inverted files represent the two most common file structures used today for bibliographic searching. Superimposed coding is an alternative that is becoming more attractive as the speed of computers improves. The superimposed search has a key associated  Weiterlesen…
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Dokumenttyp: Buch
Alle Autoren: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
OCLC-Nummer: 227457766
Beschreibung: 143 p.

Abstract:

The relative efficiency of three computer search algorithms was compared for searching large bibliographic files with Boolean search strategies. The sequential and inverted files represent the two most common file structures used today for bibliographic searching. Superimposed coding is an alternative that is becoming more attractive as the speed of computers improves. The superimposed search has a key associated with each record in the data base to act as a screen to eliminate the majority of records from further consideration. The keys are based on the bigrams and trigrams contained in the record, and are arranged in a linear file. The sequential search is a character by character scan of the entire file. This search is facilitated by constructing a finite state machine at the beginning of the search to match the search terms. The inverted file is fairly standard, except for the use of bit vectors to hold the postings of very common entries. A data base of 100,000 INSPEC records, from nine months of 1974, was used for testing the algorithms with 339 real-life search questions.

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.
Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


<http://www.worldcat.org/oclc/227457766>
library:oclcnum"227457766"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227457766>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Computer Programming and Software."
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Information retrieval."
schema:about
schema:about
schema:about
schema:contributor
rdf:typeschema:Organization
schema:name"ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB."
schema:contributor
schema:datePublished"MAR 1977"
schema:datePublished"1977"
schema:description"The relative efficiency of three computer search algorithms was compared for searching large bibliographic files with Boolean search strategies. The sequential and inverted files represent the two most common file structures used today for bibliographic searching. Superimposed coding is an alternative that is becoming more attractive as the speed of computers improves. The superimposed search has a key associated with each record in the data base to act as a screen to eliminate the majority of records from further consideration. The keys are based on the bigrams and trigrams contained in the record, and are arranged in a linear file. The sequential search is a character by character scan of the entire file. This search is facilitated by constructing a finite state machine at the beginning of the search to match the search terms. The inverted file is fairly standard, except for the use of bit vectors to hold the postings of very common entries. A data base of 100,000 INSPEC records, from nine months of 1974, was used for testing the algorithms with 339 real-life search questions."
schema:exampleOfWork<http://worldcat.org/entity/work/id/7960640>
schema:inLanguage"en"
schema:name"Superimposed Coding Versus Sequential and Inverted Files."
schema:numberOfPages"143"
schema:publisher
rdf:typeschema:Organization
schema:name"Defense Technical Information Center"

Content-negotiable representations

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.