Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Dmitry Turin wrote: Good day, Richard. RH> With 7 flights it is easy to see if #2 matches #4. With 700 it is not so RH> easy to see #2 matches #504. With a tree-structure it is impossible to RH> sort leaf nodes without restructuring the tree. What is "#2 matches #4" ? Individual flights might

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Good day, Andrew. AS> translates it into proper SQL? How are you going to send and get XML-data by SQL ? Dmitry Turin http://html6.by.ru http://sql4.by.ru http://computer2.by.ru ---(end of broadcast)--- TIP 2: Don't 'kill -9' the postmaster

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Dmitry Turin wrote: Good day, Richard. RH> RH> RH> RH>These three flights represent options RH> RH> RH> RH> 1. A journey (flight_chain) between city A and city Z consists of one or RH> more flights. RH> 2. The next flight has to start at the current city, but ther

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

On Thu, Apr 26, 2007 at 11:28:30AM +0300, Dmitry Turin wrote: > > Yes. > Remember, this is not manner of storing data in DBMS. > This is manner to visualize for man. So all of this sound and fury is not, as we have been understanding it, over some fundamental change to the way Pg works, but is in

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Good day, Richard. >> RH> >> RH> >> RH> >> RH>These three flights represent options >> RH> >> RH> >> RH> RH> 1. A journey (flight_chain) between city A and city Z consists of one or RH> more flights. RH> 2. The next flight has to start at the current city, but there m

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Dmitry Turin wrote: Good day, Richard. RH> RH> RH> RH>These three flights represent options RH> RH> RH> Tag is un-necessary (in point of view of DBMS theory). But that's what you're describing isn't it? 1. A journey (flight_chain) between city A and city Z consi

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Good day, Richard. RH> RH> RH> RH>These three flights represent options RH> RH> RH> Tag is un-necessary (in point of view of DBMS theory). RH> 2. If you nest flights then you'll be forced to repeat data, surely? RH> Multiple routes could end up mentioning flight id

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Good day, Richard. RH> RH> RH> RH>These three flights represent options RH> RH> RH> Tag is un-necessary (in point of view of DBMS theory). RH> 2. If you nest flights then you'll be forced to repeat data, surely? RH> Multiple routes could end up mentioning flight id

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Don't forget to cc: the list. Dmitry Turin wrote: Good day, Richard. http://sql4.by.ru/site/sql40/en/author/wave_eng.htm RH> example 2 RH> 1. I can see how one flight might follow another, but not contained. Do you RH> not need some new object "flight_chain" or similar? No ! Fork is possible

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Dmitry Turin wrote: Good day, Joe. I would change your examples to use less abstract data, like department/employee, customer/product/order/order_line J> I contend that then you'd find more people J> receptive to your ideas or at least able to criticize them from more J> concrete viewpoints.

Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

Good day, Joe. >> >I would change your examples to use less abstract >> > data, like department/employee, customer/product/order/order_line J> I contend that then you'd find more people J> receptive to your ideas or at least able to criticize them from more J> concrete viewpoints. I expected, th

Fwd: Re[2]: [SQL] We all are looped on Internet: request+transport = invariant

Good day, Bart. > I'll continue with the analogy Let's suppose, that you want to compare rational and hierarchical DBMS instead of discussion about removing gaskets (by the way, hierarchical DBMS also need gasket between itself and external world). Because TML should integrated inside rational DB

Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

---(end of broadcast)--- TIP 1: if posting/reading through Usenet, please send an appropriate subscribe-nomail command to [EMAIL PROTECTED] so that your message can get through to the mailing list cleanly

Re: Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

If these people really work with hierarchically structured data, let them try a hierarchical database (even though PostgreSQL is your favourite database). They will profit 100fold from the advantages such a database has for such data. I now several biologists specialized in taxonomy (which is by na

Fwd: Re[2]: [SQL] We all are looped on Internet: request + transport = invariant

>have you written a TML parser No. I want, that you and other people help me in that. >do you have feedback from actual average users, >that TML is indeed easier to use than SQL? Yes. TML was born in discuss with these users (mainly nucleus physicists, optics , molecular biologists, zoologist an