I read the paper attached, but I am not really sure I understood what makes the Bigtables score over other methods of data storage & access.
How exactly are they better than other data structures? On Oct 2, 9:19 pm, Prabhu Hari Dhanapal <[email protected]> wrote: > @ eKay , great question dude! > > It seems that they use a data structure called BIGTABLE , I guess u > understand that it just not maps but there are other applications like > earth , finance etc., which require the same amount of complexity in > storing as that of maps. > > It seems that , " BIG table " is being tweaked for each of these > applications .. however the basic concept remains the same, > > I have attached a paper published by google on big table - u might find > that interesting !! :) > > If u liked bigtable, u might as well read abt hadoop > > Cheers! > > > > On Fri, Oct 2, 2009 at 7:43 AM, eSKay <[email protected]> wrote: > > > for example Google Maps, the amount of data is HUGE, and then you need > > to be able to plot the path from one place to other, search > > efficiently in the nearby area, zoom in, zoom out, show hundreds of > > views etc. > > > I don't think the data structure used would be anything simple like - > > nodes are cities and paths are edges? > > > What would be more efficient? Does anybody have any idea as to what > > datastructure(s) is actually used for these purposes? > > -- > Hari > > bigtable-osdi06.pdf > 291KViewDownload --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
