Re: speed question

From: Hermit Dave (hermitd.REMOVE_at_CAPS.AND.DOTS.hotmail.com)
Date: 10/10/04 

Date: Sun, 10 Oct 2004 18:10:26 +0100

i think if you search individual columns you should normally get similar
results unless ofcourse the criteria is such that you have the last two
chars of column A and first 2 of column B.

unfortunately i dont use iTunes and so i dont know what you mean.

but considering a string column if you use

column1 like '%filtercondition%' then it will return all rows with the
filter condition.
As Ryan rightly mentioned the indexs would not come in to picture right now
as it is a string contatenation. But if you seperated the columns the
corresponding indexes if any would be used and that would help speed up the
process. 

-- 
Regards,
Hermit Dave
(http://hdave.blogspot.com)
"dzemo" <dzemo@wizard.ba> wrote in message
news:OgJA1DsrEHA.2764@TK2MSFTNGP11.phx.gbl...
> ok here is the deal. I have 200000 records about patient in one hospital
and
> I want to have smart search like iTunes or something like that. So I have
to
> merge all columns and then search that string with '%xxx%' (merge columns
> should have "xxx" string inside somewhere)  xxx-any string with min length
> with 3 chars. And that work but is slow (very slow). Would help to change
> data type of columns from text to char or someone have better idea haw to
> perform smart search.
>
> -- 
> --------------------------------------------------------------------------
---------------------------------------------
> Dzemal Tipura (Dzemo) - MCP
> "dzemo" <dzemo@wizard.ba> wrote in message
> news:eebMWNkrEHA.3416@TK2MSFTNGP15.phx.gbl...
> >I have table with 5 columns. ID (int) and "Name, LastName, FatherName,
> >Phone" as text field. In that table I have 200000 records. Also I have
view
> >with statement
> >
> > Select (Name + LastName + FatherName + Phone) as Search
> > From Users
> > Where Search like '%xxx%'
> >
> > And it is very slow. When I replace xxx with anything (no matter of how
> > much results are) it is very slow (about 20-30 seconds) to display
> > results.
> > I use VB.NET 2003 and SQL 2000. Should I use Data type "char" instead
> > "text", or index columns?
> > any ideas?
> > thx
> >
> >
> > -- 
>
> --------------------------------------------------------------------------
---------------------------------------------
> > Dzemal Tipura (Dzemo) - MCP
> >
> > -- 
>
> --------------------------------------------------------------------------
---------------------------------------------
> > Dzemal Tipura (Dzemo) - MCP
> >
>
>

Relevant Pages

  • Re: [Emacs] Kommentieren
    ... ;; completely up to the user to decide, what the string ... "Chars preserved of STRING. ... `CHARS-PRESERVE' must be a parentized expression, ...
    (de.comp.editoren)
  • Re: speed question
    ... Dzemal Tipura (Dzemo) - MCP ... "Hermit Dave" wrote in message ... > as it is a string contatenation. ... >> Dzemal Tipura - MCP ...
    (microsoft.public.dotnet.framework.adonet)
  • Re:(9corr) string
    ... and I want to remove the month in the timestamp for each of the string ... Then advance 4 chars, and copy from +2 to the current pointer until you ... pointer past the year part to reach the month part. ... this guarantee is 'memmove'. ...
    (comp.lang.c)
  • Re: FASTEST way to try all strings (a until ZZZZZZZZZZZZZZZZZZZZZZZZ)
    ... > It will be a very huge table so I in my opinion. ... > When it would be used, than it should be converted to a string, however ... >> How would an array of Byte be any faster then an array of Char? ... >> array of Byte is needed, however the OP suggested Chars (A to Z, a to z ...
    (microsoft.public.dotnet.languages.vb)
  • Re: FASTEST way to try all strings (a until ZZZZZZZZZZZZZZZZZZZZZZZZ)
    ... > It will be a very huge table so I in my opinion. ... > When it would be used, than it should be converted to a string, however ... >> How would an array of Byte be any faster then an array of Char? ... >> array of Byte is needed, however the OP suggested Chars (A to Z, a to z ...
    (microsoft.public.dotnet.general)