Re: Big Databases

This WebDNA talk-list message is from

1997


It keeps the original formatting.
numero = 11527
interpreted = N
texte = >Can I get some guidance on the practical limits for WebCat handling large >databases? I have a client who wants to do a CustomerID lookup from about a >100,000 record Customer database and if a match is found to return the >customer info (name address etc) to the order entry form.Depending on how you tune the search, this can be very fast. On a slow machine, a [lookup] in a 10,000 record database takes about 1/100 second. That is probably the fastest-case search. More complex searches (case-insensitive, multi-word, etc) take longer. I'm guessing your CustomerID is exact, so you can probably take advantage of the faster lookup function.We have customers with 189,000 and 250,000 record databases. I believe they have reported 3-second search times for full-text case-insensitive multi-word (in other words, worst case) scenarios. [lookup] would be much faster.If your client can pay for some customization, we can provide much faster speeds by tuning WebCatalog for his particular case.Grant Hulbert, V.P. Engineering | ===== Tools for WebWarriors ===== Pacific Coast Software | WebCatalog Pro, WebCommerce Solution 11770 Bernardo Plaza Court | SiteEdit Pro, SiteCheck, PhotoMaster San Diego, CA 92128 | SiteGuard 619/675-1106 Fax: 619/675-0372 | http://www.smithmicro.com Associated Messages, from the most recent to the oldest:

    
  1. Re: Big Databases (Marty Schmid 1997)
  2. Re: Big Databases (Grant Hulbert 1997)
  3. Re: Big Databases (Kenneth Grome 1997)
  4. Big Databases (Marty Schmid 1997)
>Can I get some guidance on the practical limits for WebCat handling large >databases? I have a client who wants to do a CustomerID lookup from about a >100,000 record Customer database and if a match is found to return the >customer info (name address etc) to the order entry form.Depending on how you tune the search, this can be very fast. On a slow machine, a [lookup] in a 10,000 record database takes about 1/100 second. That is probably the fastest-case search. More complex searches (case-insensitive, multi-word, etc) take longer. I'm guessing your CustomerID is exact, so you can probably take advantage of the faster lookup function.We have customers with 189,000 and 250,000 record databases. I believe they have reported 3-second search times for full-text case-insensitive multi-word (in other words, worst case) scenarios. [lookup] would be much faster.If your client can pay for some customization, we can provide much faster speeds by tuning WebCatalog for his particular case.Grant Hulbert, V.P. Engineering | ===== Tools for WebWarriors ===== Pacific Coast Software | WebCatalog Pro, WebCommerce Solution 11770 Bernardo Plaza Court | SiteEdit Pro, SiteCheck, PhotoMaster San Diego, CA 92128 | SiteGuard 619/675-1106 Fax: 619/675-0372 | http://www.smithmicro.com Grant Hulbert

DOWNLOAD WEBDNA NOW!

Top Articles:

Talk List

The WebDNA community talk-list is the best place to get some help: several hundred extremely proficient programmers with an excellent knowledge of WebDNA and an excellent spirit will deliver all the tips and tricks you can imagine...

Related Readings:

OS X problem: when using [ShowCart] or [orderfile]... (2000) Mult-File Upload w/ Web Star (2000) Ok here is a question? (1997) dates and hex formatting (1997) Loosing Quantity (2000) [WebDNA] Exclude found items in a 2nd search (2016) Leap Day Triggers? (2000) Non-Cart Files in Shopping Cart Folder (1997) f2 download problems (1997) How Many SKU's is enough? (1997) Getting total number of items ordered (1997) Changing SubTotal (2003) Testing ... (2004) Sorting by date (1997) [WebDNA] Ubuntu 16.04.4 LTS (2018) Discounts (2002) Max Record length restated as maybe bug (1997) WebCat2b12 - nesting [tags] (1997) Cookies? (1997) Re:2nd WebCatalog2 Feature Request (1996)