FIFO in Oracle

From: Mr Michael Wai Kee Yung <myung_at_news.hk.super.net>
Date: 1998/02/09
Message-ID: <6blrh2$8m6$1@tst.hk.super.net>#1/1

Dear all,

Our company is going to develop an Oracle application that requires to store requests in a database table (let's name in DB Queue) and later on another server program will pick up the requests and process in a FIFO fashion.

The question is how can I do it in Oracle efficiently. It seems to me the server need to read all the requests and sort by time stamp when every time the server program is free to do something.

Of course a sort for each fetch is costly. We could create a share memory table and store, say 100 requests to the memory and the server process from there. Still, you know, it require a sort for every 100 requests.

Any idea how our company can improve this mechanism ?

Many thanks in advance.

Cheers,
Michael \\8-)

--
+----------------------------------------------------+
| Born To Be Wired : http://www.hk.super.net/~myung/ |
+----------------------------------------------------+
Received on Mon Feb 09 1998 - 00:00:00 CST