| 摘要 |
A method for parallel matching a user profile with desired data comprises partitioning a profile database into sub-partitions having data subsets, the subsets comprising predicates used to assert selected properties to information items, mapping each sub-partition onto one or more processors yielding greatest processing efficiency, communicating an information item to each processor, and matching the information with a corresponding predicate. The mapping of the sub-partition to a processor may be based on a sub-partition's cost and the speed of the processor. If the sub-partitions have any overlap, greedy mapping partitioning may be used. Alternatively, b-mapping or cluster partitioning may be used. The method may include building a profile index (504) which includes a collection of user profiles, and which identifies predicates shared by user profiles. The method may be applied to a large scale webcasting system.
|
