Use this SQL with Sybase

[Former Member]

I have a good working sql that works in sql server. The logical computation calculates how many lengths will fit a barrel. Maximum capacity per drum is 14300 meters. My question is how I can get this to work with Sybase.

Declare @tblLength table (num int, qty int, unit varchar(20))

insert @tblLength
values
(2,2500,''),
(1,3800,''),
(1,4200,''),
(1,6500,''),
(1,8300,'')

;with cte as
(
select i=1, qty, unit from @tblLength where num >= 1
union all
select i=i+1, t.qty, t.unit from @tblLength t, cte where t.qty=cte.qty and t.unit = cte.unit and t.num >= i+1
),
cte2 as
(
select *, id=row_number() over (order by qty desc) from cte
),
cte3 as
(
select j=1, qty, unit, id, tot=qty, drum=1 from cte2 where id = 1
union all
select j=j+1, cte2.qty, cte2.unit, cte2.id,
tot=case when cte3.tot+cte2.qty > 14300 then cte2.qty else cte3.tot+cte2.qty end,
drum=case when cte3.tot+cte2.qty > 14300 then cte3.drum + 1 else cte3.drum end
from cte2,cte3 where cte2.id = j+1
)
select drum, qty, unit from cte3

[Breck_Carter]

Please tell us what the third view cte3 is trying to accomplish ( because it's the one that's causing me grief 🙂

...or wait until Ivan Bowman sees this question 🙂

Changing the declare (and adding a semicolon), plus adding the RECURSIVE keyword, makes cte and cte2 work (or at least, they stop throwing error messages)...

Declare LOCAL TEMPORARY TABLE @tblLength (num int, qty int, unit varchar(20));

insert @tblLength
values
(2,2500,''),
(1,3800,''),
(1,4200,''),
(1,6500,''),
(1,8300,'')

;with RECURSIVE cte ( i, qty, unit ) as
(
select i=1, qty, unit from @tblLength where num >= 1
union all
select i=i+1, t.qty, t.unit from @tblLength t, cte where t.qty=cte.qty and t.unit = cte.unit and t.num >= i+1
),
cte2 as
(
select *, id=row_number() over (order by qty desc) from cte
)
select * from cte2;

i,qty,unit,id
1,8300,'',1
1,6500,'',2
1,4200,'',3
1,3800,'',4
1,2500,'',5

However, the full query fails with the hopelessly vague "Invalid recursive query" error...

Declare LOCAL TEMPORARY TABLE @tblLength (num int, qty int, unit varchar(20));

insert @tblLength
values
(2,2500,''),
(1,3800,''),
(1,4200,''),
(1,6500,''),
(1,8300,'')

;with RECURSIVE cte ( i, qty, unit ) as
(
select i=1, qty, unit from @tblLength where num >= 1
union all
select i=i+1, t.qty, t.unit from @tblLength t, cte where t.qty=cte.qty and t.unit = cte.unit and t.num >= i+1
),
cte2 as
(
select *, id=row_number() over (order by qty desc) from cte
),
cte3 ( j, qty, unit, id, tot, drum ) as
(
select j=1, qty, unit, id, tot=qty, drum=1 from cte2 where id = 1
union all
select j=j+1, cte2.qty, cte2.unit, cte2.id,
tot=case when cte3.tot+cte2.qty > 14300 then cte2.qty else cte3.tot+cte2.qty end,
drum=case when cte3.tot+cte2.qty > 14300 then cte3.drum + 1 else cte3.drum end
from cte2,cte3 where cte2.id = j+1
)
select drum, qty, unit from cte3;

Could not execute statement.
Invalid recursive query
SQLCODE=-921, ODBC 3 State="42000"

[Former Member]

The SQL should do this. Maybe there is another (smarter) way to do this in sybase?

I have several lengths to be wound on drums (lengths may vary)

Ex: Table tblLength

Count----qty----Unit
---------------------
2--------2500---meter
1--------3800---meter
1--------4200---meter
1--------6500---meter
1--------8300---meter


On every drum I only have a max capacity for 14,300 meters.
How can I use a smart SQL to calculate it like this:
To wrap on every drum:
1 x 13000 (2x2500 + 1x3800 + 1x4200)
1 x 6500 (1x6500)
1 x 8300 (1x8300)

[Former Member]

Cte3 takes the first row and allocates it to drum 1. It then goes through the following rows allocating to the same drum until it's full then starts on the next. Keeps going until it runs out of lengths.

[regdomaratzki]

Can we assume when you say "how I can get this to work with Sybase" that you mean SQL Anywhere and not Adaptive Server Enterprise or another Sybase RDBMS? If it is SQL Anywhere, can you tell us what version of the product you are using?

[Former Member]

Yes, I mean SQL Anywhere and we're talking about version 12...

[VolkerBarth]

Is there any kind of optimization included, i.e. do you try to use as less drums as possible? (I won't try to find this out by studying your CTEs...)

From your sample, I would conclude it's much simpler and you simply add the rows in sequential order, until one drum is full. BTW: Is there an imposed order like a primary key?

If so, a different approach might be to use a WINDOW function to build adjacent sums and group them to fit within the according limit. (I don't have an actual sample - it's just a guess that this could work...)

---

FWIW, here's a link to the SQL Anywhere SCN community with a blog article on WINDOW functions and an according whitepaper - AFAIK the WINDOW clause in SQL Anywhere is much more powerful/feature-rich than with current MS SQL versions...:

From the Archives: The Window Operator and Window Aggregate Functions

[Former Member]

For those who are algorithmically inclined ... This appears to me as being the SQL approximation of the one-dimensional "First Fit" heuristic algorithm. {a heuristic for a family of N-P complete problems related to the "Bin Packing problem"} As such, without some sort or recursion or look ahead ... it may take some time to find a simplified algorithm to make this happen.

The original solution is a creative utilization of SQL Server features. A similarly crafty SQL Anywhere solution may take a bit of effort.

[Former Member]

I would be extremely grateful if someone could help me with this then I stalled. Needed SP so it's ok too.

[Former Member]

Someone...?

[VolkerBarth]

Please answer my yesterday's comment on the question...:)

[Former Member]

I can not see your comment somewhere? Where can I see it?

[VolkerBarth]

Below the question, there are currently 6 nested comments. Click on "Show all" if not all are displayed...

[Former Member]

I'd say this isn't a case for pure declarative SQL. Even if it is possible to implement it using recursive statements nobody will understand what's going on there. Use a procedure or implement it in the host language.

[Breck_Carter]

> nobody will understand what's going on there

Always a danger... whenever I code recursive unions the "nobody will understand" includes ME, five minutes later 🙂

[Former Member]

Thanks for all the replies. I have quite stuck and can not solve this yourself.

If we make this solution based on the features that sybase provides and with a stored procedure, can anyone help me with that?