B-trie

Results: 178



#Item
41CCCG 2010, Winnipeg MB, August 9–11, 2010  Towards a Dynamic Data Structure for Efficient Bounded Line Range Search Thuy Thi Thu Le  Bradford G. Nickerson∗

CCCG 2010, Winnipeg MB, August 9–11, 2010 Towards a Dynamic Data Structure for Efficient Bounded Line Range Search Thuy Thi Thu Le Bradford G. Nickerson∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:15
42The VLDB Journal DOIs00778REGULAR PAPER  Trie-join: a trie-based method for efficient string similarity joins

The VLDB Journal DOIs00778REGULAR PAPER Trie-join: a trie-based method for efficient string similarity joins

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2014-11-20 04:14:00
43Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance Shimin Chen, Phillip B. Gibbonsy , Todd C. Mowry, and Gary Valentinx School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213

Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance Shimin Chen, Phillip B. Gibbonsy , Todd C. Mowry, and Gary Valentinx School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213

Add to Reading List

Source URL: www.pdl.cmu.edu

Language: English - Date: 2002-04-19 11:52:33
44G:�informatics�infoissue�414.dvi

G:informaticsinfoissue414.dvi

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-09-26 08:05:02
452368  IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 10, OCTOBER 2014 Bp -Tree: A Predictive B+-Tree for Reducing Writes on Phase Change Memory

2368 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 10, OCTOBER 2014 Bp -Tree: A Predictive B+-Tree for Reducing Writes on Phase Change Memory

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2014-09-19 00:42:19
46A Case Study in Building Layered DHT Applications Paper #318 Abstract Recent research has convincingly demonstrated that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. On

A Case Study in Building Layered DHT Applications Paper #318 Abstract Recent research has convincingly demonstrated that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. On

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2005-09-01 19:45:26
47Cache Craftiness for Fast Multicore Key-Value Storage Yandong Mao, Eddie Kohler† , Robert Morris MIT CSAIL, † Harvard University Abstract We present Masstree, a fast key-value database designed for

Cache Craftiness for Fast Multicore Key-Value Storage Yandong Mao, Eddie Kohler† , Robert Morris MIT CSAIL, † Harvard University Abstract We present Masstree, a fast key-value database designed for

Add to Reading List

Source URL: pdos.csail.mit.edu

Language: English - Date: 2015-04-29 10:31:18
48Computational Experience with a Software Framework for Parallel Integer Programming Y. Xu∗ T. K. Ralphs†

Computational Experience with a Software Framework for Parallel Integer Programming Y. Xu∗ T. K. Ralphs†

Add to Reading List

Source URL: coral.ie.lehigh.edu

Language: English - Date: 2010-06-19 14:25:53
49

PDF Document

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-09-26 07:53:23
50bw-tree-icde2013-camera-ready.dvi

bw-tree-icde2013-camera-ready.dvi

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2013-01-20 16:49:28