FiveTech Software tech support forums

... checking during our development. This table is derived from customer.dbf by copying 2000 times. We prepared this test program to compare the speeds of reading 1,000,000 rows from this table by ODBC (using TOdbc and TOdbcDirect classes of FWH), ADO (superior than ODBC) and FWHMYSQL. #include ...

... the Database. On quite the contrary a properly layed out tree, well designed hashtables and saving them as an object to a file will yield the same speeds as a database and from my tests. A properly designed hashtable and directory tree will win everytime. Way less overhead. Recently I have been ...

... up and restoring one record per one sql statement. While writing the code, we just wanted to play safe on memory issues. We may increase the speeds later but initially we thought safety comes first. But even in these cases we won't be disappointed. Let me think how to make a test using the ...

Backup and Restore speeds: We made a test to benchmark speeds for a million record table on localhost. The test program is listed below. We are familiar with customer.dbf in fwh\samples folder. First the data of the dbf is inserted ...

... table names instead of resulting in run-time error. We'll send you revised libs for testing. We shall be glad to have feedback on comparison of speeds with other tools using identical tables/database. Feedback we got so far is encouraging. Speeds for tables containing blobs and large memos can ...

... a new blank row should be automatically created at the end of the browse. Providing buttons and dialogs for editing/adding rows retards data entry speeds and reduces productivity of the end user. Many programmers know how to auto append blank rows using oBrw:bPastEof. Care should also be taken ...

... So scrolling is fast. XBrowse handles all kinds of data and mostly disk based data like DBF. Continuous scrolling is not fast due to data access speeds. So simultaneous scrolling is not feasible. After we move the thumbtrack up and down and leave it, then the xbrowse is refreshed. This is the ...

... to the data and create several indexes in order to use Xbrowse vieuws. Will I create the cdx files on the lady PC or Nas, or localy on my system ? Speeds issues and waiting time to create indexes. I'v even seen that cdx can be made in memory ? Will we ran out of memory or will it swapp to disk ...

... to be handling WAN with the latest techonlogies available today. First time I implemented our systems on WAN was about 18 years back. The WAN speeds were only 64 KBPS. Started with Clipper and ADS 5.1 and then moved to 32-bit xharbour. The system included XBrowse of a DBF table with 450,000 ...

Nobody has compared their speeds yet, as far as I know.

If you already have your app coded with SQLRDD then there is no sense in using ADORDD.

Yesterday I tested samples\webexp.prg (ActiveX) with xHarbour and FWH 16.03 and worked fine

... the fact that is a safe and good programming practice, it also has the merit of having smaller indexes. Smaller indexes is a key to get get good speeds.

... options (1) switching indexes and (2) setting filter. We can also compare the response times. Note: TDatabase in buffered mode slows down browsing speeds consderably. It is better to use non-buffered mode and the best option is to browse DBF directly. #include "fivewin.ch"REQUEST DBFCDXstatic ...

Present day's communication speeds are far better than they used be a decade back. More than a decade back I was using xbrowse on WAN with very low speeds of 64 kbps without any problem, But we do need to take care of fine tuning the dbf ...

... SET FILTER TO <condition> .AND. !DELETED() We may create conditional indexes on a temporary basis at runtime only to improve navigation speeds for browses.

Enrico, I will admit I do not test for elapsed time. That is way too theoretical for me. I look at "real world" speeds and that is judged by my clients evaluation of performance. So, for printing a memo text: FOR lx := 1 TO MLCount( oTrec:rectxt, 60,, .t. ) PAGEHEAD( oPrn, ...