[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/BenderDF00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Erik_D._Demaine>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Martin_Farach-Colton>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Michael_A._Bender>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892128>
foaf:homepage <https://doi.org/10.1109/SFCS.2000.892128>
dc:identifier DBLP conf/focs/BenderDF00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.2000.892128 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label Cache-Oblivious B-Trees. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Erik_D._Demaine>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Martin_Farach-Colton>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Michael_A._Bender>
swrc:pages 399-409 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/BenderDF00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/BenderDF00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs2000.html#BenderDF00>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.2000.892128>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject tree data structures; tree searching; cache storage; computational complexity; cache-oblivious B-trees; dynamic search-tree data structures; hierarchical memory; memory hierarchy; optimal search bound; insertions; deletions; amortized memory transfers; worst-case bounds (xsd:string)
dc:title Cache-Oblivious B-Trees. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document