Hi,
I saw you did a project in the past that is similar to something I am looking to develop (see previous description below).
I would like to have a spider that will crawl LinkedIn site and pull information and put it into a MS Outlook contact file. I would like to target certain people (not the entire LinkedIn site).
Can you tell me if you can do this and give me a price estimate?
Thanks,
Steve
Posting by another member tpay (13599):
[login to view URL] and [login to view URL] are online social networks that allow individuals to connect to each other. One can create an account for free and fill in a personal profile. The second step is that you connect your profile to profiles of people that are related to you (collegues, business associates, etcetera). By doing so, a wide network of related people is formed.
Application
I need an application that can save my network to a sqlserver database. I want it to login on my linkedin and ecademy accounts and spider all my contacts, and their contacts, and their contacts, etcetera.
I need the following information to be stored to the database: I want each contact to be stored in a contacts table (by name and unique number), a particular contact may only appear once in this table. In another table I want it to store the connection between 2 contacts in the first table. Additionally, in another table I want to be stored where a particular contact or a connection was found: on ecademy or on linkedin. If a contact exists in both linkedin and ecademy, he or she may only appear once in the contactstable, but somewhere has to be stored that he or she is active on both websites.
Details
- in a config file I want to specify my account login/password for ecademy and linkedin, and sql server specifics
- when I run the app I want to see a status page that displays how many contacts and links have been saved
- the application (and database) has to be scalable: I may add other networking sites later on (by hiring you of course)
- the application might become a spider that spiders continuously for different users concurrently