Received: from k3.aeccom.com (IDENT:root@gate1.aeccom.com [193.158.11.51]) by hub.org (8.9.3/8.9.3) with ESMTP id EAA23176 for ; Fri, 14 Jan 2000 04:30:47 -0500 (EST) (envelope-from lutzeb@aeccom.com) Received: from ampato.aeccom.com (IDENT:root@ampato.aeccom.com [192.168.0.11]) by k3.aeccom.com (8.9.3/8.9.3) with ESMTP id KAA07296; Fri, 14 Jan 2000 10:31:40 +0100 Received: (from lutzeb@localhost) by ampato.aeccom.com (8.9.3/8.9.3) id KAA03108; Fri, 14 Jan 2000 10:31:40 +0100 From: Dirk Lutzebaeck MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14462.60668.225811.469623@ampato.aeccom.com> Date: Fri, 14 Jan 2000 10:31:40 +0100 (CET) To: pgsql-sql@postgreSQL.org Subject: Re: [SQL] Optimizing ORDER BY with indexes? In-Reply-To: <14462.57679.783969.863812@ampato.aeccom.com> References: <14462.57679.783969.863812@ampato.aeccom.com> X-Mailer: VM 6.71 under 21.1 (patch 4) "Arches" XEmacs Lucid Dirk Lutzebaeck writes: > > I'm forced to used ORDER BY on large tables which then takes quite > long. Is there a chance to create/optimize an index for ORDER BY? > Or could I write an index method on my own? How would it look like? > > Are there any other possiblities to speed up ORDER BY? Reading about indexes in the Bowman SQL book I think a _clustered index_ is needed for the problem above. Does Postgresql support these? Dirk