Article View: bit.listserv.asm370
Article #1599VM/CMS Release 5 Assembler Program To Read Huge Files
From: RON
Date: Sat, 18 Jan 1992 00:00
Date: Sat, 18 Jan 1992 00:00
45 lines
3179 bytes
3179 bytes
Hi, I have to get back into writing a couple of assembler programs. I used to write these a few years ago, but all I have now is some manuals, but no source samples. Could someone send me a/some sample assembler program(s) that: 1) Reads specific records from 1,000,000 record file(s). I would pass the line record number(s) that I wanted read as parameters to the program. It then puts these records into the console stack. (I know that this is basically an easy program to write, but I am busy with writing a larger application that needs two specific assembler files, and I would really like a 'gift' from the network instead of having to write my own from scratch.) 2) Write a three byte binary value to a file. It increments this value by one and then writes it to the file (along with some other data). The record layout looks like "AAABBBBBBBB", where "AAA" is the binary field, and "BBBBBBB" is the other field. "AAA" starts at '1' and is incremented up to about 1,000,000. I am writing a local application for SQL. I need to minimize the size of the "AAA" field since there are over 200 seperate files involved, each with identical "AAA" fields. By using a binary field I can reduce the overall DASD requirements (3 bytes instead of 6) since some of the "BBBBBBB" fields are quite small. If some of you are SQL programmers AND Assembler programmers are confused by the above, some of the data will exist inside SQL, and some of it in 'flat' CMS files. I am trying to reduce the length of the SQL search time by creating some high CLUSTERRATIO 'target' tables (book titles, and other information about the books). The above two assembler programs will enable me to do this. A bunch of six character "AAAaaa" fields mixed with a lot of "A", "OF", "THE", etc. would end up wasting a lot of DASD. Doing an SQL search on "%DOCTORS%" on 1,000,000 record SQL tables made up on a dozen or so words in each title results in EXTREMELY slow search times (think of doing an XEDIT search on "/DOCTORS" in a 1,000,000 record 200 byte CMS file versus the same search on a 15 byte file (for all of you non-SQLers out there)). Ron,,, (To the paranoid, I had to "RESPOND" to another article in order to SUBMIT this one - in case I did not delete *all* of the references to the original article. Some people really detest it when people do such things! :-))
Technical Details
Message-ID:
<92017.190042RON@RyeVm.Ryerson.Ca>Path:
arc1-ca.pugleaf.net!sparky!uunet!europa.asd.contel.com!paladin.american.edu!auvm!ryerson!ronShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: fcdcb,580c0c1581978f7c,start X-Google-Attributes: gidfcdcb,public X-Google-ArrivalTime: 1992-01-17 17:14:37 PST Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU Newsgroups: bit.listserv.asm370 Path: arc1-ca.pugleaf.net!sparky!uunet!europa.asd.contel.com!paladin.american.edu!auvm!ryerson!ron Organization: Ryerson Polytechnical Institute Message-ID: <92017.190042RON@RyeVm.Ryerson.Ca> Date: Fri, 17 Jan 1992 19:00:42 EST Sender: IBM 370 Assembly Programming Discussion List <ASM370@UGA.BITNET> Comments: Warning -- original Sender: tag was NETNEWS@RYEVM.RYERSON.CA From: RON@RYEVM.RYERSON.CA Subject: VM/CMS Release 5 Assembler Program To Read Huge Files