document: Parallel crawling for online social networks Given a huge online social network , how do we retrieve information from it through crawling ? Even better , how do we improve the crawling performance by using parallel crawlers that work independently ? In this paper , we present the framework of parallel crawlers for online social networks , utilizing a centralized queue . To show how this works in practice , we describe our implementation of the crawlers for an online auction website . The crawlers work independently , therefore the failing of one crawler does not affect the others at all . The framework ensures that no redundant crawling would occur . Using the crawlers that we built , we visited a total of approximately 11 million auction users , about 66,000 of which were completely crawled .
doc_bio_tags: O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O