Here is a challenge for all (which has me stumped!)
I have two databases, each containg aprroximately 100,000 records, each accessible through ODBC (I have a DSN on server). Searching through all of the records in these databases is critical. However, many of the fields I want to search on are memo fields. My initial solution for a workaround was to make an MS access file, which generated a query that had scaled down versions of the field for searching purposes (I searched the hacked off fields, displayed the full ones). However, this means that the Access database gets all the records from the databases each time it is run.
Even limiting my Access query to get 5000 records, performance time is unacceptable. Is there any way I can work my field sizes down to a searchable size while maintaing performance and selecting only the needed records at the database server level?
I have two databases, each containg aprroximately 100,000 records, each accessible through ODBC (I have a DSN on server). Searching through all of the records in these databases is critical. However, many of the fields I want to search on are memo fields. My initial solution for a workaround was to make an MS access file, which generated a query that had scaled down versions of the field for searching purposes (I searched the hacked off fields, displayed the full ones). However, this means that the Access database gets all the records from the databases each time it is run.
Even limiting my Access query to get 5000 records, performance time is unacceptable. Is there any way I can work my field sizes down to a searchable size while maintaing performance and selecting only the needed records at the database server level?