pular para conteúdo
Superimposed Coding Versus Sequential and Inverted Files. Ver prévia deste item
FecharVer prévia deste item
Checando...

Superimposed Coding Versus Sequential and Inverted Files.

Autor: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
Editora: Ft. Belvoir Defense Technical Information Center MAR 1977.
Edição/Formato   Livro : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:
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  Ler mais...
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
Número OCLC: 227457766
Descrição: 143 p.

Resumo:

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.

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.
Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


<http://www.worldcat.org/oclc/227457766>
library:oclcnum"227457766"
library:placeOfPublication
library:placeOfPublication
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: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:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.