Abstract
High-dimensional indexes do not work because of the often-cited “curse of dimensionality.” However, users are usually interested in querying data over a relatively small subset of the entire attribute set at a time. A potential solution is to use lower dimensional indexes that accurately represent the user access patterns. To address these issues, in this paper we propose a parameterizable technique to recommend indexes based on index types.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldstein, J., Platt, J.C., Burges, C.J.C.: Indexing High Dimensional Rectangles for Fast Multimedia Identification. Technical Report MSR-TR-2003-38 (2003)
Bohm, C., Berchtold, S., Keim, D.A.: Searching in High-Dimensional Spaces—Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys 33(3), 322–373 (2001)
Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. The MIT Press (2001)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers (2000)
Lawder, J.K., King, P.J.H.: Using Space-filling Curves for Multi-dimensional Indexing (June 2000)
Heesch, D., Rueger, S.: NNk networks for content-based image retrieval. In: Proceedings of the 26th European Conference on Information Retrieval (ECIR), Sunderland, UK (April 2004)
Bingham, E., Mannila, H.: Random projection in dimensionality reduction: Applications for image and text data. In: KDD 2001, San Francisco, CA (2001)
Chakrabarti, K., Mehrotra, S.: Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces. In: VLDB Conference Proceedings (2000)
Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.: Indexing the distance: an efficient method to knn processing. In: Proc. 27th International Conference on Very Large Data Bases, pp. 421–430 (2001)
Valentin, G., Zuliani, M., Zilio, D., Lohman, G., Skelley, A.: DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes. In: Proc. 16th Int’l Conf. Data Eng., ICDE 2000 (2000)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Chen, W., Naughton, J., Bernstein, P.A. (eds.) Proc. ACM SIGMOD Int’l Conf. Management of Data (SIGMOD 2000), pp. 1–12 (2000)
Berchtold, S., Keim, D., Kriegel, H.: The X-Tree: An Index Structure for High-Dimensional Data. In: Proc. 22nd Int’l Conf. Very Large Data Bases (VLDB 1996), pp. 28–39 (1996)
Chung, C.-W., Cha, G.-H.: The GC-Tree: A High-Dimensional Index Structure for Similarity Search in Image Databases. IEEE Trans. Multimedia 4(2), 235–247 (2002)
Blum, Langley, P.: Selection of Relevant Features and Examples in Machine Learning. Artificial Intelligence (1997)
Chaudhuri, S., Narasayya, V.R.: An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. VLDB J., 146–155 (1997)
Kai-Uwe, S., Schallehn, E., Geist, I.: Autonomous Query- Driven Index Tuning. In: Fourth Int’l Database Eng. And Applications Symp., IDEAS 2004 (2004)
Costa, R.L.D.C., Lifschitz, S.: Index Self-Tuning with Agent- Based Databases. In: Proc. 28th Latin-Am. Conf. Informatics, CLEI 2002 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Rajesh, S., Jilla, K., Rajiv, K., Prasad, T.V.K.P. (2014). Effect of Indexing on High-Dimensional Databases Using Query Workloads. In: Satapathy, S., Avadhani, P., Udgata, S., Lakshminarayana, S. (eds) ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol II. Advances in Intelligent Systems and Computing, vol 249. Springer, Cham. https://doi.org/10.1007/978-3-319-03095-1_72
Download citation
DOI: https://doi.org/10.1007/978-3-319-03095-1_72
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03094-4
Online ISBN: 978-3-319-03095-1
eBook Packages: EngineeringEngineering (R0)