A partitioned signature file structure for multiattribute and text retrieval

A partitioning method is introduced for reducing the search space required on the signature file. A partitioned signature file is better than the multilevel signature file and the S-tree in that it has an extremely small storage and processing overhead. Three partitioning schemes are outlined and their performance discussed. A description is given of the data structure necessary to support the partitioning schemes and the algorithms for signature insertion, deletion, and retrieval.<<ETX>>

[1]  Christos Faloutsos,et al.  Description and performance analysis of signature file methods for office filing , 1987, TOIS.

[2]  Dik Lun Lee,et al.  Partitioned signature files: design issues and performance evaluation , 1989, TOIS.

[3]  Christos Faloutsos,et al.  Access methods for text , 1985, CSUR.

[4]  Christos Faloutsos,et al.  Design Considerations for a Message File Server , 1984, IEEE Transactions on Software Engineering.

[5]  Kotagiri Ramamohanarao,et al.  A two level superimposed coding scheme for partial match retrieval , 1983, Inf. Syst..

[6]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[7]  Dik Lun Lee,et al.  Text Retrieval Machines , 1985 .

[8]  Dik Lun Lee.  A word-parallel, bit-serial signature processor for superimposed coding , 1986, 1986 IEEE Second International Conference on Data Engineering.

[9]  C.S. Roberts,et al.  Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.

[10]  John L. Pfaltz,et al.  Partial-match retrieval using indexed descriptor files , 1980, CACM.

[11]  Kotagiri Ramamohanarao,et al.  Multikey access methods based on superimposed coding techniques , 1987, TODS.

[12]  Christos Faloutsos,et al.  Optimal signature extraction and information loss , 1987, TODS.

[13]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[14]  Sudhir Ahuja,et al.  An associative/parallel processor for partial match retrieval using superimposed codes , 1980, ISCA '80.

[15]  Kurt Maly,et al.  An efficient file structure for document retrieval in the automated office environment , 1987, 1987 IEEE Third International Conference on Data Engineering.

[16]  Uwe Deppisch,et al.  S-tree: a dynamic balanced signature index for office retrieval , 1986, SIGIR '86.