
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Surajit Chaudhuri, Mayur Datar, Vivek Narasayya, "Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 11, pp. 13131323, November, 2004.  
BibTex  x  
@article{ 10.1109/TKDE.2004.75, author = {Surajit Chaudhuri and Mayur Datar and Vivek Narasayya}, title = {Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {16}, number = {11}, issn = {10414347}, year = {2004}, pages = {13131323}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.75}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution IS  11 SN  10414347 SP1313 EP1323 EPD  13131323 A1  Surajit Chaudhuri, A1  Mayur Datar, A1  Vivek Narasayya, PY  2004 KW  Index selection KW  approximation KW  hardness result KW  NPhardness KW  knapsack KW  linear programming KW  scalability. VL  16 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] S. Agrawal, S. Chaudhuri, and V. Narasayya, Automated Selection of Materialized Views and Indexes for SQL Databases Proc. 26th Int'l Conf. Very Large Databases (VLDB00), pp. 496505, 2000.
[2] APBI, OLAP Benchmark, Release II, OLAP Council,http:/www.olapcouncil.org/, Nov. 1998.
[3] M. Bellare, Interactive Proofs and Approximation: Reductions from Two Provers in One Round Proc. Second Israel Symp. Theory of Computing Systems, pp. 266274, 1993.
[4] S. Chaudhuri and V. Narasayya, An Efficient, CostDriven Index Selection Tool for Microsoft SQL Server Proc. 23rd Int'l Conf. Very Large Databases (VLDB), pp. 146155, 1997.
[5] S. Chaudhuri and V. Narasayya, AutoAdmin‘WhatIf’Index Analysis Utility Proc. ACM SIGMOD, 1998.
[6] S. Choenni, H. Blanken, and T. Chang, Index Selection in Relational Databases Proc. Fifth IEEE Int'l Conf. Computing and Information, 1993.
[7] D. Comer, The Difficulty of Optimum Index Selection ACM Trans. Database Systems, vol. 3, no. 4, pp. 440445, Dec. 1978.
[8] L. Engebretsen, Lower Bounds for NonBoolean Constraint Satisfaction Programs Technical Report TR00042, Electronic Colloquium on Computational Complexity, June 2000.
[9] U. Feige and M.K. Goemans, Approximation the Value of Two Prover Proof Systems, with Applications to MAX 2SAT and MAX DICUT Proc. Third Israel Symp. Theory of Computing and Systems, pp. 182189, 1995.
[10] U. Feige, G. Kortsarz, and D. Peleg, The Dense kSubgraph Problem Algorithmica, vol. 29, pp. 410421, 2001.
[11] S. Finkelstein, M. Schkolnick, and P. Tiberio, Physical Database Design for Relational Databases Proc. ACM Trans. Database Systems, Mar. 1988.
[12] R. Garfinkel and G. Nemhauser, Integer Programming. New York: John Wiley&Sons, pp. 214241, 1972.
[13] M.X. Goemans and D.P. Williamson, 878Approximation Algorithms for MAXCUT and MAX 2SAT Proc. 26th Ann. ACM Symp. Theory of Computing, pp. 422431, 1994.
[14] H. Gupta, V. Harinarayan, A. Rajaramana, and J. Ullman, Index Selection for OLAP Proc. 13th Int'l Conf. Data Eng., 1997.
[15] J. Håstad, Some Optimal Inapproximability Results Proc. 29th Ann. ACM Symp. Theory of Computing, pp. 110, 1997.
[16] M. Hammer and A. Chan, Index Selection in a Self Adaptive Data Base Management System Proc. SIGMOD Conf., 1976.
[17] C. Heeren, H.V. Jagadish, and L. Pitt, Optimal Indexing Using NearMinimal Space Proc. ACM Symp. Principles of Database Systems (PODS), pp. 244251, 2003.
[18] V. Harinarayan, A. Rajaramana, and J. Ullman, Implementing Data Cubes Efficiently Proc. SIGMOD, 1996.
[19] D. Hochbaum, Approximation Algorithms for NPHard Problems. PWS Publishing Co., 1997.
[20] H. Karloff and M. Michail, On the Complexity of the View Selection Problem Proc. ACM Symp. Principles of Database Systems (PODS), 1999.
[21] G. Lohman, A. Skelley, G. Valentin, D. Zillio, and M. Zuliani, DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes Proc. 16th Int'l Conf. Data Eng., pp. 101110, 2000.
[22] S. Rozen and D. Shasha, A Framework for Automating Physical Database Design Proc. Conf. Very Large Databases, 1991.
[23] M. Serna, L. Trevisan, and F. Xhafa, The (Parallel) Approximability of NonBoolean Satisfiability Problems and Restricted Integer Programming Proc. 15th Ann. Symp. Theoretical Aspects of Computer Science, pp. 488498, 1998.
[24] A. Shukla, P. Deshpande, and J. Naughton, Materialized View Selection for MultiCube Data Models Proc. Int'l Conf. Extending Database Technology, 2000.
[25] TPC Benchmark H, Decision Support,http:/www.tpc.org, 2004.