Performance analysis of database systems

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

Volumn 1769, Issue , 2000, Pages 305-327

  Thomasian, Alexander ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 62649103926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46506-5_13     Document Type: Conference Paper

References (135)

1. R. Agrawal, T. Imielinski, and A. Swami. “Mining association rules between sets of items in large databases," Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1993, 207-216.
2. J. Aman, C. K. Eilert, D. Emmens, P. Yacom, and D. N. Dillenberger: “Adaptive algorithms for managing a distributed data processing workload," IBM Systems Journal 36, 2 (1997), 242-283.
3. G. Antoshenkov and M. Ziauddin. “Query processing and optimization in Oracle Rdb," The Very Large Data Base Journal 5, (1996), 229-237.
4. D. Barbara et al. “The New Jersey data reduction report," Bulletin Technical Committee on Data Engineering 20, 4 (1997), 3-45.
5. D. S. Batory. “Optimal file designs and reorganization points," ACM Trans. on Database Systems 7, 1 (1982), 60-81.
6. P. P. Bhattacharya, I. Viniotis, L. Georgiadis, and P. Tsoucas. “Ergodicity and optimality of an adaptive multi-objective scheduling algorithms," IBM Research Report RC 15547, Hawthorne, NY, 1990.
7. A. Bhide, A. Dan, and D. M. Dias: “A simple analysis of the LRU buffer policy and its relationship to buffer warmup transient," Proc. 9th IEEE Int'l Conf. on Data Engineering 1993, pp. 125-133.
8. D. Bitton, D. J. DeWitt, D. K. Hsiao, and J. Menon. “A taxonomy of parallel sorting, “ ACM Computing Surveys 16, 3 (1984), 287-318.
9. M. W. Blasgen and K. P. Eswaran. “Storage and access in relational databases, “ IBM Systems J. 16, 4 (1977), 362-377.
10. J. P. Buzen. “A queueing network model of MVS, “ ACM Computing Surveys 10, 3 (1978), 319-331.
11. P. Cao and C. Liu. “Maintaining strong cache consistency in the world wide web, “ IEEE Trans. on Computers 47, 4 (April 1998), 445-457.
12. I. R. Casas and K. C. Sevcik: “Structure and validation of an analytic performance predictor for System 2000 databases, “ INFOR 27, 2 (May 1989), 129-144.
13. F. Cesarini and S. Silvio: Database Machine Performance: Modeling Methodology and Evaluation Strategies, in Lecture Notes in Computer Science Vol. 257, Springer-Verlag, 1987.
14. P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson: “RAID: High-performance, reliable secondary storage,“ ACM Computing Surveys 26, 2 (June 1994), 145-185.
15. J. M. Cheng, C. R. Loosley, A. Shibamiya, and P. S. Worthington: “IBM database 2 performance: Design, implementation, and tuning,” IBM Systems J. 23, 2 (1984), 189-210.
16. J. Cheng, D. Haderle, R. Hedges, B. R. Iyer, T. Messinger, C. Mohan, and Y. Wang. “An efficient hybrid join algorithm: A DB2 prototype” Proc. 7th IEEE Int'l Conf. on Data Engineering, 1991, pp. 171-180.
17. S. Chaudhuri and V. Narasayya: “AutoAdmin what-if index analysis utility,“ Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1998, pp. 367-378.
18. S. Chaudhuri, E. Christensen, G. Graefe, V. Narasayya, and M. Zwilling: “Selftuning technology in Microsoft SQL Server,” IEEE Data Engineering Bulletin 22, 2 (June 1999), pp. 20-26.
19. H. T. Chou and D. J. DeWitt: “An evaluation of bu_er management strategies for relational database systems,” Algorithmica 1, 3 (1986), 311-336.
20. S. Christodoulakis. “Implications on certain assumptions in database performance evaluation,” ACM Trans. on Database Systems 9, 2 (June 1984), 163-186.
21. E. G. Coffman Jr. and P. J. Denning. Operating Systems Theory, Prentice-Hall, 1973.
22. E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. “Approximations algorithms for bin packing- An updated survey,” in Algorithm Design for Computer System Design, G. Ausiello abd P. Serafini (eds.), 1984, pp. 51-106.
23. R. Cole and G. Graefe: “Optimization of dynamic query evaluation plans,” Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1994, pp. 150-160.
24. R. B. Cooper and M. K. Solomon.: “The average time until bucket overflow,” ACM Trans. on Database Systems 9, 3 (1984), 392-408.
25. D. W. Cornell, D. M. Dias, and P. S. Yu. “On multisystem coupling through function request shipping,” IEEE Trans. Software Engineering 12, 10 (Oct. 1990), 1006-1017.
26. A. Dan. Performance Analysis of Data Sharing Environments, MIT Press, 1992.
27. A. Dan, P. S. Yu, and J. Y. Chung: “Characterizing of database access pattern for analytic prediction of buffer hit ratio,” The Very Large Data Base Journal 4, (1995), 127-154.
28. D. J. DeWitt, R. H. Katz, D. Olken, L. D. Shapiro, M. Stonebraker, and D. Wood. “Implementation techniques for main storage database systems,” Proc. ACM SIGMOD Conf. on Management of Data, 1984, pp. 1-8.
29. D. J. DeWitt and J. Gray. “Parallel database systems: The future of high performance database systems,” Commun. of the ACM 35, 6 (June 1992), 85-98.
30. D. J. DeWitt, J. F. Naughton, D. A. Schneider, and S. Seshadri: “Practical skew handling in parallel joins, “Proc. 18th Int'l Conf. on Very Large Data Bases, 1992, pp. 27-40.
31. D. M. Dias, B. R. Iyer, J. T. Robinson, and P. S. Yu. “Integrated concurrency- coherency control for multisystem data sharing,” IEEE Trans. on Software Engineering 15, 4 (1989), pp. 437-448.
32. L. W. Dowdy and D. V. Foster. “Comparative models of the file assignment problem,” ACM Computing Surveys 14, 2 (1984), 287-313.
33. W. Effelsberg and T. Haerder. “Principles of database buffer management,” ACM Trans. on Database Systems 9, 4 (1984), 560-595.
34. L. Fan, P. Cao, W. Lin, and Q. Jacobson. “Web prefetching between low- bandwidth clients and proxies: Potentials and performance,” Proc. ACM SIG- METRICS Conf. on Measurement and Modeling of Computer Systems, 1999, pp. 178-187.
35. R. Fagin. “Combining fuzzy information from multiple sources,” Journal of Computer and System Sciences 58, 1 (1999), 83-99.
36. C. Faloutsos. Searching Multimedia Databases by Content, Kluwer Academic Publishers, 1997.
37. A. Fiat and G. J. Woeginger. “Competitive analysis of algorithms,” in Online Algorithms 1996, Lecture Notes in Computer Science Vol. 1442, Springer-Verlag, pp. 1-12.
38. S. Finkelstein, M. Schkolnick, and P. Tiberio. “Physical database design for relational databases,” ACM Trans. on Database Systems 9, 4 (Dec. 1988), 526-559.
39. D. Florescu and D. Kossmann. “A performance evaluation of alternative mapping schemes for storing XML data in a relational database,” INRIA Research Report No. 3680, May 1999.
40. M. J. Franklin, M. J. Carey, and M. Livny. “Transactional client-server cache consistency: Alternatives and performance,” ACM Trans. on Database Systems 22, 3 (Sept. 1997), 315-363.
41. V Gaede and O. Guenther. “Multidimensional access methods,” ACM Computing Surveys 30, 2 (June 1998), 170-231.
42. M. N. Garofalakis and Y. E. Ioannidis. “Parallel query scheduling and optimization with time- and space-shared resources,” Proc. 23rd Int'l Conf. on Very Large Data Bases, 1997, pp. 296-305.
43. E. Gelenbe and I. Mitrani. Analysis and Synthesis of Computer Systems. Academic Press, 1980.
44. L. Georgiadis, C. Nikolaou, and A. Thomasian. “A fair load balancing policy for heterogeneous systems” IBM Research Report RC 14323, Hawthorne, NY, Nov. 1989.
45. G. Graefe. “Query evaluation techniques for large databases,” ACM computing Surveys 25, 2 (June 1993), 73-120.
46. J. Gray (ed.) The Benchmark Handbook for Database and Transaction Processing Systems, 2nd ed. Morgan Kaufmann, 1993.
47. L. M. Haas, M. J. Carey, M. Livny, and A Shukla. “Seeking the truth about ad hoc join costs,” The Very Large Data Base Journal 6, (1997), 241-256.
48. R. B. Hagmann and D. Ferrari. “Performance analysis of several back-end database architectures,” ACM Trans. on Database Systems 11, 1 (March 1986), 1-26.
49. E. P. Harris and K. Ramamohanarao. “Join algorithm cost revisited,” The Very Large Data Base Journal 5, (1996), 64-84.
50. P. Heidelberger and M. Seetha Lakshmi. “A performance comparison of multimicro and mainframe database architectures,” IEEE Trans. Software Engineering 14, 4 (April 1988), 522-531.
51. P. Helland, H. Sammer, J. Lyon, R. Carr, P. Garret, and A. Reuter. “Group commit times and high volume transaction processing,” in High Volume Transaction Systems, D. Gawlick, M. N. Hayne, and A. Reuter (eds.), Springer-Verlag, 1987, pp. 301-327.
52. J. M. Hellerstein, P. J. Haas, and H. Wong. “Online aggregation,” Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1997, pp. 171-182.
53. D. P. Heyman. “Mathematical models of database reorganization,” ACM Trans. on Database Systems 7, 4 (1982), 615-631.
54. M. Hofri. Analysis of Algorithms: Computational Methods and Mathematical Tools. Oxford University Press, 1995.
55. H.-I. Hsiao, M.-S. Chen, and P. S. Yu. “Parallel execution of hash joins in parallel databases,” IEEE Trans. Parallel and Distributed Systems 8, 8 (Aug. 1997), 872-883.
56. K. A. Hua, C. Lee, and C. M. Hua. “Dynamic load balancing in multicomputer database systems using partition tuning,” IEEE Trans. on Knowledge and Data Engineering 7, 6 (Dec. 1995), 968-983.
57. W. Hyslop. Performance Prediction of Relational Database Management Systems, Ph.D. Thesis, Computer Science Dept., University of Toronto, 1991.
58. W. F. Hyslop and K. C. Sevcik. “Performance prediction of relational database systems,” Proc. Canadian Computer Measurement Group (CMG) Conf., pp. 298-312.
59. T. Ibaraki and N. Katoh. Resource Allocation Problems, MIT Press, 1984.
60. Y. E. Ioannidis and E. Wong: “Query optimization by simulated annealing,” Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1987, pp. 9-22.
61. Y. E. Ioannidis. “Query Optimization,” in The Computer Science and Engineering Handbook, 1997, pp. 1038-1057.
62. Y. E. Ioannidis, R. T. Ng, K. Shim, and T. K. Sellis. “Parametric query optimization,” The Very Large Data Base Journal 6, (1997), 132-151.
63. B. R. Iyer and D. Wilhite. “Data compression support in databases,” Proc. 20th Int'l Conf. on Very Large Data Bases, 1994, 695-704.
64. H. V. Jagadish, N Koudas, S. Muthukrishna, V. Poosala, K. Sevcik, and T. Suel. “Optimal histograms with quality guarantees,” Proc. 24th Int'l Conf. on Very Large Data Bases, 1998, 275-286.
65. A. Jain and R. Dubes. Algorithms for Clustering Data, Prentice-Hall, 1988.
66. A. Jhingran and P. Khedkar. “Analysis of recovery in a database system using a write-ahead logging protocol,” Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1992, 175-184.
67. K. Keeton, D. A. Patterson, and J. M. Hellerstein. “A case for intelligent disks (IDISKS),” Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1998, pp. 24-32.
68. W. F. King III. “Analysis of demand paging algorithms,” Information Processing 71, North-Holland, 1972, pp. 485-490.
69. D. E. Knuth. The Art of Computer Programming Vol. 3: Sorting and Searching, 2nd Ed. Addison-Wesley, 1998.
70. V. Kumar and M. Hsu (eds.) Recovery Mechanisms in Database Systems, Prentice-Hall, 1998.
71. T. Lang, C. Wood, and E. B. Fernandez. \Database buffer paging in virtual storage systems," ACM Trans. on Database Systems 2,4 (Dec. 1977), 339-351.
72. P. A. Larson. \Dynamic hash tables," Commun. of the ACM 31,4 (April 1988), 446-457.
73. H. Levy and R. J. T. Morris. \Should caches be split or shared? Analysis using the superposition of bursty stack depth processes," Performance Evaluation 27/28 (1996), 175-188.
74. R. J. Lipton, J. F. Naughton, and D. A. Schneider. \Practical selectivity estimation through adaptive sampling," Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1990, pp. 1-11.
75. H. Lu and M. J. Carey. \Some experimental results on distributed join algorithms," Proc. 11th Int'l Conf. on Very Large Data Bases, 1985, pp. 292-304.
76. H. Lu, B.-C. Ooi, and K.-L. Tan. Query Processing in Parallel Relational Database Systems, IEEE Computer Society Press,1994.
77. L. F. Mackert and G. M. Lohman. \Index scans using a finite LRU buffer: A validated I/O model," ACM Trans. on Database Systems 14,3 (Sept. 1989), 401-424.
78. M. Mannino, P. Chu, and T. Sager. \Statistical profile estimation in database systems," ACM Computing Surveys 20,3 (Sept. 1988), 191-221.
79. A. Marshall and I. Olken. Inequalities: Theory of Majorization and Its Applications, Academic Press, 1979.
80. M. Mehta and D. J. DeWitt. \Data placement in shared-nothing parallel database systems," The Very Large Data Base Journal 6,1 (1997), 53-72.
81. C. Mohan, D. Haderle, Y. Wang, and J. Cheng. \Single table access using multiple indexes: Optimization, execution, and concurrency control techniques," Proc. Int'l Conf. on Extending Data Base Technology, 1990, pp. 29-43.
82. C. Mohan, D. Haderle, B. Lindsey, H. Pirahesh, and P. Schwartz. \ARIES: A transaction recovery method supporting _ne-granularity locking and partial roll-backs using write-ahead logging," ACM Trans. on Database Systems 17,1 (March 1992), 94-162.
83. A. N. Mourad, R. J. T. Morris, A. N. Swami, and H. C. Young. \Limits of parallelism in hash-join algorithms," Performance Evaluation 20,(1-3), (1994), 301-316.
84. S. B. Navathe, S. Ceri, G. Wiederhold, and J. Dou. \Vertical partitioning algorithms for database design," ACM Trans. on Database Systems 9,4 (Dec. 1984), 680-710.
85. J. A. Nelder and R. Mead. \A simplex method for function minimization," Computer Journal 7, (1965), 308-314.
86. R. T. Ng, C. Faloutsos, and T. K. Selis. \Flexible buffer allocation based on marginal gains," Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1991, pp. 387-396.
87. V. F. Nicola and J. M. van Spanje. \Comparative analysis of different models of checkpointing and recovery," IEEE Trans. on Software Engineering 16,8 (Aug. 1990), 807-821.
88. V. F. Nicola, A. Dan, and D. M. Dias. \Performance analysis of the clock page replacement policy," Proc. ACM SIGMETRICS/PERFORMANCE '92 Joint Conf., pp. 35-46.
89. H. Pirahesh, C. Mohan, J. M. Cheng, T. S. Liu, and P. G. Selinger. \Parallelism in relational data base systems: Architectural issues in design approaches," Proc. Int'l Symp. on Databases in Parallel and Distr. Systems, 1990, pp. 4-29.
90. G. Proietti and C. Faloutsos. \Selectivity estimation of window queries," Proc. Conf. on Information and Knowledge Management (CIKM), 1998, pp. 340-347.
91. E. Rahm. \Empirical performance evaluation of concurrency and coherency controls for database sharing systems," ACM Trans. on Database Systems 18,2 (June 1993), 333-377.
92. R. Ramakrishnan. An Introduction to Database Systems, 2nd ed., McGraw-Hill, 1999.
93. G. Ray, J. R. Haritsa, and S. Seshadri. \Database compression: A performance enhancement tool," Proc. 7th Int'l Conf. on Management of Data (COMAD), 1995.
94. A. Reuter. \Performance analysis of recovery techniques," ACM Trans. on Database Systems 9,4 (Dec. 1984), 526-559.
95. G. M. Sacco and M. Schkolnick. \Buffer management in relational database systems," ACM Trans. on Database Systems 11,4 (Dec. 1986), 473-496.
96. H. S. Sandhu and K. C. Sevcik. \An analytic study of dynamic hardware and software cache coherence strategies," Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1995, pp. 167-177.
97. M. Schkolnick. \A clustering algorithm for hierarchical structures," ACM Trans. on Database Systems 2,1 (March 1988), 27-44.
98. H. Schwetman. \Hybrid simulation models of computer systems," Commun. of the ACM 21,9 (1978), 718-723.
99. B. Seeger. \An analysis of schedules for performing mult-page requests," Information Systems 21,5 (July, 1996), 387-407.
100. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. \Access path selection in a relational database management system," Proc. ACM SIGMOD Int'l Conf. on Management of Data, 1979, pp. 23-34.
101. A. Serry. An Analytical Approach to Modelling IMS Systems, Ph.D. Thesis, Computer Science Dept., University of Toronto, 1984.
102. K. C. Sevcik. \Data base system performance prediction using an analytic model," Proc. 7th Int'l Conf. on Very Large Data Bases, 1981, pp. 182-196.
103. L. D. Shapiro. \Join processing in database systems with large main memories," ACM Trans. on Database Systems 11,3 (Sept. 1986), 239-264.
104. D. Sleator and R. E. Tarjan. \Amortized efficiency of list update and paging rules," Commun. of the ACM 28,2 (Feb. 1985), 202-208.
105. A. J. Smith. \Sequentiality and prefetching in database systems," ACM Trans. on Database Systems 3,3 (March 1978), 223-247.
106. A. J. Smith. \Disk cache: Miss ratio analysis and design considerations," ACM Trans. on Computer Systems 3,3 (1985), 161-203.
107. J. T. Spirn. Program Behavior: Models and Measurements, Elsevier, 1977.
108. J. T. Spirn and S. Tsur. \Memory management for B-trees," Performance Evaluation 4, (1985), 159-174.
109. A. Swami and K. B. Shiefer. \Estimating page fetches for index scans with finite LRU buffers," The Very Large Data Base Journal 4, (1995), 675-701.
110. J. Z. Teng and R. A. Gumaer. \Managing IBM Database 2 buffers to maximize performance," IBM Systems J. 23,2 (1984), 211-218.
111. D. Theodoratos and T. Sellis. \Data warehouse configuration," Proc. 23rs Int'l Conf. on Very Large Data Bases, 1997, pp. 126-135.
112. A. Thomasian and P. Bay. \Analysis of queueing network models with population size constraints and delayed blocked customers," Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1984, pp. 202-216.
113. A. Thomasian and P. Bay. \Analytic queueing network models for parallel processing of task systems," IEEE Trans. on Computers 35,12 (Dec. 1986), 1045-1054.
114. A. Thomasian. \A performance study of dynamic load balancing in distributed systems," Proc. 7th IEEE Int'l Conf. on Distributed Computing Systems, 1987, pp. 178-185.
115. A. Thomasian. \Checkpointing for optimistic concurrency control methods," IEEE Trans. Knowledge and Data Engineering 7,2 (April 1995), 322-329.
116. A. Thomasian. Database Concurrency Control: Methods, Performance, and Analysis, Kluwer Academic Publishers, 1996.
117. A. Thomasian and J. Menon. \RAID5 performance with distributed sparing," IEEE Trans. on Parallel and Distributed Systems 8,6 (June 1997), 640-657.
118. A. Thomasian. \RAID5 Disk Arrays and Their Performance Analysis," Chapter 37 in Recovery in Database Management Systems V. Kumar and M. Hsu (Eds.), Prentice-Hall, 1998.
119. A. Thomasian, V. Castelli, and C. S. Li. \Clustering and singular value decomposition for approximate indexing in high-dimensional spaces," Proc. Conf. on Information and Knowledge Management (CIKM), 1998, pp. 267-272.
120. D. F. Towsley, K. M. Chandy, and J. C. Browne. \Models for parallel processing within programs: Application to CPU:O/O and I/O:I/O overlap," Commun. of the ACM 21,10 (Oct. 1978), 821-831.
121. J. Turek, J. L. Wolf, K. R. Pattipati, and P. S. Yu. \Scheduling parallelizable tasks: Putting it all on the shelf," Proc. Joint PERFORMANCE '92/AXM SIGMETRICS Conf. pp. 225-236.
122. P. J. Varman, S. D. Sheuffer, B. R. Iyer, and G. R. Ricard. \Merging multiple lists on hierarchical memory multiprocessors," Journal of Parallel and Distributed Computing 12, (1991), 171-177.
123. J. S. Vitter and W. C. Chen. Design and Analysis of Coalesced Hashing, Oxford University Press, 1987.
124. Y. T. Wang and R.J.T. Morris. \Load sharing in distributed systems," IEEE Trans. on Computers 43,3 (March 1985), 204-217.
125. R. Weber, H. J. Scheck, and S. Blott. \A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," Proc. 24th Int'l Conf. on Very Large Data Bases, 1998, pp. 194-205.
126. G. Wiederhold. Database Design, McGraw-Hill, 1983.
127. K. Y. Whang and R. Krishnamurthy. \Query optimization in a memory resident domain relational calculus database systems," ACM Trans. on Database Systems 15,1 (March 1990), 67-95.
128. J. L. Wolf. B. R. Iyer, K. R. Pattipati, and J. Turek. \Optimal buffer partitioning for the nested block join algorithm," Proc. IEEE Int'l Conf. on Data Engineering, 1991, pp. 510-519.
129. A. C. Yao. \On random 2-3 trees," Acta Informatica 9, (1978), 159-170.
130. S. B. Yao, K. S. Das, and T. J. Teorey. \A dynamic database reorganization algorithm," ACM Trans. on Database Systems 1,2 (1976), 159-174.
131. S. B. Yao. \An attribute based model for database access cost analysis," ACM Trans. on Database Systems 2,1 (March 1977), 45-67.
132. P. S. Yu, S. Balsamo, and Y. H. Lee. \Dynamic transaction routing in distributed database systems," IEEE Trans. on Software Engineering 14,9 (Sept. 1988), 1307-1318.
133. P. S. Yu, D.W. Cornell, D. M. Dias, and A. Thomasian. \Performance comparison of the IO shipping and database call shipping schemes in multisystem partitioned database systems," Performance Evaluation 10, (1989), 15-33.
134. T. Zhang, R. Ramakrishnan, and M. Livny. \Birch: A new data clustering algorithm and its applications," Data Mining and Knowledge Discovery 1,2 (1997), 141-182.
135. C. Zou and B. Salzberg. \Towards efficient database reorganization," IEEE Data Engineering Bulletin 19,2 (1996), 33-40.