This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: • 6.851: Advanced Data Structures Spring 2010 Lecture 11 — Mar 11, 2010 Prof. Erik Demaine 1 Overview In the last lecture we covered static fusion tree. A data structure storering n wbit integers that supports predecessor and successor queries in O (log n ) time with O ( n ) space. w In this lecture we discuss lower bounds on the cellprobe complexity of the static predecessor problem with constrained space. In particular, we use round elimination technique to prove the preprocessor lower bound in communication model and that the min of van Emde Boas trees and fusion trees is an optimal static predecessor data structure up to loglog factors. 2 Predecessor lower bound results 2.1 The problem Given a set of n wbit integers, the goal is to eﬃciently find predecessor of element x . Observe that having O (2 w ) space one can precompute and store all the results to achieve constant query time, we assume O ( n O (1) ) space for our data structures. The results we are about to discuss are actually for an easier problem: colored predecessor. Each element is colored red or blue. Given query on element x , the goal is to return the color of x ’s predecessor. Since we can solve colored predecessor problem using predecessor, gives a stronger lower bound for our original problem. 2.2 Results • AjtaiCombinatorica 1988[1] –Proved the first superconstant bound, O ( w ); claimed that ∀ w, ∃ n that gives Ω( √ lg w ) query time. MiltersenSTOC 1994[2] –Rephrased the same proof ideas in terms of communication com • plexity: ∀ w , ∃ n that gives Ω( √ lg w ) query time; ∀ n , ∃ w that gives Ω( 3 √ lg n ) query time. Miltersen,Nisan,Safra,WigdersonSTOC 1995[3] & JCSS 1998[4] –Introduced round elimina • tion technique and used it to give a clean proof of the same lower bound. Beame,FichSTOC 1999[5] & JCSS2002[6] & manusccript 1994 –Proved two strong bounds: ∀ w, ∃ n that gives Ω( lg w ) query time; ∀ n, ∃ w that gives Ω( lg n ) query time. Also gave a static lg lg w lg lg n data structure achieving O (min { lg w , lg n ) } , which shows that these bounds are optimal lg lg w lg lg n if we insist on pure bound in n & w . 1 • Xiao Ph.D. thesis 1992 at U.C. San Diego[7] –Independently proved the same lower bound earlier of Beame and Fich. • Sen CCC 2003[8]; Sen,VenkateshJCSS2008[9] –Gave a stronger version of the round elim ination lemma that we about to introduce in this lecture, which gives a cleaner proof of the same bounds....
View
Full
Document
This note was uploaded on 03/31/2011 for the course EECS 6.851 taught by Professor Erikdemaine during the Spring '10 term at MIT.
 Spring '10
 ErikDemaine
 Data Structures

Click to edit the document details