INFERENCE QUERY PROCESSING USING HYPER CUBE COMPRISING IMPROVED BUILDING METHOD FOR HYPER CUBE INDEX

摘要

Subject invention(Main body),Attribute(Predicate),The form of structure in ontology is triple(It is triple)The purpose manufactured in target or purpose(Purpose)Classification,Attribute and class and attributes defining are in class T- casees(T- casees)To some cubes(Sting cube)Between,It is the titanium in case of the example based on concept that this, which is defined as definition, --- one kind is for indicating case(One case)Region to bit matrix(Bit matrix)Method,The initial deployment method of hypercube index line and the i of exchange step)The column of index data(ii)Only 0 and 1 bit value of N*N matrixes,It has(It is associated with the length N of the row in the index data in array)L open circuits pass through expression binary digit to a decimal N*(N/L)Matrix(Compressed data indexes in array))iii)It further include that parallel processing index data generates progress data compression step iv during the N iteration according to the number of triple N),Segmentation index data enters a N* of K(N/L)Matrix(Array)It rows the boat and search method is related to by using a hypercube,K*(N/L)It includes that step stores that matrix, which improves,(Array)The hypercube of the index data of the inference method of inde buildings,It include: that hypercube index generation method of the invention can be generated in a reasonable time with whole ontology,It may be in the practical reasoning query processing time.