citations.bib

% volume = {12},
% issue = {4},
%address = {Riverton, NJ, USA},
%publisher = {IBM Corp.},
@article{Wagner73,
 author = {R. E. Wagner},
 title = {Indexing design considerations},
 journal = {IBM Systems Journal},
month = {December},
 year = {1973},
 issn = {0018-8670},
 pages = {351--367},
 numpages = {17},
 url = {http://dx.doi.org/10.1147/sj.124.0351},
 doi = {http://dx.doi.org/10.1147/sj.124.0351},
 acmid = {1661078}
 
} 

@ARTICLE{Comer79,
    author = {Douglas Comer},
    title = {The ubiquitous B-tree},
    journal = {ACM Computing Surveys},
    year = {1979},
    volume = {11},
    pages = {121--137}
}

@misc{ClarkSaSt69,
	author={W. A. Clark and K. A. Salmond and T. A. Stafford},
	title={Method and means for generating compressed keys},
	year={1969},
	month={January},
	howpublished={US Patent 3,593,309, 3 }}


%address = {New York, NY, USA},
% volume = {2},
% issue = {1},
%publisher = {ACM},
@article{BayerUn77,
 author = {Rudolf Bayer and Karl Unterauerl},
 title = {Prefix B-trees},
 journal = {ACM Transactions on Database Systems},
 month = {March},
 year = {1977},
 issn = {0362-5915},
 pages = {11--26},
 numpages = {16},
 url = {http://doi.acm.org/10.1145/320521.320530},
 doi = {http://doi.acm.org/10.1145/320521.320530},
 acmid = {320530},


 keywords = {B-trees, key compression, multiway search trees},
} 


@article{Ferragina98,
    author = {Paolo Ferragina and Roberto Grossi},
    title = {The String B-Tree: A New Data Structure for String Search in External Memory and its Applications.},
    journal = {Journal of the ACM},
    year = {1998},
    volume = {46},
    pages = {236--280}
}

@misc{BerkeleyDB,
	Author = {\url{http://www.oracle.com}},
	Title = {The Berkeley Database},
	Year = {2005}}


%Address = {San Diego, CA, USA},
@inproceedings{BenderFaFi07,

	Author = {Michael A. Bender and Martin Farach-Colton and Jeremy T. Fineman and Yonatan Fogel and Bradley Kuszmaul and Jelani Nelson},
	Booktitle = {Proceedings of the Nineteenth ACM Symposium on Parallelism in Algorithms and Architectures},
	Month = {June},
	Pages = {81--92},
	Title = {Cache-Oblivious Streaming B-trees},
	Year = {2007}}

%	Address = {Chicago, IL},
@inproceedings{BenderFaKu06,
	Author = {Michael A. Bender and Martin Farach-Colton and Bradley C. Kuszmaul},
	Booktitle = {Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems},
	Month = jun,
	Pages = {223--242},
	Title = {Cache-Oblivious String {B}-Trees},
	Year = {2006}}

% 	Address = {Las Vegas, NV, USA},
@inproceedings{BenderFiGi05,
	Author = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Bradley C. Kuszmaul},
	Booktitle = {Proceedings of the Seventeenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
	Month = {July},
	Pages = {228--237},
	Title = {Concurrent Cache-Oblivious B-Trees},
	Year = {2005}}

@article{BayerS77,
	Author = {Rudolf Bayer and Mario Schkolnick},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Ee = {http://dx.doi.org/10.1007/BF00263762},
	Journal = {Acta Informatica},
	Pages = {1-21},
	Title = {Concurrency of Operations on B-Trees},
	Volume = {9},
	Year = {1977}}

%  volume    = {1},
@article{BayerM72,
  author    = {Rudolf Bayer and
               Edward M. McCreight},
  title     = {Organization and Maintenance of Large Ordered Indices},
  journal   = {Acta Informatica},
  year      = {1972},
  pages     = {173-189},
  ee        = {http://dx.doi.org/10.1007/BF00288683},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

%	Number = {4},
%	Volume = {6},
@article{LehmanY81,
	Author = {Philip L. Lehman and S. Bing Yao},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Ee = {http://doi.acm.org/10.1145/319628.319663, db/journals/tods/LehmanY81.html},
	Journal = {ACM Trans. Database Syst.},
	Pages = {650-670},
	Title = {Efficient Locking for Concurrent Operations on B-Trees},
	Year = {1981}}

%Address = {London, UK, UK},
@inproceedings{Bender2002,
	Acmid = {684398},
	Author = {Bender, Michael A. and Cole, Richard and Raman, Rajeev},
	Booktitle = {Proceedings of the 29th International Colloquium on Automata, Languages and Programming},
	Isbn = {3-540-43864-5},
	Numpages = {13},
	Pages = {195--207},
	Publisher = {Springer-Verlag},
	Series = {ICALP '02},
	Title = {Exponential Structures for Efficient Cache-Oblivious Algorithms},
	Url = {http://dl.acm.org/citation.cfm?id=646255.684398},
	Year = {2002},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=646255.684398}}

@mastersthesis{Katriel02,
	Author = {Irit Katriel},
	School = {Technion - Israel Institute of Technology},
	Title = {Implicit Data Structures based on Local Reorganizations},
	Year = {2002}}

%	Volume = {1},
%	Number = {4},
@article{BentleySaxe,
	Author = {Jon Louis Bentley and James B Saxe},
	Doi = {10.1016/0196-6774(80)90015-2},
	Issn = {0196-6774},
	Journal = {Journal of Algorithms},
	Pages = {301 - 358},
	Title = {Decomposable searching problems {I}. Static-to-dynamic transformation},
	Url = {http://www.sciencedirect.com/science/article/pii/0196677480900152},

	Year = {1980},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0196677480900152},
	Bdsk-Url-2 = {http://dx.doi.org/10.1016/0196-6774(80)90015-2}}


%	Volume = {31},
%	Issue = {9},
%Address = {New York, NY, USA},
@article{Aggarwal,
	Acmid = {48535},	
	Author = {Aggarwal, Alok and Vitter, Jeffrey,S.},
	Doi = {http://doi.acm.org/10.1145/48529.48535},
	Issn = {0001-0782},
	Journal = {Communications of the ACM},
	Month = {September},
	Numpages = {12},
	Pages = {1116--1127},
	Publisher = {ACM},
	Title = {The input/output complexity of sorting and related problems},
	Url = {http://doi.acm.org/10.1145/48529.48535},
	Year = {1988},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/48529.48535}}

@inproceedings{BenderDemainColton,
	Author = {Michael A. Bender and Erik D. Demaine and Martin Farach-Colton},
	Booktitle = {Proceedings of the 41st Annual Symposium on Foundations of Computer Science},
	Pages = {399-409},
	Title = {Cache-Oblivious B-Trees},
	Year = {2000}}

@inproceedings{veb1,
	Author = {van Emde Boas, P.},
	Booktitle = {16th Annual Symposium on Foundations of Computer Science},
	Doi = {10.1109/SFCS.1975.26},
	Issn = {0272-5428},
	Month = {October},
	Pages = {75 -84},
	Title = {Preserving order in a forest in less than logarithmic time},
	Year = {1975},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/SFCS.1975.26}}

%	Issue = {1},
%	Volume = {10},
%	Note = {10.1007/BF01683268},
%Publisher = {Springer New York},
@article{veb2,
	Affiliation = {Mathematical Centre 2e Boerhaavestraat 49 Amsterdam Netherlands},
	Author = {van Emde Boas, P. and Kaas, R. and Zijlstra, E.},
	Issn = {1432-4350},
	Journal = {Theory of Computing Systems},
	Keyword = {Computer Science},
	Pages = {99-127},	
	Title = {Design and implementation of an efficient priority queue},
	Url = {http://dx.doi.org/10.1007/BF01683268},

	Year = {1976},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF01683268}}

@inproceedings{swbst,
	Author = {Lars Arge and Jeffrey Scott Vitter},
	Booktitle = {Proceedings of the IEEE Symposium on Foundations Of Computer Science},
	Pages = {560--569},
	Title = {Optimal Dynamic Interval Management in External Memory (Extended Abstract))},
	Year = {1996}}


%	Volume = {115},

@incollection{packedmemoryarray,
	Author = {Itai, Alon and Konheim, Alan and Rodeh, Michael},
	Booktitle = {Automata, Languages and Programming},
	Publisher = {Springer Berlin / Heidelberg},
	Editor = {Even, Shimon and Kariv, Oded},
	Keyword = {Computer Science},
	Pages = {417-431},
	Series = {Lecture Notes in Computer Science},
	Title = {A sparse table implementation of priority queues},
	Year = {1981}}

% volume = {33},
% issue = {4},
%address = {Secaucus, NJ, USA},
% publisher = {Springer-Verlag New York, Inc.},

@article{ONeil96,
 author = {O'Neil, Patrick and Cheng, Edward and Gawlick, Dieter and O'Neil, Elizabeth},
 title = {The log-structured merge-tree {LSM-tree}},
 journal = {Acta Informatica},
 month = {June},
 year = {1996},
 issn = {0001-5903},
 pages = {351--385},
 numpages = {35},
 url = {http://dl.acm.org/citation.cfm?id=230823.230826},
 doi = {10.1007/s002360050048},
 acmid = {230826},

} 


% pages = {285--},
% address = {Washington, DC, USA},
%publisher = {IEEE Computer Society},
@inproceedings{Frigo99,
 author = {Frigo, Matteo and Leiserson, Charles E. and Prokop, Harald and Ramachandran, Sridhar},
 title = {Cache-Oblivious Algorithms},
 booktitle = {Proceedings of the 40th Annual Symposium on Foundations of Computer Science},
 series = {FOCS '99},
 year = {1999},
 isbn = {0-7695-0409-4},
 url = {http://dl.acm.org/citation.cfm?id=795665.796479},
 acmid = {796479},

} 

%publisher = {ACM-SIAM}
@INPROCEEDINGS{Buchsbaum,
    author = {Adam L. Buchsbaum and Michael Goldwasser and Suresh Venkatasubramanian and Jeffery R. Westbrook},
    title = {On External Memory Graph Traversal},
    booktitle = {In Proceedings of ACM-SIAM Symposium On Discrete Algorithms},
    year = {2000},
    pages = {859--860}
}