Patent ID: 7529769
Filing Date: 2009-05-05
Classification: G06F,Y10S

Abstract:
1. A method of partitioning a collection C of databases, where each database has a database index db, numbered db=1, . . . , DB, and contains at least one folder, each folder has a folder index fo(db), numbered fo(db)=1, . . . , FO(db), each folder contains at least one file, each file has a file index fi(fo,db), numbered fi(fo,db)=1, . . . , F(fo,db), each file contains at least one document, each document has a document index do(fi,fo,db), numbered do(fi,fo,db)=1, . . . , DO(fi,fo,db), each document contains at least one of words, phrases, symbols, mathematical expressions and/or image components, referred to collectively as “features,” with each feature having a feature index fe, numbered fe(do,fi,fo,db)=1, . . . , FE(do,fi,fo,db), and each index being expressed as a sequence of one or more bits, the method comprising providing a computer that is programmed: to receive positive and non-negative integers DB, FO, FI, DO and FE and ΔM5′, characterizing number of databases, number of folders in the databases, number of files in the folders, number of documents in the files, and number of features in the documents, respectively, in a collection of databases; to determine a first exponent M1 satisfying 2 to determine a second exponent M2(db) satisfying 2 to determine a third exponent M3(db;fo) satisfying 2 to determine a fourth exponent M4(db;fo;fi) satisfying 2 to determine a fifth exponent M5(db;fo;fi;do) satisfying 2 to provide an index of features in each document in each file in each folder in each database as a concatenation of N=M1+M2+M3+M4+M5 binary numbers; and to provide a partition of the database collection as a combination of L binary numbers (L≦N−1) and R=N−L binary numbers representing M1 database indices, M2 folder indices, M3 file indices, M4 document indices and M5 feature indices, where L is chosen from the group of integers consisting of M1, M1+M2, M1+M2+M3 and M1+M2+M3+M4.