Re: Long-running queries

In article <3uk28e$ccg@lennon.cc.gatech.edu>, gukal@cc.gatech.edu (Sreenivas Gukal) writes: |> Hi Folks |> Part of my Ph.D. thesis deals with efficiently supporting long-running |> queries (maybe Decision Support System queries) without affecting |> concurrent transactions in an OLTP environment. I dont know how important |> and/or frequent a problem this is in real applications. Most sites have lots of users who would love to run extensive queries against the database if they were allowed to. As earlier replies to your posting have pointed out (at comp.databases.theory, which is where I found it), it's generally not considered a good idea to mix OLTP and DSS, and one is therefore forced to use some less than optimal solution, e.g. multiple databases. The underlying problem, in my opinion, is the unability of the classical transaction model to cope with DSS and OLTP coexistence. My own research is focused on what I refer to as Application-Oriented Transaction Management (AOTM). A paper of mine proposing transaction management mechanisms that would enable DSS and OLTP coexistence will appear in the proceedings of the 2nd Internation Conference on Concurrent Engineering: Research and Applications (to be held in McLean, Virginia, August 23-25, 1995). The paper is entitled "Dynamic cooperation between database transactions by means of generalized isolation levels". A pointer to the web-server of the CE95-conference can be found at my WWW home page (see below). By following the "Research material" pointer of my home page, you can also find two technical reports upon which my CE95 paper is built, and more. Best regards -------------------------------------------------------- Ole J. Anfindsen Telenor R&D Postboks 83, Instituttveien 23, 2007 Kjeller, Norway Fax: (+47) 6381 0076 or 5190 Internet: ole.anfindsen@fou.telenor.no WWW: http://www.nta.no/brukere/olea X400: G=ole;S=anfindsen;O=fou;P=telenor;A=telemax;C=no;