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

2007-05-02 Thread Richard Huxton
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

2007-04-27 Thread Dmitry Turin
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

2007-04-26 Thread Dmitry Turin
Good day, Richard. RH flight_chain ... RHflight_options RH flight... RH flight... These three flights represent options RH flight... RH/flight_options RH /flight_chain Tag flight_options is un-necessary (in point of view of DBMS theory). RH 2. If you nest flights then

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

2007-04-26 Thread Dmitry Turin
Good day, Richard. RH flight_chain ... RHflight_options RH flight... RH flight... These three flights represent options RH flight... RH/flight_options RH /flight_chain Tag flight_options is un-necessary (in point of view of DBMS theory). RH 2. If you nest flights then

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

2007-04-26 Thread Richard Huxton
Dmitry Turin wrote: Good day, Richard. RH flight_chain ... RHflight_options RH flight... RH flight... These three flights represent options RH flight... RH/flight_options RH /flight_chain Tag flight_options is un-necessary (in point of view of DBMS theory). But that's

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

2007-04-26 Thread Dmitry Turin
Good day, Richard. RH flight_chain ... RHflight_options RH flight... RH flight... These three flights represent options RH flight... RH/flight_options RH /flight_chain RH 1. A journey (flight_chain) between city A and city Z consists of one or RH more flights. RH 2.

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

2007-04-26 Thread Andrew Sullivan
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

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

2007-04-26 Thread Richard Huxton
Dmitry Turin wrote: Good day, Richard. RH flight_chain ... RHflight_options RH flight... RH flight... These three flights represent options RH flight... RH/flight_options RH /flight_chain RH 1. A journey (flight_chain) between city A and city Z consists of one or RH

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

2007-04-25 Thread Richard Huxton
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,

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

2007-04-24 Thread Dmitry Turin
---(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

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

2007-04-24 Thread Dmitry Turin
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

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

2007-04-24 Thread Dmitry Turin
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, that you

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

2007-04-24 Thread Richard Huxton
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. I

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

2007-04-23 Thread Bart Degryse
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

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

2007-04-20 Thread Dmitry Turin
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 and