RE: Logical file access paths

I'm curious about the specific implementation, but I assume an access path
is a tree structure designed for easy insertion and deletion of nodes.
Changing the access path by one record shouldn't take too long for the same
reason that one lookup doesn't take very long.

> -----Original Message-----
> From: Colin Thorpe [mailto:Colin@IBS-PUBLIC-SERVICES.CO.UK]
> Sent: Wednesday, April 12, 2000 7:33 AM
> To: 'RPG400-L@midrange.com'
> Subject: Logical file access paths
> 
> 
> 
> Good morning/afternoon,
> 
> I have a question regarding access paths.
> 
> When I create a logical file over a physical file containing 
> 10,000,000
> records, it takes quite some time.
> 
> This is presumably building some kind of Matrix/lookup table?
> 
> This I can understand.
> 
> So then,
> Why, when I update the key to this logical in a Do loop (so 
> attempting to
> re-read the file) , does it not have to update the matrix/lookup table
> (before the re-read) and therefore take a long time to complete.
> 
> ie.
> KEY   SETLL           FILE1
>       DOW             *IN31=*OFF
> KEY   READE   FILE1
>       (CHANGE KEY)
>       UPDATE  FILE1   (move this records position within the logical
> order)
>       ENDDO
> 
> 
> 
> Thanks in advance  
> 
> 
> Colin 
> 
+---
| This is the RPG/400 Mailing List!
| To submit a new message, send your mail to RPG400-L@midrange.com.
| To subscribe to this list send email to RPG400-L-SUB@midrange.com.
| To unsubscribe from this list send email to RPG400-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---