passa ai contenuti
Superimposed Coding Versus Sequential and Inverted Files. Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Superimposed Coding Versus Sequential and Inverted Files.

Autore: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
Editore: Ft. Belvoir Defense Technical Information Center MAR 1977.
Edizione/Formato:   Libro : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
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  Per saperne di più…
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
Numero OCLC: 227457766
Descrizione: 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.

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<http://www.worldcat.org/oclc/227457766>
library:oclcnum"227457766"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227457766>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/7960640>
schema:inLanguage"en"
schema:name"Superimposed Coding Versus Sequential and Inverted Files."@en
schema:numberOfPages"143"
schema:publisher
schema:url

Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.