Date: Sat, 3 May 2008 15:13:08 -0700 (PDT) From: KAYVEN RIESE <kayve@sfsu.edu> To: "Jason C. Wells" <jcw@highperformance.net> Cc: fbsd_chat <freebsd-chat@freebsd.org> Subject: Re: Tired of Hierarchies Message-ID: <Pine.SOC.4.64.0805031510350.10157@libra.sfsu.edu> In-Reply-To: <481CE0E7.7070900@highperformance.net> References: <481CE0E7.7070900@highperformance.net>
next in thread | previous in thread | raw e-mail | index | archive | help
On Sat, 3 May 2008, Jason C. Wells wrote: > > I would like all of the data that I use everywhere to be one click away at > all times. But placing all of that data in one central place is also > unmanageable. Thus we employ search and filtering. To do that we employ > proper metadata, tagging, or brute force searching. dood. binary search trees define hierarchical data and allow the optimized O(NlogN) sort and O(logN) search. > I keep an image in my mind of where to find data that I use during the course > of my employment or hobbies. My employer has incredibly good information > systems. I would say that I can access many millions of documents somewhat > readily. Unmanaged files in hierarchies quickly become irretrievable. because of O(logN) search, one million items can be searched in log(base breadth)(1 million) time instead of just 1 million time. seriously. > > Regards, > Jason C. Wells > _______________________________________________ > freebsd-chat@freebsd.org mailing list > http://lists.freebsd.org/mailman/listinfo/freebsd-chat > To unsubscribe, send any mail to "freebsd-chat-unsubscribe@freebsd.org" > *----------------------------------------------------------* Kayven Riese, BSCS, MS (Physiology and Biophysics) (415) 902 5513 cellular http://kayve.net Webmaster http://ChessYoga.org *----------------------------------------------------------*
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.SOC.4.64.0805031510350.10157>