Email address obfuscation in effect -- please
click here to turn it off.
[
Date Prev][
Date Next][
Thread Prev][
Thread Next][
Date Index][
Thread Index]
- To: "MLUG Members" <EMAIL:PROTECTED>
- Subject: RE: [MLUG] MySQL permission/advice
- From: "Ross, Matthew" <EMAIL:PROTECTED>
- Date: Fri, 3 Oct 2003 11:10:05 -0500
- Reply-to: MLUG Members <EMAIL:PROTECTED>
- Sender: EMAIL:PROTECTED
- Thread-index: AcOJhXEtbJ7gcRUMRji26W6hdVLeKgAQc32A
- Thread-topic: [MLUG] MySQL permission/advice
> Aha, so we don't list forward references in a comment, but
> rather each comment has a backward reference to its parent.
As was mentioned, this is just like C, except that its the exact opposite. A database has a fixed structure and is designed to gather data. C has no fixed structure and is designed for processing information. Rather than write a complex object for each data element, it lets you write one command that gathers the information you want in a standardized format.
> So, to build a webpage from this, we'd display the new
> comment (newest entry with a refers_to of 0), then search for
> all entries that refers_to that one, then recursively do the
> same for each of those?
>
> Doesn't sound particularly efficient, but it makes sense.
Yes. The difference between this and your C programs is that you call for the child records by the name of the parent rather than asking the parent for the names of the children then calling for them by name.
Its efficient for data storage and management. In low level programming you can allocate your own memory to whatever size you want. With a database you are dealing with structured data and have to work within your set structure. It makes data retrieval more efficient, logical, and effective. Consider if you had to guess how someone structured their C objects.
_______________________________________________
members mailing list
EMAIL:PROTECTED
http://mlug.missouri.edu/mailman/listinfo/members