Problem Definition I/O-efficient Rectangular Segment Search Gautam K. Das and Bradford G. Nickerson Faculty of Computer science, University of New Brunswick,

Slides:



Advertisements
Similar presentations
1 Computational Geometry Chapter Range queries How do you efficiently find points that are inside of a rectangle? –Orthogonal range query ([x 1,
Advertisements

INTERVAL TREE & SEGMENTATION TREE
I/O-Algorithms Lars Arge Fall 2014 September 25, 2014.
1 Closest Points A famous algorithmic problem... Given a set of points in the plane (cities in the U.S., transistors on a circuit board, computers on a.
External Memory Geometric Data Structures
. Computing Contour Maps & Answering Contour Queries Pankaj K. Agarwal Joint work with Lars Arge ThomasMolhave Thomas Molhave Bardia Sadri.
Query Processing in Databases Dr. M. Gavrilova.  Introduction  I/O algorithms for large databases  Complex geometric operations in graphical querying.
Orthogonal Range Searching Computational Geometry, WS 2006/07 Lecture 13 – Part II Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für.
Spatial Indexing I Point Access Methods. PAMs Point Access Methods Multidimensional Hashing: Grid File Exponential growth of the directory Hierarchical.
I/O-Algorithms Lars Arge University of Aarhus February 21, 2005.
I/O-Algorithms Lars Arge Aarhus University February 27, 2007.
Micha Streppel TU Eindhoven  NCIM-Groep, the Netherlands and Ke Yi AT&T Labs, USA  HKUST, Hong Kong.
Lecture 12 : Special Case of Hidden-Line-Elimination Computational Geometry Prof. Dr. Th. Ottmann 1 Special Cases of the Hidden Line Elimination Problem.
Optimal Planar Point Enclosure Indexing Lars Arge, Vasilis Samoladas and Ke Yi Department of Computer Science Duke University Technical University of Crete.
I/O-Algorithms Lars Arge Aarhus University February 13, 2007.
I/O-Algorithms Lars Arge Aarhus University March 16, 2006.
Lecture 5: Orthogonal Range Searching Computational Geometry Prof. Dr. Th. Ottmann 1 Orthogonal Range Searching 1.Linear Range Search : 1-dim Range Trees.
I/O-Algorithms Lars Arge Spring 2009 February 2, 2009.
Special Cases of the Hidden Line Elimination Problem Computational Geometry, WS 2007/08 Lecture 16 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen,
I/O-Algorithms Lars Arge Aarhus University February 16, 2006.
I/O-Algorithms Lars Arge Aarhus University February 7, 2005.
I/O-Algorithms Lars Arge University of Aarhus February 13, 2005.
I/O-Algorithms Lars Arge Spring 2009 April 28, 2009.
I/O-Algorithms Lars Arge University of Aarhus March 1, 2005.
I/O-Algorithms Lars Arge Spring 2009 March 3, 2009.
I/O-Algorithms Lars Arge Aarhus University February 6, 2007.
Lars Arge1, Mark de Berg2, Herman Haverkort3 and Ke Yi1
I/O-Algorithms Lars Arge Aarhus University March 5, 2008.
I/O-Efficient Structures for Orthogonal Range Max and Stabbing Max Queries Second Year Project Presentation Ke Yi Advisor: Lars Arge Committee: Pankaj.
I/O-Algorithms Lars Arge Aarhus University February 9, 2006.
I/O-Algorithms Lars Arge Aarhus University March 9, 2006.
I/O-Algorithms Lars Arge Aarhus University February 14, 2008.
Hidden-Line Elimination Computational Geometry, WS 2006/07 Lecture 14 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
I/O-Algorithms Lars Arge Aarhus University March 6, 2007.
I/O-Algorithms Lars Arge University of Aarhus March 7, 2005.
1 Geometric index structures April 15, 2004 Based on GUW Chapter , [Arge01] Sections 1, 2.1 (persistent B- trees), 3-4 (static versions.
Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.
Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.
Orthogonal Line Segment Intersection Given N horizontal and N vertical line segments, find all intersections. All x and y coordinates are distinct.
Orthogonal Range Searching I Range Trees. Range Searching S = set of geometric objects Q = query object Report/Count objects in S that intersect Q Query.
1 Geometric Intersection Determining if there are intersections between graphical objects Finding all intersecting pairs Brute Force Algorithm Plane Sweep.
External Memory Algorithms for Geometric Problems Piotr Indyk (slides partially by Lars Arge and Jeff Vitter)
B-trees and kd-trees Piotr Indyk (slides partially by Lars Arge from Duke U)
Bin Yao Spring 2014 (Slides were made available by Feifei Li) Advanced Topics in Data Management.
Lars Arge Presented by Or Ozery. I/O Model Previously defined: N = # of elements in input M = # of elements that fit into memory B = # of elements per.
2IL50 Data Structures Fall 2015 Lecture 9: Range Searching.
Lecture 2: External Memory Indexing Structures CS6931 Database Seminar.
Bin Yao (Slides made available by Feifei Li) R-tree: Indexing Structure for Data in Multi- dimensional Space.
External Memory Geometric Data Structures Lars Arge Duke University June 27, 2002 Summer School on Massive Datasets.
ProblemData StructuresLower Bound Preprocess a set of N 3-dimensional points into an I/O-efficient data structure, such that all points inside an axis.
Internal Memory Pointer MachineRandom Access MachineStatic Setting Data resides in records (nodes) that can be accessed via pointers (links). The priority.
UNC Chapel Hill M. C. Lin Geometric Data Structures Reading: Chapter 10 of the Textbook Driving Applications –Windowing Queries Related Application –Query.
Michal Balas1 I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University.
Geometric Data Structures
CMPS 3130/6130 Computational Geometry Spring 2017
Spatial Indexing I Point Access Methods.
Query Processing in Databases Dr. M. Gavrilova
KD Tree A binary search tree where every node is a
Lesson 2.8 The Coordinate Plane
Advanced Topics in Data Management
Orthogonal Range Searching and Kd-Trees
STACS arxiv.org/abs/ y 3-sided x1 x2 x1 x2 top-k
Reporting (1-D) Given a set of points S on the line, preprocess them to build structure that allows efficient queries of the from: Given an interval I=[x1,x2]
Graphing on the Coordinate Plane
8th Workshop on Massive Data Algorithms, August 23, 2016
Plotting Points Guided Notes
Graphing on the Coordinate Plane
Boaz BenMoshe Matthew Katz Joseph Mitchell
CMPS 3130/6130 Computational Geometry Spring 2017
The COORDINATE PLANE The COORDINATE PLANE is a plane that is divided into four regions (called quadrants) by a horizontal line called the x-axis and a.
Presentation transcript:

Problem Definition I/O-efficient Rectangular Segment Search Gautam K. Das and Bradford G. Nickerson Faculty of Computer science, University of New Brunswick, Fredericton, New Brunswick, Canada Restricted Segment search Sponsored by: Entirely Within Rectangular Segment Search Construct a data structure to store given a set S of line segments in 2D such that an axis aligned rectangular segment query Q can be performed efficiently Output: 1, 3, 5, 6 -All the line segments in S are horizontal 12 -Step 1: report all the line segments having at least one end point inside query rectangle (output: 3, 7, 8) Space - disk blocks Query I/Os - A (1,1,2) search (or Q(3,1) search) The line segment [p, q] X = (a,c,b). The segment query is a 3D (1,1,2) point search. Complexities of (1,1,2) search same as Step 1 [2] Restricted case overalls complexities Space -disk blocks,Query I/Os- General Segment search Step 1:Same as restricted case Step 2: Vertical segment query Space - O(N/B) disk blocks (N= # updates) Update time - O(log B N) Query I/Os - O(log B N + K/B) Elements are totally ordered No “above-below” relations among -segments 1 and 2, segments 3 and Definition: A segment s is said to be below the segment t (s  t) if  = Segments set induced by the end points of S and intersection points among them Plane sweep from left to right and when end point encountered If end point is start point of the segment - insert the segment in the B-tree, else delete the segment from the B-tree Persistent B-tree: Space - O((N+ )/B ) disk blocks ( As # of update = O(N+ )) Query I/Os - O(log B N + K/B) Complexities: Output: h S = set of horizontal line segments in 2D Query object = axis aligned rectangle each segment intersecting the query is entirely within the search rectangle Entirely within rectangular search is a 3D (1,1,2) point search Horizontal line (p,q) (a,c,b) {(x,y,z)|   x, y  ,   z   } Complexities of entirely within rectangular search Space -disk blocks Query I/Os - Open problems: Reduce the complexity of the above problems Consider the problems in higher dimensions Triangular segment search problem Conclusion |  | = O(N + ) where = # intersections among the segments in S q(c,b) p(a,b) r(e,f) s(e,g) Complexities:[1] Step 2: Report all the segments which intersect at least one boundary of query rectangle Persistent B-tree s t l t s t l Overall for general segment search: Space - disk blocks Query I/Os - O(log B N + K/B) q(c,b) p(a,b) ( ,  ) (,)(,) ( ,  )( ,  ) Rectangle ABCD Region R = Complexities of (1,1,2) search [2] Space -disk blocks Query I/Os - References: [1] L. Arge, “External memory data structures”, Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, M. C. G. Resende(eds.), pp , Kluwer Academic Publishers, Dordrecht, [2] P. Afshani, L. Arge and K.D. Larsen, “Orthogonal range reporting in three and higher dimensions, FOCS, pp , a2a2 s l1l1 l2l2 l3l3 a1a1 l4l4 a3a3