Filters








436 Hits in 5.9 sec

The adaptive radix tree: ARTful indexing for main-memory databases

V. Leis, Alfons Kemper, T. Neumann
2013 2013 IEEE 29th International Conference on Data Engineering (ICDE)  
To overcome these shortcomings, we present ART, an adaptive radix tree (trie) for efficient indexing in main memory.  ...  Main memory capacities have grown up to a point where most databases fit into RAM. For main-memory database systems, index structure performance is a critical bottleneck.  ...  CONCLUSIONS AND FUTURE WORK We presented the adaptive radix tree (ART), a fast and space-efficient indexing structure for main-memory database system.  ... 
doi:10.1109/icde.2013.6544812 dblp:conf/icde/LeisK013 fatcat:sma67ydio5c5vpuok4axiruanu

High-Performance Tree Indices: Locality matters more than one would think

Thomas Kowalski, Fotios Kounelis, Holger Pirk
2020 International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures  
In this paper, we study the effect of locality on two of the most prominent high-performance index structures: Bw-Trees and Adaptive Radix Trees (ARTs).  ...  In-memory data management systems have become the state-of-the-art, which leads to the development of highlyefficient index structures.  ...  Two of the most prominent main-memory optimized index structures are Adaptive Radix Trees (ARTs) [10] and Bw-Trees [12] .  ... 
dblp:conf/adms/KowalskiKP20 fatcat:rukhvs3pv5dtfavn6dgd4d7wfi

Cracking In-Memory Database Index A Case Study for Adaptive Radix Tree Index [article]

Gang Wu, Yidong Song, Guodong Zhao, Wei Sun, Donghong Han, Baiyou Qiao, Guoren Wang, Ye Yuan
2019 arXiv   pre-print
In order to show the feasibility of in-memory database index cracking and promote to future more extensive research, this paper conducted a case study on the Adaptive Radix Tree (ART), a popular tree index  ...  Therefore, there is an urgent need to reduce the index creation and update cost for in-memory databases.  ...  However, both [16] and [22] indicate that ART outperforms other main-memory optimised search trees such as CSB+-Tree and FAST. Adaptive Radix Tree (ART) index was first proposed in [16] .  ... 
arXiv:1911.11387v1 fatcat:ndnqdytvp5hndp4wm72t7yzl74

The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree [chapter]

Robert Binna, Dominic Pacher, Thomas Meindl, Günther Specht
2015 Lecture Notes in Computer Science  
In this paper, we present the DCB-Tree, an extremely space efficient main-memory index structure for the storage of short fixed-size keys. It features a two-stage cache-line aligned node layout.  ...  Main-memory index structures have become mainstream for a large number of problem domains.  ...  Introduction With the amount of main-memory capacities increasing, many databases can be kept entirely in main-memory. However, this is not the case for all domains.  ... 
doi:10.1007/978-3-319-13960-9_10 fatcat:ygjcbz7hrnealn7frvknv2zqm4

Multi-tenant Main Memory Index Tree with Shared Structure

Lida Zou, Qingzhong Li, Lanju Kong
2016 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
In the paper, the designed structure of main memory index puts the indexes of different tenants on one tree to achieve the effects of saving memory space.  ...  Establishing main memory indexes for each tenant occupies lots of memory space and results in performance bottleneck.  ...  ART is an adaptive radix tree for efficient indexing in main memory and each node in the tree dynamically adjusts its space size according to the number of keys.  ... 
doi:10.12928/telkomnika.v14i2a.4361 fatcat:646e2bgcjvb35ic6ohlv33yohy

OSM-tree: A Sortedness-Aware Index [article]

Aneesh Raman, Subhadeep Sarkar, Matthaios Olma, Manos Athanassoulis
2022 arXiv   pre-print
We apply the proposed design paradigm on a state-of-the-art B+-tree, and we propose the Ordered Sort-Merge tree (OSM-tree).  ...  OSM-tree offers competitive query performance, leading to performance benefits between 28% and 5x for mixed read/write workloads.  ...  The server has 384GB of RDIMM main memory at 2933 MHz with 27.5MB L3 cache and a 240GB SSD. The machine runs on CentOS 8. Index Design.  ... 
arXiv:2202.04185v1 fatcat:hsldl2yrpvfgpbdpnibzxjzrv4

A-Tree: A Bounded Approximate Index Structure [article]

Alex Galakatos, Michael Markovitch, Carsten Binnig, Rodrigo Fonseca, Tim Kraska
2018 arXiv   pre-print
In fact, a recent study has shown that indexes created as part of the TPC-C benchmark can account for 55% of the total memory available in a state-of-the-art in-memory DBMS.  ...  This overhead consumes valuable and expensive main memory, and limits the amount of space that a database has available to store new data or process existing data.  ...  However, for main-memory databases, tree-based indexes can o en consume a signi cant amount of main memory.  ... 
arXiv:1801.10207v1 fatcat:rge4ccial5eqfnlug5eyd7kzym

A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms

Amirhesam Shahvarani, Hans-Arno Jacobsen
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
An in-memory indexing tree is a critical component of many databases.  ...  This drawback is a barrier to exploit the computing power of co-processors for arbitrarily large index trees.  ...  ART is an adaptive radix tree (trie) for high speed in-memory indexing which exhibits better memory usage than previous radix trees.  ... 
doi:10.1145/2882903.2882918 dblp:conf/sigmod/ShahvaraniJ16 fatcat:xbydiebsdrgcbb2w46iqtqqhze

