M.M. Astrahan et al. System R: Relational Approach to Database Management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... used in database systems to synchronize access to shared data in order to avoid the problems of lost updates , dirty reads , and un repeatable reads [8] While most transaction sys tems use a locking policy that prevents lost updates, not all systems implement or enforce full serializability [1, . In a general purpose system synchronization re quirements vary greatly among applications. Therefore, QuickSilver allows each server to implement its own concurrency control policy. This is actually more frequent than one might think. If a header file contains an error, all modules that ....

M. M Astrahan, M. W. Blasgen, D. D. Chamber- lin, K. P. Eswaran, J. N. Gray, P. P. Griffiths, W. F. King, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, and V. Watson. System R: Relational approach to database management. A CM Transactions on Database Systems, 1(2):97-137, June 1976.

....which of the four plans should be used to evaluate the given query. In this section we present the framework of a query optimizer that is used to make this decision. As in the classic System R paper, our query optimizer utilizes cost functions that model the CPU and I O resources of each plan [5, 25]. These cost functions take as input the estimations of the selectivity of each of the query predicates and the selectivity of the result. Traditional database management systems utilize histograms to provide such estimations [14, 15, 17, 20, 25] The unique, restricted nature of the segment query ....

M. M. Astrahan, et al. System R: A Relational Approach to Database Management. In ACM Transactions on Database Systems, 1(3): 97-137, 1976.

....be combined with P2P transactional mechanisms, e.g. as suggested in [10] However, we do not wed ourselves to the success (both technical and propagandistic) of such e#orts. It is worth noting that despite current commercial packaging, relational database research from the early prototypes onward [1, 15] has separated the storage layer from the query processing layer. We are simply following in those footsteps in a new storage regime. 3 P2P Query Processing Our design is constrained by the following goals: Broad Applicability: A main goal for our work is that it be broadly and practically ....

Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J., Griffiths, P. P., III, W. F. K., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Wade, B. W., and Watson, V. System r: Relational approach to database management. ACM Transactions on Database Systems (TODS) 1, 2 (1976), 97--137.

....Processing For our purposes, it is sufficient to refer to an abstract view of database processing in an analogous way to [10] Most set oriented database systems can be described by two major components: the logical database processor and the physical database processor. For example, in System R [2] the logical database processor is called the Relational Data System and the physical database processor the Relational Storage System . The logical database processor translates the user queries into an internal representation called query evaluation plan (QEP) which is further optimized to ....

M.M. Astrahan et al., SYSTEM R: A Relational Approach to Database Management, ACM TODS 1 (1976) 97-137.

....the subtransactions serve as control structures in the various layers. To gain a higher degree of concurrency and more flexible control of lock granules, a so called multi level concurrency control was introduced. Furthermore, isolated rollback of subtransactions can be guaranteed. In System R [Astrahan76] this concept is used for two layers: locking is applied twice, on tuples until EOT (long tuple locks) and on pages for the duration of each tuple operation (short page locks for actions) Since tuple operations can be regarded as subtransactions and page locks are released before EOT of the ....

....These arguments should convince every DBMS designer that an object hierarchy for locking purposes has to be provided. In fact, every practical DBMS supports such a hierarchy of typically 2, 3, or 4 levels; e.g. System R has a generic 4 level hierarchy: database segment relation tuple [Astrahan76]. An appropriate hierarchical locking scheme was proposed for flat transactions in [Gray76] Two key ideas allowed for the design of a scheme that could be adapted to a transaction s needs for either locking a few items using a fine lockable unit or locking larger sets of items with larger lock ....

[Article contains additional citation context not shown here]

Astrahan, M.M., Blasgen, M.W., Chamberlin, D.D, Eswaran, K.P., Gray, J.N., Griffith, P.P., King, W.F., Lorie, R.A., McJones, P.R., Mehl, J.W., Putzolu, G.R., Traiger, I.L., Wade, B., Watson, V.: System R: Relational Approach to Database Management. ACM TODS 1, 2, 1976, 97-137.

....execute portions of a relational access plan on clients. 2.1 Centralized Systems In the mid 1970 s, several research and commercial prototypes of RDBMSs were created and evaluated; these prototypes were implemented with both the RDBMS and client application running on a single computer. System R [3] was developed by a group of about 15 researchers at IBM to run on IBM mainframes running the VM 370 operating system. INGRES was developed concurrently at the University of Berkeley [38] to run on PDP 11 computers running Unix. These systems were implemented with both the RDBMS and client ....

M. M. Astrahan, M. W. Blasgen, D. D. Chamberlin, K.P.Esqaran, J.N. Gray, P. P. Gri#ths, W. F. King, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, and V. Watson. System R: Relational approach to database management. ACM Transactions on Database Systems, 2(1):97--137, 1976.

....the disk would incur seeks when reading a block, reducing disk bandwidth. Moreover, it might result in hiccups because the retrieval time of a block might become unpredictable. To ensure a contiguous layout of a block, we considered four alternative approaches: disk partitioning, extent based [ABCea76, CDKK85, GR93b] multiple block sizes, and an approximate contiguous layout of a file. We chose the final approach, resulting in the design and implementation of the EVEREST file system. Below, we describe each of the other three approaches and our reasons for abandoning them. With disk ....

M. M. Astrahan, M. W. Blasgen, D. D. Chamberlin, and et. al. System R: Relational Approach to 26 Database Management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.

....if all versions can be read but only the most recent can be updated to create a new version. Temporal data structures (without branching) are partially persistent. The idea of overlapping trees is an old one. Overlapping trees of disk pages were used for shadow page recovery in System R [AO76] They were used to construct a temporal structure from B trees in ( CDRS86, MK90] However they have never before been used to build a fully persistent access structure from partially persisitent access structures. In the BT Forest, the basic building blocks are already temporal structures ....

M. Astrahan and Others. System R: Relational approach to database management. ACM Transactions on Database Systems, 1(2):97--137, 1976.

....6 we present analytical models for an IPU TODB and an LO TODB. In Section 7 we compare the performance of IPU TODB and LO TODB. Finally, in Section 8, we conclude the paper. 2 Related Work No overwrite strategies have been used in shadow paging recovery strategies earlier, e.g. in System R [1, 3], but with the limited bu er size at that time, the performance was not satisfactory. POSTGRES [13] also employed a no overwrite strategy, but had also its performance problems, for several reasons, the most important being the bu er force strategy used. Vagabond is based on the same philosophy ....

M. M. Astrahan et al. System R: Relational approach to database management. ACM Transactions on Database Systems, 1(2), 1976.

....the same for many seconds until WAFL writes a new consistency point, at which time the on disk image advances atomically to a new state that reflects the changes made by the new requests. Although this technique is unusual for a UNIX file system, it is well known for databases. See, for instance, [Astrahan76] which describes the shadow paging technique used in System R. Even in databases it is unusual to write as many operations at one time as WAFL does in its consistency points. WAFL uses non volatile RAM (NVRAM) to keep a log of NFS requests it has processed since the last consistency point. NVRAM ....

M. Astrahan, M. Blasgen, K. Chamberlain, K. Eswaran, J. Gravy, P. Griffiths, W. King, I. Traiger, B. Wade and V. Watson. System R: Relational Approach to Database Management. ACM Transactions on Database Systems 1, 2 (1976), pp. 97-137.

No context found.

M.M. Astrahan et al. System R: Relational Approach to Database Management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.

No context found.

M.M. Astrahan, M.W. Blasgen, D.D. Chamberlin, K.P. Ewaran, J. Gray, P.P. Griffiths, W.F. King, R.A. Lorie, P.R. McJones, J.W. Mehl, G.R. Putzolu, I.L. Traiger, B.W. Wade, and V. Watson. System R: Relational Approach to Database Management. ACM Trans. on Database Systems, 1(2):97--137, 1976.

No context found.

M.M. Astrahan et al. System R: relational approach to database management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.

No context found.

M.M. Astrahan, M.W. Blasgen, D.D. Chamberlin et al.: System R: Relational Approach to Data Base Management, ACM Transactions on Database Systems 1:2 (1976), 97-137.

No context found.

M. M. Astrahan et al. System R: Relational approach to database management. ACM Transactions on Database Systems, 1#2#:97#137, June 1976.

No context found.

M.M. Astrahan, M.W. Blasgen, D.D. Chamberlin, K.P. Eswaran, J.N. Gray, P.P. Griffiths, W.F. King, R.A. Lorie, P.R. McJones, J.W. Mehl, G.R. Putzolu, I.L. Traiger, B.W. Wade, and V. Watson. System R: A relational approach to database management. ACM Transactions on Database Systems, 1(2):97-- 137, June 1976.

No context found.

M.M. Astrahan, M.W. Blasgen, D.D. Chamberlin et al.: System R: Relational Approach to Data Base Management, ACM Transactions on Database Systems 1:2 (1976), 97-137.

No context found.

M. M. Astrahan et al. System R: Relational approach to database management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.

No context found.

M.Astrahan, et al.: System R: A Relational Approach to Database Management. ACM Transactions on Database Systems, Vol.1, No. 2, June 1976, pp.97-137.

No context found.

AS76 Astrahan, M.M. et al, System R: A Relational Approach to Database Management. ACM TODS, 1,2, (1976), 97-137.

No context found.

M. Astrahan, M. Blasgen, D. Chamberlin, K. Eswaran, J. Gray, P. Griffiths, W. King, R. Lorie, P. McJones, J. Mehl, G. Putzolu, I. Traiger, B. Wade, and V. Watson. System R: A relational approach to data base management. ACM Trans. on Database Systems, 1(2):97-- 137, June 1976.

No context found.

ASTRA76 Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J. N., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Wade, B. W., Watson, V., System R: Relational Approach to Database Management, ACM Transactions on Database Systems, Vol. 1, No. 2, June 1976.

No context found.

ASTRA76 Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J. N., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Wade, B. W., Watson, V., System R: Relational Approach to Database Management, ACM Transactions on Database Systems, Vol. 1, No. 2, June 1976.

No context found.

M. M. Astrahan, M. W. Blasgen, D. D. Chamberlin, K. P. Ewaran, J. Gray, P. P. Griffiths, W. F. King, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, and V. Watson. System R: Relational approach to database management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.

No context found.

M. Astrahan, M. Blasgen, D. Chamberlin, K. Eswaran, J. Gray, P. Griffiths, W. King, R. Lorie, P. McJones, J. Mehl, G. Putzolu, I. Traiger, B. Wade, and V. Watson. System R: Relational Approach to Database Management. ACM Transactions on Database Systems, 1(2):97--137, June 1976.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC