Slashdot Mirror


Computing PageRank on your PC?

An anonymous reader writes "A group of CS researchers of the University of Milan has found a way to compress web graphs at 3 bits per link, and to access them in compressed form. They provide data sets representing real snapshots of portions of the web with one hundred million nodes and 1 billion links. You just need some bandwidth to download a few hundred megabytes of data, and you can compute PageRank with your PC. All the code involved is GPL'd, and the data are public: everybody can grok PageRank now!"

50 of 186 comments (clear)

  1. The major thing missing from Mozilla by Anonymous Coward · · Score: 5, Interesting

    Is a way to look at Google's pagerank. That's the only real thing the IE Google toolbar has over the Mozilla alternative.

    1. Re:The major thing missing from Mozilla by Anonymous Coward · · Score: 3, Informative

      http://googlebar.mozdev.org

    2. Re:The major thing missing from Mozilla by wherley · · Score: 3, Informative

      Tried it...but it provides no pagerank. They say:
      "We currently have no plans to implement pagerank"

      Still - a cool addition to mozilla.

    3. Re:The major thing missing from Mozilla by JamesDotCom · · Score: 2, Interesting

      The problem is, is that the google toolbars checksum changes constantly. So if you were to find out how the google toolbar works exactely regarding pagerank, all it takes if for googles official toolbar to change it and it wont work anymore. The catch is however, that if you send a wrong checksum to google, they don't send back an error message of any sort instead they send back a fake pagerank. So you wouldn't really know if it was still working or not.

  2. This sounds cool.. by xchino · · Score: 5, Funny

    Now if I can just think of a reason why I would need this..

    --
    Everyone is entitled to their own opinion. It's just that yours is stupid.
    1. Re:This sounds cool.. by Daniel_Staal · · Score: 5, Funny
      Now if I can just think of a reason why I would need this..

      And you call yourself a geek. *Sigh*.

      It doesn't matter why you need it. It's technical, GPLed, and has to do with Google. That's all the reason you need.

      --
      'Sensible' is a curse word.
    2. Re:This sounds cool.. by (trb001) · · Score: 5, Funny

      It's technical, GPLed, and has to do with Google

      It's a geek hattrick!

  3. Dumb Question: by Xesdeeni · · Score: 5, Interesting

    What's Page Rank? Does this indicate how often my page is visited?

    Xesdeeni

    1. Re:Dumb Question: by Chris_Stankowitz · · Score: 5, Informative

      Do you mods ever stop to wonder if this guy could have been asking a legit question? Its possible he doesn't know. Also possible that others don't. I know...I know..., this is /. how could he not know right. It is still very possible. I'm not saying he should have been modded up, but by modding him down someone may miss the chance to read his post and reply to it with an intelligent answer. All of that being said. I would answer his question. But now that I think about, I'm not sure what it is. I 'think' I know. But, I think he and I are in the same boat. I also thought about posting this as an AC, but I won't. Then surley someone will just think that it was the original poster posting as an AC. He may be trolling. He may not be. It won't hurt to answer the question.

    2. Re:Dumb Question: by Anonymous Coward · · Score: 5, Funny

      Jesus, you created a second account just to defend yourself!

    3. Re:Dumb Question: by biomass · · Score: 2, Informative

      Page rank, to a first order of approximation, ranks your page by "popularity". Using a voting system,it counts the number of links to your page.

      To a second order of approximation, it weights the votes of the referencing links by their popularity.

      To a third order of approximation, it is a Markov chain that measures the long term likelihood of you arriving at a page, if you to randomly traverse the net: taking random links out of a pages and occasionally take (1/20?) random jumps to arbitrary urls.

    4. Re:Dumb Question: by sig+cop · · Score: 3, Funny
      I didn't know what is it either.

      Mod parent and grandparent and great-grandparent up.

      Also, mod parents children up.

      Also, mod great-great-grandparents great-great-granddaughters up.

      Also, say up unto them verily, that the mod of the parent will be cast down the generations to be a mod on the children, and on the children's children, and on the children's children's chilluns.

      And also, mod up the nephews of the parents of the sibilings of the grandparent for though they be trolls or flaimbait, they are righteous in the eyes of the moderators.

      And thou shalt visit the mods onto the descendents on through the generations, for I, your Mod, have smote upon thee a mod pestilence that shalt not be lifted until the second coming of the JonKats.

      Thanks be to Mod, Amen

  4. Tee Hee by teamhasnoi · · Score: 5, Funny
    I bet the Searchking is steaming right about now...

    "Finally, proof!!"

  5. Some webmasters/SEO's are obsessive by Anonymous Coward · · Score: 5, Interesting

    If Google tweaks one thing, causing result 97 to shift to result 98, they notice. They'd be doing this daily to check on their pages.

  6. Which sites are the Root(s)? by amembleton · · Score: 5, Interesting

    When these Web Graph or Page Rank things are drawn up which sites do they use as the roots?

    I mean they've got to start with some site(s) and then go through each link from there.

    1. Re:Which sites are the Root(s)? by warkda+rrior · · Score: 5, Informative

      It is a graph, not a tree, so there is no one root. Maybe you are looking for the seed site, i.e. the first site added to the webgraph they construct. You can choose any site you prefer, although something well-connected is better. It seems to me that Yahoo! would be a good starting point.

      --
      You need to install an RTFM interface.
    2. Re:Which sites are the Root(s)? by menscher · · Score: 2, Interesting

      Google starts their webcrawl with the Stanford University home page. (Info based on a talk given by Craig SIlverstein, the directory of technology at Google.)

  7. beyond PageRank... by rfischer · · Score: 3, Interesting

    ... I would be interested in how the links change over time. Maybe take a new snapshot every day or week, see the web evolve.

    1. Re:beyond PageRank... by big_gibbon · · Score: 2, Interesting

      That would be amazingly cool.The only problem (and it's not really a problem) would be that generally people never, or rarely, remove links. If you limited this to links only (say) a month old or younger, you could see the paths of memes round the web . . . for example right now, you'd probably see a lot of BitTorrent hotspots, whereas a couple of years ago there'd be lots focussed on "all your base" . . .

      Anyone got a lot of procesing power and some spare time? ;)

      P

  8. PageRank is part of Google's algo by Anonymous Coward · · Score: 5, Informative

    It's basically how well linked to your page is, and how well linked to the pages linking to you are, and so on. It's an advanced form of link popularity. The idea is that the more people that link to something, the more influential/important it is. Some sites have high PageRanks of 10 (like Google), while Slashdot is something like an 8. Many pages are in the 4-6 range. Every link you create is like a "vote" for another web page.

    1. Re:PageRank is part of Google's algo by e2d2 · · Score: 4, Informative

      Google's PageRank was actually named after Larry Page, the creator of their system for ranking pages. Pun was obviously intended.

    2. Re:PageRank is part of Google's algo by Anonymous Coward · · Score: 2, Informative

      If your site is in the Google Directory (based on DMOZ), it may have a pagerank listed next to it.

    3. Re:PageRank is part of Google's algo by InfoCynic · · Score: 2, Informative

      PageRank is a one-dimensional recursive weighting for a web page. Intially you assume all pages were created equal. Now for each page, compute an updated PageRank based on indegree (number of pages linking to the site). You usually also introduce a weighting factor which is designed to simulate some random chance that you "jump" to the next page by just typing a URL, not following a link. After that, you typically normalize the scores (sum of squares must equal one is the preferred norm).


      Now you have to iterate, but on subsequent iterations, you're no longer consider with purely indegree. You care about the PageRank of pages linking to you. Pages that are "popular" and have high PageRank will boost your score. Typically you iterate until the values converge to within a given threshold. If you know linear algebra, you can also cheat and use eigenvalues, but that's not the point.


      There are better algorithms, like Kleinberg's, which gives each page a "hub" and "authority" score, where just linking to a page isn't enough, and you can learn more about that in a Web Algorithms course.

      --

      "Recta non toleranda futuaris nisi irrisus ridebis"

  9. I can see it now... by AyeRoxor! · · Score: 5, Funny

    "[...] even on a PC with as little as 256 Mbytes of RAM."

    Somewhere in 1980, milk shoots out of Bill Gates' nose for no apparent reason.

  10. Google with feedback by Sanity · · Score: 3, Interesting
    Doesn't Google have a patent on PageRank?

    Anyway, forgive the opportunism, but this is reasonably on-topic. Last weekend I set myself the ambitious task of improving on Google. I came up with a Google front-end which allows you to give feedback on the quality of search results, and thus refine your search. I could really use people's help to test it out - you can find it here. Feedback would really be appreciated.

    1. Re:Google with feedback by YoJ · · Score: 3, Insightful
      The whole point of patents is to encourage inventors to publish their inventions in a safe way. In some respects, PageRank is a good example of how the system is supposed to work. They publish the algorithm, people examine it and experiment further with it, but the inventors still have protection against people ripping off their work.

      The problem is that the GPL does not allow distribution of patent-encumbered technology. The authors of the code in question have every right to release their code with whatever license they want (I believe this is a free-speech issue, especially since the purpose of releasing the code is for doing research). People who receive their code may not use the code in a way that violates the patent, and in addition may not redistribute the code at all (since it would violate the GPL).

      The other issue is that PageRank is really a mathematical formula, and as such is unpatentable. What they actually patented is an algorithm for computing PageRank. If someone finds another way of computing the same formula, I think the patent holders would have a very hard time showing infringement.

  11. This is good, but... by Prince_Ali · · Score: 5, Funny
    This is good, but I'd rather have the google cache compressed to 3 bits per page.

    "I'll be there in a minute! I'm downloading the Internet!"

  12. Live XML Version by amembleton · · Score: 2, Insightful
    data sets representing real snapshots of portions of the web

    If these are snapshots then you'll need to keep downloading them for your Page Rank system to be up to date. The web is constantly changing and therefore so is Page Rank. I can't see having a data set on your computer being all that usefull as it'll soon expire.

    It would be far better to be able to link to a data set via XML and query it. That way you would have live upto the minute Page Ranks. I know that Google already does a live Page Rank system, but being able to access it and query it would be usefull.

  13. Google patents? by PaulBu · · Score: 4, Interesting

    All the code involved is GPL'd, and the data are public: everybody can grok PageRank now!

    GPL'd? Hmm, I thought that Google did patent the PageRank algorithm (correct me if I am wrong), so re-implementing THEIR algorithm even more efficiently would be incompatible with GPL. OTOH, if it is not THEIR algorithm, it can not be called 'PageRank'
    Oh, the evils of software patents...
    Paul B.

    1. Re:Google patents? by JoeBuck · · Score: 3, Interesting

      Google hasn't exactly patented the algorithm for all uses, and no court has determined that the code infringes the patent, and software patents aren't valid in most countries, so it's not clear whether or not there is any compatibility.

      It would seem that anyone who uses the code to build a search engine would be infringing, but even that is something that lawyers can argue about.

  14. Doesn't actually calculate PageRank? by Vultan · · Score: 5, Informative

    As best as I can tell from the website, the API is only for storing and interacting with a large graph. Nothing there is actually involved with PageRank. You could use this API presumably to write your own PageRank code, but to say "everybody can grok PageRank now!" is misleading at best.

    Moreover, IANAL, but isn't the PageRank algorithm patented by Google? Wouldn't this prevent anyone from releasing GPL code that computes PageRank?

  15. Re:why is rank/rating necessary? by TopShelf · · Score: 4, Funny

    You get sort of a self reinforcing cycle of wankage...

    For a second there I thought you were just talking like Elmer Fudd! "wating and wanking incwease the welevance of pagewanking..."

    --
    Stop by my site where I write about ERP systems & more
  16. Re:Isn't that illegal? by Anonymous Coward · · Score: 2, Informative

    Yes, and it's trademarked, too. Here's a bunch more info on PageRank.

  17. has to be said by madHomer · · Score: 4, Funny

    It's just not the same without the pigeons...

  18. By the way... by Sanity · · Score: 2, Informative

    ...it isn't on a fat pipe, so please understand if its slow.

  19. Proof of concept only by Saganaga · · Score: 5, Informative

    I think this project is really just a proof of concept. As another post pointed out, to make this really useful you'd need to regularly update your local data set, which isn't very practical for most people.

    Also, if the downloadable dataset only covers a small portion of the web, how can this system's utility really compare to Google's?

    That said, I think computer science proof-of-concept type project are very useful and serve a valuable purpose in getting the ideas out there for others to improve upon.

  20. Re:why is rank/rating necessary? by Pionar · · Score: 2, Insightful

    It could have receded back into the depths and maintained quality but it put page-ranking first, attempting to attract and contain a particular audience.

    I disagree. In case you haven't noticed, the title of the /. front page is "News for Nerds, Stuff that Matters." So, of course /. is attracting a particular audience. That's a Good Thing.

    Target audience is one of the most important decisions when designing a web site. "Good info" is a subjective concept. What's good to you is not necessarily good to me. But, chances are if I search for something that I'm looking for, PageRank can provide a sense of the more authoratative pages for that subject.

    Also, putting stuff up for popularity's sake is a great reason to put something up. If I didn't want my employer's site to be seen, I wouldn't have put it up there. Attracting eyeballs is the only way to get good info. The more eyeballs, the better the accuracy of information. Why do you think peer review is such a big deal in scientific arenas (and it is, as I know from working for a big-name medical school)? If I was a scientist reviewing another scientist's work, then I would look at the writing aspects of the work. A little bit of style often makes information more credible to others. Don't ask me why, just know that it's human nature.

  21. Explains it all... by Spokehedz · · Score: 2, Informative

    It uses Slashdot as a root, of course. ;)

    Seriously, I don't know. Here's a page on how Google works though.

    http://www.google.com/technology/index.html

  22. What a mess by Ignorant+Aardvark · · Score: 2, Funny

    Sure, now everybody can grok PageRank, but I, for the life of me, cannot grok grok.

    1. Re:What a mess by dpbsmith · · Score: 4, Informative

      Just in case this wasn't an implied rhetorical question... the term, as far as I know, was invented by Robert Heinlein in his novel _Stranger in a Strange Land,_ where it is an expression used by Martians. It literally means "to drink," but the Martians use it to mean an understanding that is both very deep and very complete.

    2. Re:What a mess by mbourgon · · Score: 2, Informative

      Yes. Basically, "to share water with", which on Mars meant you were more than brothers. Considering how little water was/is on Mars, it was a great honor.

      --
      "Sometimes a woman is a kind of religion, she can save your soul & set you free from all your sins" - Bad Examples
  23. Google's algorithms have changed quite a bit by HiKarma · · Score: 3, Insightful

    Since their original papers, according to all posted reports. So I don't think you're really going to get the exact google number from a basic algorithm and this data set.

    They also use terms that appear in links as a major key in ranking searches.

    (Among other things.)

    Not that it is not interesting to see these rankings, and note the most widely linked to sites on the net.

    Which, by the way, after the obvious winners like Yahoo, include Adobe and Real networks, which have gotten immense numbers of sites to link to them with "Get acrobat reader" style links.

    I've often wondered if the makeashorterlink and tinyurl folks are doing it just for the googlejuice.

    In reverse, many sites now use javascript links in order to preserve their googlejuice.

    Very much a heisenberg phenomenon here.

  24. I wonder... by crashnbur · · Score: 4, Interesting

    ...how this can be used to discover the percentage of broken links on the web at any given moment in time.

  25. Besides - not all browsers show page rank by kiddailey · · Score: 2, Interesting

    And let's not forget... not all of us even get exposed to page rank regularly.

    On my Mac for example, I can't see it at all. On my Wintel I can, thanks to the Google toolbar.

  26. Ask and ye shall receive... by Theaetetus · · Score: 4, Informative
    and I say "Dammit, where are all the pretty pictures."

    Here (for free)

    Here too (for free)

    This one too (for free)

    This one also (free)

    And don't forget this classic ($30 poster)

    -T

  27. Could I someday use it for my PC - Re:This soun by leoaugust · · Score: 2, Interesting

    I wonder if I can use pagerank algorithm for the smaller universe of my harddrive itself?

    I have over 6,000 files on my PC many of which link to each other, and I am adding more links between them as time goes by. The collection is now so big that I can't even revist my own files and reason out the implications of the links between pages, beacuse of the huge time it would take to even spend a minute on each saved file.

    I wonder if something like Pagerank will let the important files that are linked by many others on my PC to rise "up" like the cream to say, and I can avoid having to use keywords and categories to wade through all the clutter on my harddrive ...

    Any other ideas of how to study the relationship between my 6,000+ files?

    I also have quite a few articles, e.g. news items saved from the web itself. I wonder if the pagerank of google for those saved articles could also help me flush out the important "external" articles on my harddrive itself.

    --
    To see a world in a grain of sand, and then to step back and see the beach where the sand lies ...
  28. Re:can anyone explain what a web graph is? by lordbrain · · Score: 5, Informative

    In a graph is made up of two things, edges and vertices.

    In a web graph, vertices are webpages and edges are hyperlinks.

    PageRank determines how many incoming edges a vertex has. Given the nature of the web, this is a nontrivial problem because a vertex only knows its outgoing edges.

    The assumption for PageRank is that the more incoming edges a vertex has, the more popular it is. So you would use this to figure out how popular a particular vertex is.

    Given this you could do like Google and combine it with a search engine to prioritize the results.

    --

    Thank you. Thank you. Please no applause; just throw money
  29. Re:does this mean... by JamesOfTheDesert · · Score: 4, Funny
    ... pear search

    ... to find the fruits of your labor?

    What a grape idea! Orange you glad you thought of it?

    .

    .

    .

    Ok. Groan fest is over.

    --

    Java is the blue pill
    Choose the red pill
  30. Googling your harddisk by |>>? · · Score: 2, Interesting
    While calculating PageRank seems like a nice idea, I'm much more interested in having a google search available over my harddisk. I recall that AltaVista in the mid-90's had a programme that created an index over your whole disk - it dealt with many filetypes including .doc, .pdf, .mbox and basically gave you an AltaVista search over all your harddisk content.

    Anyone know of anything like that?

    --
    |>>? ..EBCDIC for Onno..
  31. Re:why is rank/rating necessary? by baka_boy · · Score: 4, Interesting

    I really shouldn't rise to this bait, but I can't resist: yes, given the choice between those networks, I would choose PBS. Just as I would take a non-profit-driven Internet, public radio over Clear Channel and its ilk, and community mesh wireless networks over 3G mobile phone service.

    Google has been, so far at least, a rare exception in the world of privatized communications utilities, by consistently showing a amazing lack of intention to lock people into their service, using either exclusivity agreements of some sort or the simple expedient of proprietary technology (i.e., "increase your PageRank by 10% if you support new encrypted GoogleML tags on your site!"). Nothing is permanent, though, and as we all know, single points of failure are a no-no.

    So, to bring all this back somewhere in the general neighborhood of the main story: further distributing the capability to build "mini-Googles", or specialized, community-maintained (but still fairly large-scale in terms of number of pages and links indexed) search tools is very interesting, and a useful body of technology to perpetuate.

    Or, even more generally, the technology needed to do large-scale storage, analysis, and manipulation of directed graph structures is a very useful tool. Software analysis often relies heavily on large graphs showing dependencies, caller-callee relationships, variable accesses, etc., as do any number of AI subdomains like knowledge representation and planning systems.