Logical and physical versioning in main memory databases

Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997

Volumn , Issue , 1997, Pages 86-95

  Rastogi, Rajeev ^a   Seshadri, S ^b   Bohannon, Philip ^a   Leinbaug, Dennis ^a   Silberschatz, Avi ^a   Sudarshan, S ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; DIGITAL STORAGE; STORAGE MANAGEMENT;

CONCURRENT ACCESS; DATA ITEMS; MAIN MEMORY; MAIN MEMORY DATABASE; MULTI-VERSION; PERFORMANCE BENEFITS; READ-ONLY TRANSACTION; SPACE SAVINGS;

DATABASE SYSTEMS;

EID: 84993661621     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Aho, J. Hopcroft, and .J. D. Ullman. The De sign and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. P. Bober and M. Carey. On mixing queries and transactions via inultiversion locking. In Procs. IEEE Intl. Conf. on Data Engineering, February 1992.
3. P. Bohannon, D. Leinbaugh, R. Rastogi, S. Se-shadri, A. Silberschatz, and S. Sudarshan. Logical and physical versioning in main memory databases. Technical Report 113880-951031-12, AT&T Bell Laboratories, Murray Hill, 1995.
4. R. Bayer and M. Schkolnick. Concurrency of operations on B-trees. Acta Informalica, 9(1):1-21, 1977.
5. A. Chan, S. Fox, W-T.K. Lin, A. Nori, and D.R. Ries. The implementation of an integrated concurrency control and recovery scheme. In Procs. of the ACM SIGMOD Con], on Management of Data, pages 184-191, June 1982.
6. D. J. DeWitt, R. Katz, F. Olken, D. Shapiro, M. Stonebraker, and D. Wood. Implementation techniques for main memory database systems. Procs. of the ACM SIGMOD Conf. on Management of Data, pages 1-8, June 1984.
7. V. Gottemukkala and T. Lehman. Locking and latching in a memory-resident database system. In Procs. of the International Conf. on Very Large Databases, pages 533-544, August 1992.
8. H.V. Jagadish, Dan Lieuwen, Rajeev Rastogi, Avi Silberschatz, and S. Sudarshan. Dali: A high per formance main-memory storage manager. In Procs. of the International Conf. on Very Large Databases, 1994.
9. H.T. Kung and P.L. Lehman. Concurrent manipulation of binary search trees. ACM Transactions on Database Systems ., 5(3):354-382, September 1980.
10. T.J. Lehman and M.J. Carey. A study of index structures for main memory database management systems. In Procs. of the International Conf. on Very Large Databases, pages 294-303, August 1986.
11. U. Manber and G.D. Ladner. Concurrency control in dynamic search structures. ACM Proc.on Database Systems, Boston., pages 268-282, April 1982.
12. C. Mohan and F. Levine. Aries/im an efficient and high concurrency index management method using write- ahead logging. In Procs. of the ACM SIG MOD Conf. on Management of Data, June 1992.
13. C. Mohan. Aries/kvl: A key-value locking method for concurrency control of multiaction trans actions operating on btree indexes. In Procs. of the In ternational Conf. on Very Large Databases, September 1990.
14. C. Mohan, H. Pirahesh, and R. Lorte. Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions. In Procs. of the ACM SIGMOD Conf. on Management of Data, June 1992.
15. D. Shasha and N. Goodman. Concurrent search structure algorithms. ACM Transactions on Database Systems, no.l., 13:53-90, March 1988.
16. K. Salem and H. Garcia-Molina. System M: A transaction processing testbed for memory resident data. IEEE Transactions on Knowledge and Data Engineering, 2(1):161-172, March 1990.