FB + -tree for Big Data Management

Bayer, 2002, 245 Garcia-Molina, 2008 Yu, 2001, Indexing the distance: an efficient method to KNN processing, 421 Ooi, 2000, Indexing the edges — a simple and yet efficient approach to high dimensional indexing, 166 Yu, 2010, High-dimensional kNN joins with incremental updates, GeoInformatica, 14, 55, 10.1007/s10707-009-0076-5 Yu, 2010, Enhancing the B+-tree by dynamic node popularity caching, Inf. Process. Lett., 110, 268, 10.1016/j.ipl.2010.01.008 Deschler, 2001, B+ retake: sustaining high volume inserts into large data pages, 56 Hankins, 2003, Effect of node size on the performance of cache-conscious B+-trees, SIGMETRICS Perform. Eval. Rev., 31, 283, 10.1145/885651.781063 Lehman, 1986, A study of index structures for main memory database management systems, 294 Rao, 2000, Making B+-trees cache conscious in main memory, SIGMOD Rec., 29, 475, 10.1145/335191.335449 Yu, 2010, Enhancing the B+-tree by dynamic node popularity caching, Inf. Process. Lett., 110, 268, 10.1016/j.ipl.2010.01.008 S. Robbins, RAM is the new disk, InfoQ News, 2008. Ousterhout, 2010, The case for RAMclouds: scalable high-performance storage entirely in DRAM, ACM SIGOPS Oper. Syst. Rev., OSR, 92, 10.1145/1713254.1713276 Lim, 2014, MICA: a holistic approach to fast in-memory key-value storage, 429 Sanfilippo Kazemitabar, 2010, Geospatial stream query processing using Microsoft SQL Server Streaminsight, Proc. VLDB Endow., 3, 1537, 10.14778/1920841.1921032 Chandramouli, 2015, Trill: a highperformance incremental query processor for diverse analytics, Proc. VLDB Endow., 8, 401, 10.14778/2735496.2735503 Shvachko, 2010, The Hadoop distributed file system, 1 Low, 2012, Distributed GraphLab: a framework for machine learning and data mining in the cloud, Proc. VLDB Endow., 5, 716, 10.14778/2212351.2212354 DeWitt, 1984, Implementation techniques for main memory database systems, 1 Hagmann, 1986, A crash recovery scheme for a memory-resident database system, IEEE Trans. Comput., C-35, 839, 10.1109/TC.1986.1676845 Sikka, 2012, Efficient transaction processing in SAP HANA database: the end of a column store myth, 731 Rumble, 2014, Log-structured memory for DRAM-based storage, 1 Loghin, 2015, A performance study of big data on small nodes, Proc. VLDB Endow., 8, 762, 10.14778/2752939.2752945 Sikka, 2013, SAP HANA: the evolution from a modern main-memory data platform to an enterprise application platform, Proc. VLDB Endow., 6, 1184, 10.14778/2536222.2536251 Wu, 2013 Wu, 2009, Distributed online aggregations, Proc. VLDB Endow., 2, 443, 10.14778/1687627.1687678 Yu, 2014, FB+-tree: indexing based on key ranges, 438 Apache Borkar, 2011, Hyracks: a flexible and extensible foundation for data-intensive computing, 1151 Leis, 2014, Exploiting hardware transactional memory in main-memory database, 580 Albutiu, 2012, Massively parallel sortmerge joins in main memory multi-core database systems, Proc. VLDB Endow., 5, 1064, 10.14778/2336664.2336678 Sowell, 2013, An experimental analysis of iterated spatial joins in main memory, Proc. VLDB Endow., 6, 1882, 10.14778/2556549.2556570 Sidlauskas, 2014, Spatial joins in main memory: implementation matters!, Proc. VLDB Endow., 8, 97, 10.14778/2735461.2735470 Roy, 2014, Low-latency handshake join, Proc. VLDB Endow., 7, 709, 10.14778/2732939.2732944 Barber, 2014, Memory-efficient hash joins, Proc. VLDB Endow., 8, 353, 10.14778/2735496.2735499 Blanas, 2013, Memory footprint matters: efficient equijoin algorithms for main memory data processing Hankins, 2003, Effect of node size on the performance of cache-conscious B+-trees, SIGMETRICS Perform. Eval. Rev., 31, 283, 10.1145/885651.781063 Lehman, 1986, Query processing in main memory database management systems, 239 Rao, 1999, Cache conscious indexing for decision-support in main memory, 78 Bohannon, 2001, Main-memory index structures with fixed-size partial keys, SIGMOD Rec., 30, 163, 10.1145/376284.375681