X-Original-To: pgsql-advocacy-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [200.46.204.144]) by svr1.postgresql.org (Postfix) with ESMTP id BE0645331D for ; Sun, 3 Apr 2005 12:58:12 +0100 (BST) Received: from svr1.postgresql.org ([200.46.204.71]) by localhost (av.hub.org [200.46.204.144]) (amavisd-new, port 10024) with ESMTP id 35699-10 for ; Sun, 3 Apr 2005 11:58:03 +0000 (GMT) Received: from wolff.to (wolff.to [66.93.249.74]) by svr1.postgresql.org (Postfix) with SMTP id 6E12553247 for ; Sun, 3 Apr 2005 12:58:01 +0100 (BST) Received: (qmail 28024 invoked by uid 500); 3 Apr 2005 12:14:52 -0000 Date: Sun, 3 Apr 2005 07:14:52 -0500 From: Bruno Wolff III To: Virgile Beddok Cc: Tom Lane , Christopher Kings-Lynne , pgsql-novice@postgresql.org, pgsql-advocacy@postgresql.org Subject: Re: [NOVICE] Function which gives back the Message-ID: <20050403121452.GA27923@wolff.to> Mail-Followup-To: Bruno Wolff III , Virgile Beddok , Tom Lane , Christopher Kings-Lynne , pgsql-novice@postgresql.org, pgsql-advocacy@postgresql.org References: <2657.146.140.8.144.1111775776.squirrel@webmail.igd.fraunhofer.de> <42464392.9040903@familyhealth.com.au> <20050327163653.GH9280@wolff.to> <5796.1111941132@sss.pgh.pa.us> <1218.146.140.8.94.1112025141.squirrel@webmail.igd.fraunhofer.de> <20050328161240.GD7217@wolff.to> <1343.146.140.8.94.1112027529.squirrel@webmail.igd.fraunhofer.de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <1343.146.140.8.94.1112027529.squirrel@webmail.igd.fraunhofer.de> User-Agent: Mutt/1.5.6i X-Virus-Scanned: by amavisd-new at hub.org X-Spam-Status: No, hits=0.011 tagged_above=0 required=5 tests=AWL X-Spam-Level: X-Archive-Number: 200504/18 X-Sequence-Number: 6583 On Mon, Mar 28, 2005 at 18:32:09 +0200, Virgile Beddok wrote: > > I just want to know if there is an existing and implemented function, or > tree, in Postgres which allows me to directly perform a "nearest neighbour > search" on multidimensional vectors. What precisely do you mean by "nearest"? To answer that question you need a metric function. A common metric function is euclidean distance. Another common one is distance along the geodesic connecting two points on the surface of the sphere. The cube contrib package has indexing that might be useful for doing lossy matches if you have some upperbound on how far a part a nearest neighbor can be in your problem. It even will handle multiple dimensions. (You haven't even bothered to tell us how many dimensions your points have.) The earthdistance contrib package has a function for calculating distance on the surface of sphere and uses the cube package to provide a lossy way of doing indexed searches. If you want specific anwsers it would help if you would provide us with more details about the problem you are trying to solve.