From owner-freebsd-chat@FreeBSD.ORG Sat May 3 22:42:54 2008 Return-Path: Delivered-To: freebsd-chat@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34]) by hub.freebsd.org (Postfix) with ESMTP id 645951065684 for ; Sat, 3 May 2008 22:42:54 +0000 (UTC) (envelope-from kayve@sfsu.edu) Received: from iron3.sfsu.edu (iron3.sfsu.edu [130.212.10.128]) by mx1.freebsd.org (Postfix) with ESMTP id 357138FC0C for ; Sat, 3 May 2008 22:42:54 +0000 (UTC) (envelope-from kayve@sfsu.edu) X-onepass: IPPSC X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: ApoEAIeAHEiC1Apk/2dsb2JhbACqdg Received: from smtp01.sfsu.edu ([130.212.10.100]) by iron3.sfsu.edu with ESMTP; 03 May 2008 15:13:09 -0700 Received: from libra.sfsu.edu ([130.212.10.238]) by mail05a.sfsu.edu (Lotus Domino Release 7.0.3HF378) with ESMTP id 2008050315130846-63 ; Sat, 3 May 2008 15:13:08 -0700 Date: Sat, 3 May 2008 15:13:08 -0700 (PDT) From: KAYVEN RIESE To: "Jason C. Wells" In-Reply-To: <481CE0E7.7070900@highperformance.net> Message-ID: References: <481CE0E7.7070900@highperformance.net> MIME-Version: 1.0 X-MIMETrack: Itemize by SMTP Server on MAIL05a/SERVERS/SFSU(Release 7.0.3HF378 | February 28, 2008) at 05/03/2008 15:13:08, Serialize by Router on SMTP01/SERVERS/SFSU(Release 7.0.3HF378 | February 28, 2008) at 05/03/2008 15:13:09, Serialize complete at 05/03/2008 15:13:09 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed Cc: fbsd_chat Subject: Re: Tired of Hierarchies X-BeenThere: freebsd-chat@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: Non technical items related to the community List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 03 May 2008 22:42:54 -0000 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 *----------------------------------------------------------*