I am running this query:
SELECT group_post_mod_option.option_id,
group_post_mod_option.option_name,
COUNT(group_post_moderation.group_post_moderation_option) AS count
FROM group_post_mod_option
LEFT OUTER JOIN group_post_moderation ON
(group_post_mod_option.option_id =
Hi,
I'm trying to execute this query:
SELECT group_post.group_thread_id,
FROM group_post
LEFT OUTER JOIN group_post_moderation ON (group_post.group_post_id =
group_post_moderation.group_post_id)
LEFT OUTER JOIN group_post_mod_option ON
(group_post_moderati
Why are you saving it as a LONGBLOB and not as TEXT data type?
[EMAIL PROTECTED] wrote:
> Hi,
>
> I am using tinymce to save news articles with very basic html styling in a
> database. This works well upto a point but when I get over a certain number
> of characters and then the 'you have an er
y to scale out very quickly. Digg didn't
> get any significant funding until just recently. And yet they
> epitomize the web 2.0 companies. They did it by both keeping their
> cost down and having the ability to grow quickly. Couldn't have done
> it with Oracle or MS.
> J
> You youngsters may not realize that there were billing applications
> serving millions of customers long, long before there were any kind of
> database management systems. They employed concepts called "flat
> files" and "batch processing". And they ran on machines far weaker
> than anything a
ty hardware.
>
> Once again, we're talking *really* big websites using MySQL (not
> Oracle or SQL Server or whatever) here. Most websites won't ever need
> to partition their production databases, and different RDMS might have
> different approaches for scalabilit
ve performance,
> because the gains would be minimal, and for big websites, scalability
> is a much bigger issue that performance (although sometimes one
> depends on the other), and data partitioning is the way to go to solve
> the scalability problem.
>
>
> On 5/24/07, Naz Gas
gt;The definitive answer to anything that
> >requires trees in SQL is nested sets.
>
> They are not definitive when the tree is large and must be updated
> frequently.
>
> PB
>
> -
>
> Naz Gassiep wrote:
>> The definitive answer to anything that requires t
The definitive answer to anything that requires trees in SQL is nested
sets. I have written a tutorial on the subject, as this is about the
most asked question in DB relational data modeling.
http://www.mrnaz.com/static/articles/trees_in_sql_tutorial/
Enjoy :)
- Naz.
Peter Brawley wrote:
> tbt
I'm working in a project at the moment that is using MySQL, and people keep
making assertions like this one:
"*Really* big sites don't ever have referential integrity. Or if the few spots
they do (like with financial transactions) it's implemented on the application
level (via, say, optimistic
10 matches
Mail list logo
