• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

R-trees: A Dynamic Index Structure for Spatial Searching (1984)

Cached

  • Download as a PDF

Download Links

  • [www.cs.fiu.edu]
  • [idke.ruc.edu.cn]
  • [idke.ruc.edu.cn]
  • [www.cs.ucr.edu]
  • [dis.unal.edu.co]
  • [www.sai.msu.su]
  • [www.cis.temple.edu]
  • [www.cs.jhu.edu]
  • [www.cs.bu.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.princeton.edu]
  • [www.cs.ucr.edu]
  • [www.cs.wisc.edu]
  • [www.ics.uci.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.cs.wisc.edu]
  • [www.csee.umbc.edu]
  • [www.cs.wisc.edu]
  • [www.cs.ucr.edu]
  • [www.cs.ucr.edu]
  • [www.cs.cmu.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.duke.edu]
  • [pages.cs.wisc.edu]
  • [people.csail.mit.edu]
  • [www-db.deis.unibo.it]
  • [www.cs.ucr.edu]
  • [www.cs.umd.edu]
  • [pages.cs.wisc.edu]
  • [dsl.serc.iisc.ernet.in]
  • [knight.cis.temple.edu]
  • [www.cs.ucr.edu]
  • [www.cs.jhu.edu]
  • [www.sai.msu.su]
  • [cis-linux1.temple.edu]
  • [people.ok.ubc.ca]
  • [pages.cs.wisc.edu]
  • [www.cs.ucr.edu]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Antonin Guttman
Venue:INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
Citations:2750 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Guttman84r-trees:a,
    author = {Antonin Guttman},
    title = {R-trees: A Dynamic Index Structure for Spatial Searching},
    booktitle = {INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA},
    year = {1984},
    pages = {47--57},
    publisher = {ACM}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data objects of non-zero size located m multi-dimensional spaces In this paper we describe a dynamic index structure called an R-tree which meets this need, and give algorithms for searching and updating it. We present the results of a series of tests which indicate that the structure performs well, and conclude that it is useful for current database systems in spatial applications.

Keyphrases

dynamic index structure    spatial searching    spatial data    geo-data application    data object    traditional indexing method    database system    current database system    index mechanism    data item    spatial application    multi-dimensional space    spatial location    non-zero size   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University