Retro computing and gaming, sci-fi books, tv and movies and other geeky stuff.

Home » Archive » net.micro.cpm » dBase II query...
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Switch to threaded view of this topic Create a new topic Submit Reply
dBase II query... [message #80524] Mon, 03 June 2013 23:51 Go to next message
LIN is currently offline  LIN
Messages: 31
Registered: May 2013
Karma: 0
Message-ID: <12282@sri-arpa.UUCP>
Date: Sat, 22-Sep-84 18:34:00 EDT
Article-I.D.: sri-arpa.12282
Posted: Sat Sep 22 18:34:00 1984
Date-Received: Wed, 26-Sep-84 06:18:47 EDT
Lines: 15

From:  Herb Lin 

I am trying to write a dBase program that will allow rapid indexed
searches of a database by keyword.  In other words, I want to have a
database consisting of records each including a field that can include
up to (say) 100 characters of keywords, and then I want to be able to
display all records that include a particular keyword of interest
WITHOUT going through a record by record search.  All the ways I can
think of to do this are very clumsy.  Anyone with good ideas out

Many bibliography management programs do this, but without knowing
about their quality, I'm hesitant to go that way.

thanks in advance.  I will post replies to anyone who want them.
Re: dBase II query... [message #80538 is a reply to message #80524] Mon, 03 June 2013 23:51 Go to previous messageGo to next message
rbloom is currently offline  rbloom
Messages: 24
Registered: May 2013
Karma: 0
Junior Member
Message-ID: <12326@sri-arpa.UUCP>
Date: Mon, 24-Sep-84 11:07:00 EDT
Article-I.D.: sri-arpa.12326
Posted: Mon Sep 24 11:07:00 1984
Date-Received: Wed, 26-Sep-84 19:43:49 EDT
Lines: 14

From:  Robert Bloom DRSTE-TOI 3775 

 I aggree - KWOC (keyword out of context) searches in dbase II are
very clumsy.  What I've done is to separate the keywords into
a separate field per keyword and cycle through the indexes for 
a search.

 Updateing (or adding records) becomes slow and involves re-indexing
if one has more than seven indexes with standard dBase II.4 - I
believe III has more capibility for simulataneous indexes.

 If you find a more elegant method - please tell!

-bob bloom
Re: dBase II query... [message #80565 is a reply to message #80524] Mon, 03 June 2013 23:51 Go to previous message
lowans.henr is currently offline  lowans.henr
Messages: 7
Registered: June 2013
Karma: 0
Junior Member
Message-ID: <12424@sri-arpa.UUCP>
Date: Thu, 27-Sep-84 08:18:00 EDT
Article-I.D.: sri-arpa.12424
Posted: Thu Sep 27 08:18:00 1984
Date-Received: Sun, 30-Sep-84 04:35:14 EDT
Lines: 11

Look in your dBASE manual for information on the "$ substring logical
operator", I think this will help you. A search through the entire
database is nessessary because this is the way a dabase management
system works, it searches through the entire database record by record
till the information is found. If it finds it in record #1, it doesn't
know if record #50 also containes the correct information. If you can,
input the data ranking it in ASCII collating sequence within each
record. INDEXing the database will then put records with the same
keywords together.

  Switch to threaded view of this topic Create a new topic Submit Reply
Next Topic: Copying files containing 'holes'
Goto Forum:

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Sat Oct 01 23:53:45 EDT 2022

Total time taken to generate the page: 0.00961 seconds