Toward spatial joins for polygons

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Proceedings. 12th International Conference on Scientific and Statistica Database Management

• Publication date

  2000-07-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SSDM.2000.869791
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Extending Rectangle Join Algorithms for Rectilinear Polygons

  2000cited by this paper
• On two-dimensional indexability and optimal range search indexing

  1999influential reference
• Geographic Information Systems: An Introduction

  1999cited by this paper
• An index structure for spatial joins in linear constraint databases

  1999cited by this paper
• Constraint Databases

  1999cited by this paper
• A Raster Approximation For Processing of Spatial Joins

  1998cited by this paper
• A Raster Approximation For Processing of Spatial Joins

  1998cited by this paper
• Scalable Sweeping-Based Spatial Join

  1998cited by this paper
• Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations

  1997cited by this paper
• Parallel processing of spatial joins using R-trees

  1996cited by this paper
• Spatial hash-joins

  1996cited by this paper
• Partition based spatial-merge join

  1996cited by this paper
• Filter Trees for Managing Spatial Data over a Range of Size Granularities

  1996cited by this paper
• An optimal algorithm for finding segments intersections

  1995influential reference
• The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

  1995cited by this paper
• Multi-step processing of spatial joins

  1994cited by this paper
• Efficient processing of spatial joins using R-trees

  1993cited by this paper
• Efficient computation of spatial joins

  1993cited by this paper
• A new algorithm for computing joins with grid files

  1993cited by this paper
• Counting and Reporting Red/Blue Segment Intersections

  1993influential reference
• Fundamentals of spatial information systems

  1992cited by this paper
• Spatial join indices

  1991cited by this paper
• Redundancy in spatial databases

  1989cited by this paper
• Applications of random sampling in computational geometry, II

  1988influential reference
• An optimal algorithm for intersecting line segments in the plane

  1988influential reference
• PROBE Spatial Data Modeling and Query Processing in an Image Database Application

  1988cited by this paper
• A fast planar partition algorithm. I

  1988influential reference
• Reporting and Counting Intersections Between Two Sets of Line Segments

  1988influential reference
• Spatial query processing in an object-oriented database system

  1986influential reference
• Algorithms for Reporting and Counting Geometric Intersections

  1979influential reference
• Geometric intersection problems

  1976cited by this paper

• Representing and processing polygonal maps with Sector Lists

  2023cites this paper
• Portable High-Performance Indexing for Vector Product Format Spatial Databases

  2012cites this paper
• Spatial join techniques

  2007influential citation
• Filtering with raster signatures

  2006cites this paper
• Estimating the Overlapping Area of Polygon Join

  2005cites this paper
• WSDAF : A Dynamically Adaptive Framework for Scalable Web Services

  2004cites this paper
• Trajectory queries and octagons in moving object databases

  2002cites this paper
• On Multi-way Spatial Joins with Direction Predicates

  2001cites this paper
• Experimental evaluation of filter effectiveness (extended abstract)

  2000cites this paper