Column sketches: A scan accelerator for rapid and robust predicate evaluation

B Hentschel, MS Kester, S Idreos - Proceedings of the 2018 International …, 2018 - dl.acm.org
While numerous indexing and storage schemes have been developed to address the core
functionality of predicate evaluation in data systems, they all require specific workload …

Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines

M Athanassoulis, S Idreos… - Foundations and Trends …, 2023 - nowpublishers.com
Key-value data structures constitute the core of any datadriven system. They provide the
means to store, search, and modify data residing at various levels of the storage and …

In-memory parallelization of join queries over large ontological hierarchies

D Bilidas, M Koubarakis - Distributed and Parallel Databases, 2021 - Springer
Abstract The Resource Description Framework (RDF) data model enables the construction
of knowledge graphs over various domains, using ontologies in order to encode information …

Bindex: A two-layered index for fast and robust scans

L Li, K Zhang, J Guo, W He, Z He, Y Jing… - Proceedings of the …, 2020 - dl.acm.org
In modern analytical database systems, the performance of the data scan operation is of key
importance to the performance of query execution. Existing approaches may be categorized …

Graph exploration: From users to large graphs

D Mottin, E Müller - proceedings of the 2017 ACM international …, 2017 - dl.acm.org
The increasing interest in social networks, knowledge graphs, protein-interaction, and many
other types of networks has raised the question how users can explore such large and …

TreeTracker Join: Turning the Tide When a Tuple Fails to Join

Z Hu, DP Miranker - arXiv preprint arXiv:2403.01631, 2024 - arxiv.org
Many important query processing methods proactively use semijoins or semijoin-like filters
to delete dangling tuples, ie, tuples that do not appear in the final query result. Semijoin …

Past and future steps for adaptive storage data systems: From shallow to deep adaptivity

S Idreos, M Athanassoulis, N Dayan, D Guo… - Real-Time Business …, 2019 - Springer
Data systems with adaptive storage can autonomously change their behavior by altering
how data is stored and accessed. Such systems have been studied primarily for the case of …

Query Dictionary for frequent non-indexed queries in HTAP databases

S Shetty, BD Rao, S Prabhu - IEEE Access, 2022 - ieeexplore.ieee.org
The increasing demand for the simultaneous transaction and review of the data for either
decision making or forecasting has created a need for faster and better Hybrid …

An adaptive data partitioning scheme for accelerating exploratory spark sql queries

C Guo, Z Wu, Z He, XS Wang - … , DASFAA 2017, Suzhou, China, March 27 …, 2017 - Springer
For data analysis, it's useful to explore the data set with a sequence of queries, frequently
using the results from the previous queries to shape the next queries. Thus, data used in the …

Evolutionary data systems

S Idreos, LM Maas, MS Kester - arXiv preprint arXiv:1706.05714, 2017 - arxiv.org
Anyone in need of a data system today is confronted with numerous complex options in
terms of system architectures, such as traditional relational databases, NoSQL and NewSQL …