Processing in the Hybrid OLTP & OLAP Main-Memory Database System HyPer

Alfons Kemper, Thomas Neumann, Jan Finis, Florian Funke, Viktor Leis, Henrik Mühe, Tobias Mühlbauer, Wolf Rödiger
2013 IEEE Data Engineering Bulletin  
In this paper we will survey the HyPerScript transaction programming language, the mainmemory indexing technique ART, which is decisive for high transaction processing performance, and HyPer's transaction  ...  Two emerging hardware trends have re-initiated the development of in-core database systems: ever increasing main-memory capacities and vast multi-core parallel processing power.  ...  ARTful Indexing in Main-Memory Databases The efficiency of transaction processing largely depends on which index structures are used, as exemplified by the first three select-statements of the newOrder  ... 
dblp:journals/debu/Kemper0FFLMMR13 fatcat:estx5623uva5nnwosxhj7465ua

Instant loading for main memory databases

Tobias Mühlbauer, Wolf Rödiger, Robert Seilbeck, Angelika Reiser, Alfons Kemper, Thomas Neumann
2013 Proceedings of the VLDB Endowment  
While hardware limitations for fast loading have disappeared, current approaches for main memory databases fail to saturate the now available wire speeds of tens of Gbit/s.  ...  But the game has changed: Ever increasing main memory capacities have fostered the development of in-memory database systems and very fast network infrastructures are on the verge of becoming economical  ...  Adaptive Radix Tree (ART) The adaptive radix tree (ART) [20] is a high performance and space-efficient general purpose index structure for main memory databases that is tuned for modern hardware.  ... 
doi:10.14778/2556549.2556555 fatcat:j2ig6anp2zfo5e5jkla7ucqxvm

TLB misses

Petrie Wong, Ziqiang Feng, Wenjian Xu, Eric Lo, Ben Kao
2015 Proceedings of the 11th International Workshop on Data Management on New Hardware - DaMoN'15  
Efficient main-memory index structures are crucial to mainmemory database systems. Adaptive Radix Tree (ART) is the most recent in-memory index structure.  ...  When an in-memory index structure like ART has significantly few cache misses and branch mis-predictions, it is natural to question whether misses in Translation Lookaside Buffer (TLB) matters.  ...  DaMoN BACKGROUND OF ART Adaptive radix tree (ART) [11] is a high performance and space-efficient general purpose index structure for main memory databases, specially tuned for modern hardware.  ... 
doi:10.1145/2771937.2771942 dblp:conf/damon/WongFXLK15 fatcat:e5yr7cyya5bjplkurvxagnhst4

Sensitive protein alignments at tree-of-life scale using DIAMOND

Benjamin Buchfink, Klaus Reuter, Hajk-Georg Drost
2021 Nature Methods  
the sensitivity of the gold standard BLASTP.  ...  Accessing such data for comparative analyses is crucial in this new age of data-driven biology.  ...  Rampp, for access to and support of the HPC infrastructure, and A. Tomescu for sharing insights regarding the bit pattern matching algorithm used in the leftmost seed filter.  ... 
doi:10.1038/s41592-021-01101-x pmid:33828273 pmcid:PMC8026399 fatcat:lejpoabd6rflji5jjnqd2co7im

An Investigation of Alternatives to Transform Protein Sequence Databases to a Columnar Index Schema

Roman Zoun, Kay Schallert, David Broneske, Ivayla Trifonova, Xiao Chen, Robert Heyer, Dirk Benndorf, Gunter Saake
2021 Algorithms  
Hence, the radix tree is a suitable data structure for transforming protein sequences into the indexed schema.  ...  Therefore, we applied an in-memory map, HDDmap, database engine, and extended radix tree and evaluated their performance.  ...  This work was a cooperation with Bruker Daltonik GmbH and is dedicated to the memory of Mikhail Zoun.  ... 
doi:10.3390/a14020059 fatcat:xopdgbyrizerrm3ymza7zq43xu

Experimental Index Evaluation for Partial Indexes in Horizontally Partitioned In-Memory Databases

Marcel Weisgut
2021 Workshop Grundlagen von Datenbanken  
A horizontally partitioned storage layout for columnoriented relational in-memory databases is a popular design choice.  ...  For the realization of our partial index, the maintenance efficiency of the underlying index structure is particularly relevant.  ...  Furthermore, I would like to thank the anonymous reviewers for their valuable feedback.  ... 
dblp:conf/gvd/Weisgut21 fatcat:27unucpalvgpbgm7yasx6qmtra

Adaptive Geospatial Joins for Modern Hardware [article]

Andreas Kipf, Harald Lang, Varun Pandey, Raul Alexandru Persa, Peter Boncz, Thomas Neumann, Alfons Kemper
2018 arXiv   pre-print
The exact version of our algorithm can adapt to the expected point distribution by refining the index.  ...  Our technique uses a quadtree-based hierarchical grid to approximate polygons and stores these approximations in a specialized radix tree.  ...  With the large main-memory capacities of modern hardware, however, it is for the first time possible to maintain fine-grained index structures purely in main memory.  ... 
arXiv:1802.09488v1 fatcat:jccu7p2fyjds5mqlkbwubc5xdu
« Previous Showing results 1 — 15 out of 436 results