See this document in CiteSeerX!

Lower Bounds for External Memory Dictionaries  (Make Corrections)  
Gerth Stølting Brodal, Rolf Fagerberg



  Home/Search   Context   Related

 
View or download:
brics.dk/~gerth/Papers/soda03.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  brics.dk/~gerth/pub5 (more)
Homepages:  G.Brodal  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We study trade-offs between the update time and the query time for comparison based external memory dictionaries. The main contributions of this paper are two lower bound trade-offs between the I/O complexity of member queries and insertions: If N > M insertions delta N/B I/Os, then (1) there exists a query requiring N/(M ) O(#) ) I/Os, and (2) there exists a query requiring N M ) I/Os when # is O(B/ N) and N is at least M . For both lower bounds we describe data structures which give matching... (Update)

Active bibliography (related documents):   More   All
0.6:   The Complexity of Constructing Evolutionary Trees.. - Brodal, Fagerberg.. (2001)   (Correct)
0.3:   Performance Engineering Case Study: Heap Construction - Bojesen, Katajainen, Spork (1999)   (Correct)
0.3:   Project 2 | External Memory Libraries - The Goal Of   (Correct)

Similar documents based on text:   More   All
0.3:   Cache Oblivious Distribution Sweeping - Brodal, Fagerberg (2002)   (Correct)
0.3:   Funnel Heap - A Cache Oblivious Priority Queue - Brodal, Fagerberg (2002)   (Correct)
0.3:   Dynamic Planar Convex Hull - Brodal, Jacob (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ brodal-lower,
  author = "Gerth St\olting Brodal and Rolf Fagerberg",
  title = "Lower Bounds for External Memory Dictionaries",
  url = "citeseer.ist.psu.edu/622616.html" }
Citations (may not include all citations):
198   Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
174   Time bounds for selection (context) - Blum, Floyd et al. - 1973
109   inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
67   A data structuring technique (context) - Chazelle, Guibas - 1986
59   External memory algorithms and data structures: Dealing with.. - Vitter - 2001
53   Volume III: Sorting and Searching (context) - Knuth, of - 1998
33   External memory data structures - Arge - 2001
30   On twodimensional indexability and optimal range search inde.. - Arge, Samoladas et al. - 1999
25   Fractional cascading: II (context) - Chazelle, Guibas - 1986
14   On showing lower bounds for external-memory computational ge.. - Arge, Miltersen - 1999
14   A general lower bound on the I/O-complexity of comparison-ba.. - Arge, Knudsen et al. - 1993
13   er tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
7   A lower bound theorem for indexing schemes and its applicati.. - Samoladas, Miranker - 1998
3   cient searching using partial ordering (context) - Borodin, Guibas et al. - 1981
3   External selection - Sibeyn - 1999
3   Selected Papers of the 5th Scandinavian Workshop on Algorith.. (context) - Brodal, Chaudhuri et al. - 1996
1   On Indexing Large Databases for Advanced Data Models - Samoladas - 2001
1   space trade-o#s (context) - Arge, Pagter et al. - 2000

Documents on the same site (http://www.brics.dk/~gerth/pub5.html):   More
I/O-Efficient Dynamic Point Location in Monotone.. - Agarwal, Arge..   (Correct)
Improved Bounds for Dictionary Look-up with One Error - Brodal, Venkatesh (1999)   (Correct)
Finding Maximal Quasiperiodicities in Strings - Brodal, Pedersen (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC