Back to Results
First PageMeta Content
Information science / Artificial intelligence / Hash table / Hash function / Linear probing / Cuckoo hashing / Double hashing / Perfect hash function / Quadratic probing / Search algorithms / Hashing / Information retrieval


Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen, Denmark
Add to Reading List

Document Date: 2010-04-07 23:39:13

Open Document

File Size: 196,59 KB

Share Result on Facebook

City

Indianapolis / Reading / /

Company

Cambridge University Press / Database Systems / Cambridge Univ Press / Ge / /

Country

United States / Denmark / /

Currency

USD / /

/

Facility

Zhewei Wei Ke Yi Qin Zhang Hong Kong University of Science / Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen / /

IndustryTerm

blocked probing algorithm / obtainable search cost / worst-case search costs / search cost / unsuccessful search / expected average success search cost / cache-oblivious algorithms / above solution / search using linear probing / unsuccessful search takes / expected average search cost / expected search cost / search algorithm / average search cost / /

Organization

Danish National Research Foundation / Cambridge University / University of Science and Technology Clear Water Bay / Hong Kong / United Nations / Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen / Hong Kong University of Science and Technology / EEF Summer School on Massive Datasets / /

Person

Wei Ke Yi Qin Zhang / Zhewei Wei / Qin Zhang / Now / Ke Yi / Next / /

Position

boundary-oblivious model / block-size-oblivious model / /

ProvinceOrState

Indiana / Massachusetts / /

PublishedMedium

Journal of the ACM / Communications of the ACM / Theory of Computing / /

Technology

theory Keywords Cache-oblivious algorithms / Nonnumerical algorithms / search algorithm / Relational Database / 3.1 Algorithm / cache-oblivious algorithms / blocked probing algorithm / /

SocialTag