Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!uwvax!oddjob!mimsy!timos
From: timos@mimsy.UUCP
Newsgroups: comp.databases
Subject: Re: wanted: line segment storage / retrieval algorithm
Message-ID: <7248@mimsy.UUCP>
Date: Mon, 29-Jun-87 05:35:04 EDT
Article-I.D.: mimsy.7248
Posted: Mon Jun 29 05:35:04 1987
Date-Received: Tue, 30-Jun-87 03:08:36 EDT
References: <117@blic.BLI.COM>
Reply-To: timos@mimsy.UUCP (Timos Sellis)
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 27
Keywords: database to screen, fast

In article <117@blic.BLI.COM> dba@blic.BLI.COM (DB Administrator) writes:
>I am looking for some advise. I have a database which has 100,000
>line segments in it. A line segment includes a textual attribute and
>two xy coordinate pairs. The xy coords range from (0,0) to (50000,50000).
>If I define my current coordinate system to be from (200,200) to (300,300)
>how can the line segments that plot on this coordinate system be identified
>quickly? Sorting by xy only gets those segments that have at least one
>end point inside the current coordinate system.
>
>Thanks,
>---greg



I believe the most successfull methods are the Grid file [TODS 84] and
Guttman's R-trees [Sigmod 84]. They both can be used as indexing methods
for line segments.
-- 
Timos Sellis
CS Dept, University of Maryland, College Park, MD 20742
ARPA:timos@mimsy.umd.edu  UUCP:{decvax,allegra,...}!mimsy!timos


-- 
Timos Sellis
CS Dept, University of Maryland, College Park, MD 20742
ARPA:timos@mimsy.umd.edu  UUCP:{decvax,allegra,...}!mimsy!timos