Re: We all are looped on Internet: request + transport = invariant - Mailing list pgsql-sql

From Bart Degryse
Subject Re: We all are looped on Internet: request + transport = invariant
Date
Msg-id 4628BCC8.A3DD.0030.0@indicator.be
Whole thread Raw
In response to Re: We all are looped on Internet: request + transport = invariant  (Dmitry Turin <sql4-en@narod.ru>)
List pgsql-sql
Trees like you seem to suggest are called hierarchies. If you prefer hierarchies over relationnality you could use a
hierarchicaldatabase instead of a relational database. When you search the internet you can find plenty of information
oneg Adabas, GT.M., IMS, DMSII, Focus, Metakit and many others.<br /><br />>>> Dmitry Turin
<sql4-en@narod.ru>2007-04-20 11:08 >>><br />>you are proposing is to ... break the relational model
ofSQL<br /><br />No. I'm proposing to add new thinking about relational model<br />(primary i want to write "to add new
view",but i remember, that<br />"view" is reserved word in SQL :) ).<br />?onvince yourself, please:<br /><br />create
tablea (<br />  id   num      primary key;<br />  data float;<br />);<br />create table b (<br />  id   num     
primarykey;<br />  ref  num      references a(id);<br />  data float;<br />);<br />create table c (<br />  id  
num     primary key;<br />  link num      references b(id);<br />  data float;<br />);<br />insert into a values
(1,    12.3);<br />insert into b values (10, 1, 23.4);<br />insert into b values (20, 1, 34.5);<br />insert into b
values(30, 1, 45.6);<br />insert into c values (100,10,56.7);<br />insert into c values (101,10,67.8);<br />insert into
cvalues (200,20,78.9);<br />insert into c values (201,20,89.1);<br />insert into c values (300,30,91.2);<br /><br />My
suggestis "a.b.c"-request. Output is<br /><br /><a     id=1   data=12.3><br />  <b   id=10  data=23.4><br
/>   <c id=100 data=56.7/><br />    <c id=101 data=67.8/><br />  </b><br />  <b   id=20 
data=34.5><br/>    <c id=200 data=78.9/><br />    <c id=201 data=89.1/><br />  </b><br />  <b  
id=30 data=45.6><br />    <c id=200 data=91.2/><br />  </b><br /></a><br /><br />I wrote about
thatin<br /><a
href="http://sql4.by.ru/site/sql40/en/author/introduction_eng.htm">http://sql4.by.ru/site/sql40/en/author/introduction_eng.htm</a><br
/><a
href="http://sql4.by.ru/site/sql40/en/author/determination_eng.htm">http://sql4.by.ru/site/sql40/en/author/determination_eng.htm</a><br
/><br/>>to make it look more like XML<br /><br />Understand: XML is not model of data (in my suggest), XML is format
ofoutput.<br />Can you offer better format for output of tree?<br />If you can, write please, i listen.<br /><br
/>>becauseof some special purpose application<br /><br />Reception of tree from database is really often case.<br
/><br/>For example, open several schemes of database (in Erwin, in<br />RationalRose, in other modeller) - scheme is
net(count).<br /><br />After that, look at source of server programs, servicing this databases.<br />These programs get
partof net (not part of one table!, not part of<br />joined tables! not part of one view!) and put it into
program-visualizer.<br/><br />In back direction, server program get tree (records for several tables, not for one
table!)<br/>and put it into database.<br /><br />>SQL ... It's ... language, unconcerned with transport<br /><br />I
agree.Now it's so.<br /><br />>change the syntax of SQL<br /><br />SQL remains inviolate.<br />I offer addition to
it- i offer Tree Manipulation Language.<br />Look once more:<br /><br />create table a (<br />  id   num      primary
key;<br/>  data float;<br />);<br />create table b (<br />  id   num      primary key;<br />  ref1 num      references
a(id);<br/>  ref2 num      references a(id);<br />  data float;<br />);<br />create table c (<br />  id   num     
primarykey;<br />  lnk1 num      references b(id);<br />  lnk2 num      references b(id);<br />  data float;<br />);<br
/>insertinto a values (1,        12.3);<br />insert into a values (2,        23.4);<br />insert into b values (10, 1,
2,34.5);<br />insert into b values (20, 1, 2, 45.6);<br />insert into b values (30, 1, 2, 56.7);<br />insert into b
values(40, 1, 2, 67.8);<br />insert into c values (100,10,20,78.9);<br />insert into c values (101,10,20,89.1);<br
/>insertinto c values (200,30,40,91.2);<br />insert into c values (201,30,40,88.8)<br /><br />But TML is:<br /><br
/>a.b/ref1.c/lnk1<br/><br />---<br /><br />P.S.<br />I'm very glad to get acquainted with you, and i'm much interesting
totalk with you.<br />Let's to write maximum simply, let's to use maximum simple expressions<br />to understand each
otherbetter.<br /><br /><br />Dmitry Turin<br /><a href="http://html60.chat.ru/">http://html60.chat.ru</a><br /><a
href="http://sql40.chat.ru/">http://sql40.chat.ru</a><br/><br /><br />---------------------------(end of
broadcast)---------------------------<br/>TIP 3: Have you checked our extensive FAQ?<br /><br />               <a
href="http://www.postgresql.org/docs/faq">http://www.postgresql.org/docs/faq</a><br/> 

pgsql-sql by date:

Previous
From: Richard Huxton
Date:
Subject: Re: We all are looped on Internet: request + transport = invariant
Next
From: "A. Kretschmer"
Date:
Subject: Re: many 'OR' in WHERE-condition