Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base

作者: Berra , Soon Myoung Chung , Hachem

DOI: 10.1109/MC.1987.1663506

关键词:

摘要: This article presents techniques for managing a very large data/knowledge base to support multiple inference-mechanisms logic programming. Because evaluation of goals can require accessing data from the extensional database, or EDB, in general ways, one must often resort indexing on all fields database facts. formidable management problem that index may be larger than EDB itself. becomes even more serious this case bases (hundreds gigabytes), since considerably hardware will required process and store data. In order reduce amount without losing generality, authors form surrogate file, which is hashing transformation Superimposed code words (SCW), concatenated (CCW), transformed inverted lists (TIL) are possible structures file. these transformations quite regular compact, consider computer architecture processing

参考文章(11)
Jayasooriah, R. M. Colomb, A clause indexing system for PROLOG based on superimposed coding Australian Computer Journal archive. ,vol. 18, pp. 18- 25 ,(2000)
C.S. Roberts, Partial-match retrieval via the method of superimposed codes Proceedings of the IEEE. ,vol. 67, pp. 1624- 1642 ,(1979) , 10.1109/PROC.1979.11543
J. W. Lloyd, Optimal partial-match retrieval Bit Numerical Mathematics. ,vol. 20, pp. 406- 413 ,(1980) , 10.1007/BF01933634
John W Lloyd, Kotagiri Ramamohanarao, Partial-match retrieval for dynamic files Bit Numerical Mathematics. ,vol. 22, pp. 150- 168 ,(1982) , 10.1007/BF01944474
Anil K. Garg, C. C. Gotlieb, Order-preserving key transformations ACM Transactions on Database Systems. ,vol. 11, pp. 213- 234 ,(1986) , 10.1145/5922.5923
Sudhir R. Ahuja, Charles S. Roberts, An associative/parallel processor for partial match retrieval using superimposed codes Proceedings of the 7th annual symposium on Computer Architecture - ISCA '80. pp. 218- 227 ,(1980) , 10.1145/800053.801929
Chris Faloutsos, Access methods for text ACM Computing Surveys. ,vol. 17, pp. 49- 74 ,(1985) , 10.1145/4078.4080
Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, H. Raymond Strong, Extendible hashing—a fast access method for dynamic files ACM Transactions on Database Systems. ,vol. 4, pp. 315- 344 ,(1979) , 10.1145/320083.320092
Alfonso F. Cárdenas, Analysis and performance of inverted data base structures Communications of The ACM. ,vol. 18, pp. 253- 263 ,(1975) , 10.1145/360762.360766