Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: (domain support) Re: theory and practice: ying and yang

Re: (domain support) Re: theory and practice: ying and yang

From: DM Unseen <dm_unseen_at_hotmail.com>
Date: 2 Jun 2005 01:33:30 -0700
Message-ID: <1117701209.886236.231220@o13g2000cwo.googlegroups.com>


OK,

So the coclusion is that in SQL the difference between (multi)sets and arrays is in the order by clause, not what I would call pretty. I checked this and indeed this is blocked. the only thing that went OK in SQLServer2K is

select * from (select TOP 100 PERCENT [case id] from TABLE_CASES order by [case id]) as Test

The TOP clause is of course a typical MS hack, but normally an important one for queries requiring the Nth highest items as input. I suspect you could write a query that would not rely on TOP n to get the N highest/lowest items, but would that be efficient?

By dynamic constraints I mean that they are defined by endusers as data in the model, and then interpreted and used to validate the end user input. Received on Thu Jun 02 2005 - 03:33:30 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US