Skip to main content
SpringerLink
Log in

Heidi Visualization of R-tree Structures over High Dimensional Data

  • Conference paper
Scientific and Statistical Database Management (SSDBM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6809))

  • 1529 Accesses

Abstract

High dimensional index structures are used to efficiently answer range queries in large databases. Visualization of such index structures helps in: (a) visualization of the data set in a hierarchical format of the index structure, (b) “explorative querying” on the data set, similar to explorative browsing on the web, (c) index structure diagnostics: visualizing the structure along with its performance statistics enables the user to make changes to structure for better performance. To the best of our knowledge, there is no such visualization for high dimensional index structures.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD 1990, pp. 322–331. ACM Press, New York (1990)

    Google Scholar 

  2. Gimnez, A., Rosenbaum, R., Hlawitschka, M., Hamann, B.: Using r-trees for interactive visualization of large multidimensional datasets. In: Proceedings of the 6th International Symposium on Visual Computing (November 2010)

    Google Scholar 

  3. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD 1984, pp. 47–57. ACM Press, New York (1984)

    Google Scholar 

  4. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)

    Google Scholar 

  5. Vadapalli, S., Karlapalem, K.: Heidi matrix: Nearest neighbor driven high dimensional data visualization. In: VAKD, SIGKDD (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Institute of Information Technology, Hyderabad, India

    Shraddha Agrawal, Soujanya Vadapalli & Kamalakar Karlapalem

Authors
  1. Shraddha Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Soujanya Vadapalli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kamalakar Karlapalem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Evergreen State College, 98505, Olympia, WA, USA

    Judith Bayard Cushing

  2. CNRI and University of Virginia, 22908, Charlottesville, VA, USA

    James French

  3. Gonzaga University, 99258, Spokane, WA, USA

    Shawn Bowers

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agrawal, S., Vadapalli, S., Karlapalem, K. (2011). Heidi Visualization of R-tree Structures over High Dimensional Data. In: Bayard Cushing, J., French, J., Bowers, S. (eds) Scientific and Statistical Database Management. SSDBM 2011. Lecture Notes in Computer Science, vol 6809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22351-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22351-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22350-1

  • Online ISBN: 978-3-642-22351-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation