url - Universität zu Lübeck

170 BIBLIOGRAPHY
[12] Alberto Caprara, Matteo Fischetti, and Dario Maio. Exact and Approximate
Algorithms for the Index Selection Problem in Physical Database Design.
IEEE Transactions on Knowledge and Data Engineering, 7(6):955–967, December
1995.
[13] Surajit Chaudhuri. An Overview of Query Optimization in Relational Systems.
In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, June 1-3, 1998, Seattle, Washington,
pages 34–43. ACM Press, 1998.
[14] Surajit Chaudhuri and Vivek R. Narasayya. An Efficient Cost-Driven Index
Selection Tool for Microsoft SQL Server. In VLDB’97, Proceedings of 23rd
International Conference on Very Large Data Bases, August 25-29, 1997,
Athens, Greece. Morgan Kaufmann, 1997.
[15] Surajit Chaudhuri and Vivek R. Narasayya. AutoAdmin ’What-if’ Index
Analysis Utility. In Laura M. Haas and Ashutosh Tiwary, editors, SIGMOD
1998, Proceedings ACM SIGMOD International Conference on Management
of Data, June 2-4, 1998, Seattle, Washington, USA, pages 367–378. ACM
Press, 1998.
[16] Surajit Chaudhuri and Vivek R. Narasayya. Microsoft Index Tuning Wizard
for SQL Server 7.0. In Laura M. Haas and Ashutosh Tiwary, editors,
SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management
of Data, June 2-4, 1998, Seattle, Washington, USA, pages 553–554.
ACM Press, 1998.
[17] Qun Chen, Andrew Lim, and Kian Win Ong. D(k)-index: an adaptive structural
summary for graph-structured data. In Proceedings of the 2003 ACM
SIGMOD international conference on Management of data, pages 134 – 144,
San Diego, California, USA, 2003.
[18] Aske Simon Christensen, Anders Møller, and Michael I. Schwartzbach. Extending
Java for high-level Web service construction. ACM Transactions on
Programming Languages and Systems, 25(6):814–875, November 2003.
[19] Chin-Wan Chung, Jun-Ki Min, and Kyuseok Shim. APEX: an adaptive path
index for XML data. In SIGMOD 2002, Proceedings of the 2002 ACM SIGMOD
International Conference on Management of Data, Madison, Wisconsin, USA,
pages 121–132. ACM Press, 2002.
[20] Douglas Comer. The Difficulty of Optimum Index Selection. ACM Transactions
on Database Systems, 3(4):440–445, December 1978.
[21] Stephen A. Cook. The complexity of theorem proving procedures. In Proceedings
of the Third Annual ACM Symposium on Theory of Computing, pages
151–158, Ojio, USA, 1971. Shaker Heights.
[22] Brian F. Cooper, Neal Sample, Michael J. Franklin, Gísli R. Hjaltason, and
Moshe Shadmon. A Fast Index for Semistructured Data. In Proceedings
of 27th International Conference on Very Large Data Bases, Roma, Italy,
September 11-14 2001. Morgan Kaufmann.