Increasing concurrency in databases using program analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3086, Issue , 2004, Pages 341-363

  Vitenberg, Roman ^a   Kvilekval, Kristian ^a   Singh, Ambuj K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048823939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (20)

1. Ozone oodb. Technical report, www.ozone-db.org, 2001.
2. D. Bacon and P. Sweeney. Fast static analysis of C++ virtual function calls. In OOPSLA Object-Oriented Programming Systems, Languages, and Applications, San Jose, California, Oct 1996. ACM.
3. P. Bernstein, V. Hadzilacos, and H. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, 1987.
4. Jeff Bogda and Urs Hölzle. Removing unnecessary synchronization in Java. In OOPSLA, pages 35-465, Denver, CO, Nov 1999. ACM.
5. Cahoon and McKinley. Data flow analysis for software prefetching linked data structures in Java. In International Conference on Parallel Architectures and Compilation Techniques, Barcelona, Spain, Sep 2001. ACM.
6. Michael J. Carey, David J. DeWitt, and Jeffrey F. Naughton. The 007 benchmark. SIGMOD Record (ACM Special Interest Group on Management of Data), 22(2):12-21, 1993.
7. R. G. G. Cattell and J. Skeen. Object operations benchmark. TODS, 17(1):1-31,1992.
8. F. Corbera, Rafael Asenjo, and Emilio L. Zapata. New shape analysis techniques for automatic parallelization of C codes. In International Conference on Supercomputing, pages 220-227, Rhodes, Greece, Jun 1999. ACM.
9. Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Symposium on Principles of Programming Languages POPL, pages 1-15, St. Petersburg, Florida, Jan 1996. ACM.
10. Nils Knafla. Prefetching Techniques for Client/Server, Object-Oriented Database Systems. PhD thesis, University of Edinburgh, 1999.
11. Kristian Kvilekval and Ambuj Singh. Prefetching for mobile computers using shape graphs. In LCR 2002, Washington DC, Mar 2002. ACM.
12. L. Lamport. Time, Clocks and the Ordering of Event in a DistributedSystem. Communications of the ACM, 21(7):558-565, July 1978.
13. Sun Microsystems. Java Data Objects, 2003.
14. Dor Nurit, Rodeh Michael, and Sagiv Mooly. Detecting memory errors via static pointer analysis. In Workshop on Program Analysis for Software Tools and Engineering (PASTE'98), pages 27-34, New York, NY, Jun 1998. ACM.
15. ODMG. Object Query Language, 2003.
16. C. Papadimitriou. The Theory of Concurrency Control. Computer Science Press, Rockville, MD, 1986.
17. Erik Ruf. Effective synchronization removal for Java. In SIGPLAN Conference on Programming Language Design and Implementation (PLDI2000), Vancouver, British Columbia, Jun 2000. ACM.
18. K. Salem, H. Garcia-Molina, and J. Shands. Atruistic locking. In Transactions on Database Systems. ACM, 1994.
19. Gottfried Vossen, Gerhard Weikum, and Jim Gray (Editor). Transactional Information Systems: Theory, Algorithms, and Practice of Concurrency Control and Recovery. Morgan Kaufmann, 2001.
20. R. Wilhelm, M. Sagiv, and T. Reps. Shape analysis. In Proc. of CC 2000: 9th Int. Conf. on Compiler Construction, Berlin, Germany, Mar 2000. Springer-Verlag.