• DocumentCode
    2034754
  • Title

    Data-Parallel R-Tree Algorithms

  • Author

    Hoel, Erik G. ; Samet, Banan

  • Author_Institution
    Bureau of the Census, USA
  • Volume
    3
  • fYear
    1993
  • fDate
    16-20 Aug. 1993
  • Firstpage
    47
  • Lastpage
    50
  • Abstract
    Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data (e.g., Bureau of the Census TIGER/Line files). Parallel algorithms for both building the data-parallel R-tree, as well as determining the closed polygons formed by the line segments, are described and implemented using the SAM (Scan-And-Monotonic-mapping) model of parallel computation on the hypercube architecture of the Connection Machine.
  • Keywords
    Automation; Buildings; Computer science; Concurrent computing; Data structures; Educational institutions; Geography; Hypercubes; Parallel processing; Shape;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1993. ICPP 1993. International Conference on
  • Conference_Location
    Syracuse, NY, USA
  • ISSN
    0190-3918
  • Print_ISBN
    0-8493-8983-6
  • Type

    conf

  • DOI
    10.1109/ICPP.1993.65
  • Filename
    4134244
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2034754