sql,query
Does anyone know how / if it's possible to recover a lost .MYI file if I
still have the .MYD and .frm files? It seems like it should be possible
but I haven't found any documentation on it yet.
Thanks,
- bdf
-
Bray
Brian DeFeyter wrote:
On Thu, 2002-02-07 at 15:40, Tod Harter wrote:
[snip]
Wouldn't be too tough to write a little query routing system if you are using
perl. Use DBD::Proxy on the web server side, and just hack the perl proxy
server so it routes the query
On Wed, 2002-02-13 at 16:39, Mike Wexler wrote:
Brian DeFeyter wrote:
I sorta like that idea. I don't know exactly what you can and can't do
as far as indexing inside of HEAP tables.. but the index size would
likely differ from the written index. Then you can expand the idea and
use
On Friday 08 February 2002 08:56, Vincent Stoessel wrote:
Apples and oranges.
Yeah, I know. But let's see if we can make some distinctions.
If, say, Google, can search 2 trillion web pages, averaging say 70k
bytes each, in 1 second, and Mysql can search 22 million records, with
an
On Thu, 2002-02-07 at 15:40, Tod Harter wrote:
[snip]
Wouldn't be too tough to write a little query routing system if you are using
perl. Use DBD::Proxy on the web server side, and just hack the perl proxy
server so it routes the query to several places and returns a single result
set.
Has anyone made a suggestion or thought about ways to distribute
databases which focus on fulltext indexes?
fulltext indexes do a good job of indexing a moderate amount of data,
but when you get a lot of data to be indexed, the queries slow down
significantly.
I have an example table, with
On Thu, 2002-02-07 at 15:40, Tod Harter wrote:
[snip]
Wouldn't be too tough to write a little query routing system if you are using
perl. Use DBD::Proxy on the web server side, and just hack the perl proxy
server so it routes the query to several places and returns a single result
set.
