DocumentCode
2072005
Title
Greedy file-a new data organization concept for partial match retrieval
Author
Chou, Yun-Huan ; Yang, Wei-Pang ; Chang, C.C.
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao-Tung Univ., Hsinchu, Taiwan
fYear
1989
fDate
20-22 Sep 1989
Firstpage
263
Lastpage
270
Abstract
A method is presented for arranging a set of records into buckets to facilitate partial match retrieval. The idea is mainly motivated by the concept of optimal Cartesian product files. For a set of records, the method recursively partitions them into a collection of optimal Cartesian product files. A performance formula of this new file structure is derived and the superiority of this data organization concept is established. It is shown that the Cartesian product file is only a special case of the proposed file system
Keywords
file organisation; information retrieval systems; records management; OCPFS; buckets; data organization concept; file structure; file system; greedy file; new data organization concept; optimal Cartesian product files; partial match retrieval; performance formula; Computer science; Contracts; Councils; Data engineering; Design methodology; File systems; Information retrieval; Mathematics; Niobium; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International
Conference_Location
Orlando, FL
Print_ISBN
0-8186-1964-3
Type
conf
DOI
10.1109/CMPSAC.1989.65094
Filename
65094
Link To Document