Fiting-tree: A data-aware index structure

A Galakatos, M Markovitch, C Binnig… - Proceedings of the …, 2019 - dl.acm.org
Index structures are one of the most important tools that DBAs leverage to improve the
performance of analytics and transactional workloads. However, building several indexes …

Data warehouse systems

A Vaisman, E Zimányi - Data-Centric Systems and Applications, 2014 - Springer
Since the late 1970s, relational database technology has been adopted by most
organizations to store their essential data. However, nowadays, the needs of these …

[图书][B] High performance visualization: Enabling extreme-scale scientific insight

EW Bethel, H Childs, C Hansen - 2012 - books.google.com
Visualization and analysis tools, techniques, and algorithms have undergone a rapid
evolution in recent decades to accommodate explosive growth in data size and complexity …

A survey on big IoT data indexing: Potential solutions, recent advancements, and open issues

Z Kouahla, AE Benrazek, MA Ferrag, B Farou, H Seridi… - Future Internet, 2021 - mdpi.com
The past decade has been characterized by the growing volumes of data due to the
widespread use of the Internet of Things (IoT) applications, which introduced many …

Modern B-tree techniques

G Graefe - Foundations and Trends® in Databases, 2011 - nowpublishers.com
Invented about 40 years ago and called ubiquitous less than 10 years later, B-tree indexes
have been used in a wide variety of computing systems from handheld devices to …

Druid: A real-time analytical data store

F Yang, E Tschetter, X Léauté, N Ray… - Proceedings of the …, 2014 - dl.acm.org
Druid is an open source data store designed for real-time exploratory analytics on large data
sets. The system combines a column-oriented storage layout, a distributed, shared-nothing …

TripleBit: a fast and compact system for large scale RDF data

P Yuan, P Liu, B Wu, H Jin, W Zhang, L Liu - Proceedings of the VLDB …, 2013 - dl.acm.org
The volume of RDF data continues to grow over the past decade and many known RDF
datasets have billions of triples. A grant challenge of managing this huge RDF data is how to …

An experimental study of bitmap compression vs. inverted list compression

J Wang, C Lin, Y Papakonstantinou… - Proceedings of the 2017 …, 2017 - dl.acm.org
Bitmap compression has been studied extensively in the database area and many efficient
compression schemes were proposed, eg, BBC, WAH, EWAH, and Roaring. Inverted list …

[PDF][PDF] Comparison of lossless data compression algorithms for text data

SR Kodituwakku, US Amarasinghe - Indian journal of computer …, 2010 - academia.edu
Data compression is a common requirement for most of the computerized applications.
There are number of data compression algorithms, which are dedicated to compress …

FastBit: interactively searching massive data

K Wu, S Ahern, EW Bethel, J Chen… - Journal of Physics …, 2009 - iopscience.iop.org
As scientific instruments and computer simulations produce more and more data, the task of
locating the essential information to gain insight becomes increasingly difficult. FastBit is an …