hash?

Hi all,
Are there any hash function build in on SQL 2000?
or the SQL 2003?
Thx.
Rena.
Yes, check out CHECKSUM and BINARY_CHECKSUM in BOL.
"Rena" <rena@.mail.hongkong.com> wrote in message
news:Oroy%23C4jEHA.3712@.TK2MSFTNGP15.phx.gbl...
> Hi all,
> Are there any hash function build in on SQL 2000?
> or the SQL 2003?
> Thx.
> Rena.
>

hash?

Hi all,
Are there any hash function build in on SQL 2000?
or the SQL 2003?
Thx.
Rena.Yes, check out CHECKSUM and BINARY_CHECKSUM in BOL.
"Rena" <rena@.mail.hongkong.com> wrote in message
news:Oroy%23C4jEHA.3712@.TK2MSFTNGP15.phx.gbl...
> Hi all,
> Are there any hash function build in on SQL 2000?
> or the SQL 2003?
> Thx.
> Rena.
>

hash?

Hi all,
Are there any hash function build in on SQL 2000?
or the SQL 2003?
Thx.
Rena.Yes, check out CHECKSUM and BINARY_CHECKSUM in BOL.
"Rena" <rena@.mail.hongkong.com> wrote in message
news:Oroy%23C4jEHA.3712@.TK2MSFTNGP15.phx.gbl...
> Hi all,
> Are there any hash function build in on SQL 2000?
> or the SQL 2003?
> Thx.
> Rena.
>

Handle 1:n relations

Hi,

I build a local cube from a relation database. In the database there are 1:n relations.
Is there a way to handle 1:n relations?
For example:
I have a table LOGGEDFLAW and a table LOGGEDREASON with a 1:n relation between them. We create a select statement of these tables and as an result we get duplicate records of LOGGEDFLAW each time more than 1 record of LOGGEDREASON are associated to 1 record of LOGGEDFLAW - this is the standard result I get with an relational JOIN operation. Now I want to count the LOGGEDFLAWs without the duplicates generated by the 1:n relationship.

Best regards,
ThorstenUSE Northwind
GO

CREATE VIEW myView99
AS
SELECT o.OrderId, od.Quantity
FROM Orders o INNER JOIN [Order Details] od
ON o.OrderId = od.OrderId
GO

SELECT COUNT(DISTINCT OrderId), COUNT(*)
FROM myView99
GO

DROP VIEW myView99
GO|||Oh sorry, I create a local cube. I need a way to create distict measures.