Please use this identifier to cite or link to this item:
|Title:||Main memory indexing: The case for BD-tree||Authors:||Cui, B.
Main memory databases
|Issue Date:||2004||Citation:||Cui, B.,Ooi, B.C.,Su, J.,Tan, K.-L. (2004). Main memory indexing: The case for BD-tree. IEEE Transactions on Knowledge and Data Engineering 16 (7) : 870-874. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2004.1318568||Abstract:||In this paper, we adapt and optimize the BD-tree for main memory data processing. We compare the memory-based BD-tree against the B +-tree and CSB +-tree. We present cost models for exact match query for these indexes, including L2 cache and translation lookahead buffer (TLB) miss model and execution time model. We also implemented these structures and conducted experimental study. Our analytical and experimental results show that a well-tuned BD-tree is superior in most cases.||Source Title:||IEEE Transactions on Knowledge and Data Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/39041||ISSN:||10414347||DOI:||10.1109/TKDE.2004.1318568|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2019
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.