dbTalk Databases Forums  

Limits

comp.databases.theory comp.databases.theory


Discuss Limits in the comp.databases.theory forum.



Reply
 
Thread Tools Display Modes
  #51  
Old   
JOG
 
Posts: n/a

Default Re: Limits - 07-25-2008 , 07:58 PM






On Jul 26, 1:17 am, Tegiri Nenashi <TegiriNena... (AT) gmail (DOT) com> wrote:
Quote:
On Jul 25, 2:58 pm, JOG <j... (AT) cs (DOT) nott.ac.uk> wrote:

For instance if we have relation:
R := {w, x, y}

where the tuples are:
w := (a:1, b:1)
x := (a:2, b:2)
y := (a:3, b:2)

then "ordering by a" yields a total ordering over R:
{(w, x), (w,y), (x,y)}

but "ordering by b" gives the partial ordering:
{(w, x), (w,y)}

OK. But who the recepient of the ORDER BY output? I assume it is some
sort of SQL client. Can it understand partial order?
No, of course not, because clients tend to allocate tuples into an an
array, and certainly don't store them as a set even logically.
However, this is somewhat of a digression, because I was concerned
with the theory - whether such concepts can be integrated into RA, and
if doing so offers any utility. Ordering seems important.


Reply With Quote
  #52  
Old   
JOG
 
Posts: n/a

Default Re: Limits - 07-25-2008 , 07:58 PM






On Jul 26, 1:17 am, Tegiri Nenashi <TegiriNena... (AT) gmail (DOT) com> wrote:
Quote:
On Jul 25, 2:58 pm, JOG <j... (AT) cs (DOT) nott.ac.uk> wrote:

For instance if we have relation:
R := {w, x, y}

where the tuples are:
w := (a:1, b:1)
x := (a:2, b:2)
y := (a:3, b:2)

then "ordering by a" yields a total ordering over R:
{(w, x), (w,y), (x,y)}

but "ordering by b" gives the partial ordering:
{(w, x), (w,y)}

OK. But who the recepient of the ORDER BY output? I assume it is some
sort of SQL client. Can it understand partial order?
No, of course not, because clients tend to allocate tuples into an an
array, and certainly don't store them as a set even logically.
However, this is somewhat of a digression, because I was concerned
with the theory - whether such concepts can be integrated into RA, and
if doing so offers any utility. Ordering seems important.


Reply With Quote
  #53  
Old   
JOG
 
Posts: n/a

Default Re: Limits - 07-25-2008 , 07:58 PM



On Jul 26, 1:17 am, Tegiri Nenashi <TegiriNena... (AT) gmail (DOT) com> wrote:
Quote:
On Jul 25, 2:58 pm, JOG <j... (AT) cs (DOT) nott.ac.uk> wrote:

For instance if we have relation:
R := {w, x, y}

where the tuples are:
w := (a:1, b:1)
x := (a:2, b:2)
y := (a:3, b:2)

then "ordering by a" yields a total ordering over R:
{(w, x), (w,y), (x,y)}

but "ordering by b" gives the partial ordering:
{(w, x), (w,y)}

OK. But who the recepient of the ORDER BY output? I assume it is some
sort of SQL client. Can it understand partial order?
No, of course not, because clients tend to allocate tuples into an an
array, and certainly don't store them as a set even logically.
However, this is somewhat of a digression, because I was concerned
with the theory - whether such concepts can be integrated into RA, and
if doing so offers any utility. Ordering seems important.


Reply With Quote
  #54  
Old   
JOG
 
Posts: n/a

Default Re: Limits - 07-25-2008 , 07:58 PM



On Jul 26, 1:17 am, Tegiri Nenashi <TegiriNena... (AT) gmail (DOT) com> wrote:
Quote:
On Jul 25, 2:58 pm, JOG <j... (AT) cs (DOT) nott.ac.uk> wrote:

For instance if we have relation:
R := {w, x, y}

where the tuples are:
w := (a:1, b:1)
x := (a:2, b:2)
y := (a:3, b:2)

then "ordering by a" yields a total ordering over R:
{(w, x), (w,y), (x,y)}

but "ordering by b" gives the partial ordering:
{(w, x), (w,y)}

OK. But who the recepient of the ORDER BY output? I assume it is some
sort of SQL client. Can it understand partial order?
No, of course not, because clients tend to allocate tuples into an an
array, and certainly don't store them as a set even logically.
However, this is somewhat of a digression, because I was concerned
with the theory - whether such concepts can be integrated into RA, and
if doing so offers any utility. Ordering seems important.


Reply With Quote
  #55  
Old   
JOG
 
Posts: n/a

Default Re: Limits - 07-25-2008 , 07:58 PM



On Jul 26, 1:17 am, Tegiri Nenashi <TegiriNena... (AT) gmail (DOT) com> wrote:
Quote:
On Jul 25, 2:58 pm, JOG <j... (AT) cs (DOT) nott.ac.uk> wrote:

For instance if we have relation:
R := {w, x, y}

where the tuples are:
w := (a:1, b:1)
x := (a:2, b:2)
y := (a:3, b:2)

then "ordering by a" yields a total ordering over R:
{(w, x), (w,y), (x,y)}

but "ordering by b" gives the partial ordering:
{(w, x), (w,y)}

OK. But who the recepient of the ORDER BY output? I assume it is some
sort of SQL client. Can it understand partial order?
No, of course not, because clients tend to allocate tuples into an an
array, and certainly don't store them as a set even logically.
However, this is somewhat of a digression, because I was concerned
with the theory - whether such concepts can be integrated into RA, and
if doing so offers any utility. Ordering seems important.


Reply With Quote
Reply




Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

vB code is On
Smilies are On
[IMG] code is On
HTML code is Off



Powered by vBulletin Version 3.5.3
Copyright ©2000 - 2012, Jelsoft Enterprises Ltd.