Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 249))

  • 2560 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldstein, J., Platt, J.C., Burges, C.J.C.: Indexing High Dimensional Rectangles for Fast Multimedia Identification. Technical Report MSR-TR-2003-38 (2003)

    Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. The MIT Press (2001)

    Google Scholar 

  4. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers (2000)

    Google Scholar 

  5. Lawder, J.K., King, P.J.H.: Using Space-filling Curves for Multi-dimensional Indexing (June 2000)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Bingham, E., Mannila, H.: Random projection in dimensionality reduction: Applications for image and text data. In: KDD 2001, San Francisco, CA (2001)

    Google Scholar 

  8. Chakrabarti, K., Mehrotra, S.: Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces. In: VLDB Conference Proceedings (2000)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. 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)

    Article  Google Scholar 

  14. Blum, Langley, P.: Selection of Relevant Features and Examples in Machine Learning. Artificial Intelligence (1997)

    Google Scholar 

  15. Chaudhuri, S., Narasayya, V.R.: An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. VLDB J., 146–155 (1997)

    Google Scholar 

  16. Kai-Uwe, S., Schallehn, E., Geist, I.: Autonomous Query- Driven Index Tuning. In: Fourth Int’l Database Eng. And Applications Symp., IDEAS 2004 (2004)

    Google Scholar 

  17. Costa, R.L.D.C., Lifschitz, S.: Index Self-Tuning with Agent- Based Databases. In: Proc. 28th Latin-Am. Conf. Informatics, CLEI 2002 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics