Performance of a multi-key access method based on descriptors and superimposed coding techniques
暂无分享,去创建一个
[1] Christos Faloutsos,et al. Design Considerations for a Message File Server , 1984, IEEE Transactions on Software Engineering.
[2] W. S. Luk. On estimating block accesses in database organizations , 1983, CACM.
[3] Malcolm C. Harrison,et al. Implementation of the substring test by hashing , 1971, CACM.
[4] Alfred V. Aho,et al. Optimal partial-match retrieval when fields are independently specified , 1979, ACM Trans. Database Syst..
[5] Guy M. Lohman,et al. Differential files: their application to the maintenance of large databases , 1976, TODS.
[6] John L. Pfaltz,et al. Partial-match retrieval using indexed descriptor files , 1980, CACM.
[7] Alfonso F. Cardenas. Analysis and performance of inverted data base structures , 1975, CACM.
[8] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[9] Gio Wiederhold,et al. Database Design , 1977 .
[10] Gio Wiederhold,et al. Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.
[11] C.S. Roberts,et al. Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.
[12] Kotagiri Ramamohanarao,et al. A two level superimposed coding scheme for partial match retrieval , 1983, Inf. Syst..