컨텐츠로 이동
Superimposed Coding Versus Sequential and Inverted Files. 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Superimposed Coding Versus Sequential and Inverted Files.

저자: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
출판사: Ft. Belvoir Defense Technical Information Center MAR 1977.
판/형식:   도서 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
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  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

문서 형식:
모든 저자 / 참여자: Thomas Butler Hickey; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB.
OCLC 번호: 227457766
설명: 143 p.

초록:

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.

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<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

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.