Re: Tired of Hierarchies

看板FB_chat作者時間18年前 (2008/05/04 06:43), 編輯推噓0(000)
留言0則, 0人參與, 最新討論串2/10 (看更多)
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 *----------------------------------------------------------* _______________________________________________ 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"
文章代碼(AID): #187Egf00 (FB_chat)
討論串 (同標題文章)
文章代碼(AID): #187Egf00 (FB_chat)