Cell abstract indices for content-based approximate query processing in structured peer-to-peer data systems

In this paper, cell abstract indices are presented to process content-based approximate queries in structured P2P data systems. It can be used to search as few peers as possible but get as many returns satisfying users' queries as possible on the guarantee of high autonomy of peers. Also, cell abstract indices have low system cost, can improve the query processing speed, and support very frequent updates and the set information publishing method. Simulation experiments are performed and analyzed to show the effectiveness of the proposed indices.