Open AccessJournal Article
MonetDB: Two Decades of Research in Column-oriented Database Architectures
TL;DR: This paper gives a brief overview of the MonetDB technology as it developed over the past two decades and the main research highlights which drive the current Monet DB design and form the basis for its future evolution.
read more
Abstract: MonetDB is a state-of-the-art open-source column-store database management system targeting applications in need for analytics over large collections of data. MonetDB is actively used nowadays in
health care, in telecommunications as well as in scientific databases and in data management research,
accumulating on average more than 10,000 downloads on a monthly basis. This paper gives a brief
overview of the MonetDB technology as it developed over the past two decades and the main research
highlights which drive the current MonetDB design and form the basis for its future evolution.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Dissertation
Best Practices of Big Data Analytics Applied to PII Security
Lori Higham
- 23 Dec 2016
TL;DR: Personally identifiable information; PII; privacy; breach; data security; data isolation; server isolation; security technologies; Big Data principles.
1
A kinetic Monte Carlo implementation of the Cellular Potts Model with SciQL
Mathé Zeegers
- 01 Jan 2013
TL;DR: A kinetic variant of the CPM will be implemented inspired by kinetic Monte Carlo methods, like the one that has been used for the Gillespie algorithm, with SciQL, an SQL-based database language meant for scientific applications.
•Posted Content
Online Sketch-based Query Optimization.
TL;DR: CompASS as discussed by the authors is a query optimization paradigm for in-memory databases based on a single type of statistics, Fast-AGMS sketches, which are pushed-down and evaluated online during query optimization.
1
•Dissertation
Efficiently compressing string columnar data using frequent pattern mining
Xiaojian Wang
- 20 Jun 2016
TL;DR: This thesis develops a compression algorithm using frequent string patterns directly mined from a sample of a string column, and develops a pruning method to address the cache inefficiencies in indexing the patterns.
1
References
•Proceedings Article
MonetDB/X100: Hyper-Pipelining Query Execution
Peter Boncz,Marcin Zukowski,Niels Nes +2 more
- 01 Jan 2005
TL;DR: An in-depth investigation to the reason why database systems tend to achieve only low IPC on modern CPUs in compute-intensive application areas, and a new set of guidelines for designing a query processor for the MonetDB system that follows these guidelines.
Self-organizing tuple reconstruction in column-stores
Stratos Idreos,Martin L. Kersten,Stefan Manegold +2 more
- 29 Jun 2009
TL;DR: A novel design, partial sideways cracking, is proposed that achieves performance similar to using presorted data, but without requiring the heavy initial presorting step itself, and brings significant performance benefits for multi-attribute queries.
Generic database cost models for hierarchical memory systems
Stefan Manegold,Peter Boncz,Martin L. Kersten +2 more
- 20 Aug 2002
TL;DR: A generic technique to create accurate cost functions for database operations and provides insight to tune algorithms not only in a main-memory DBMS, but also in a disk-based DBMS with a large main- memory buffer cache.
The researcher's guide to the data deluge: querying a scientific database in just a few seconds
Martin L. Kersten,Stratos Idreos,Stefan Manegold,Erietta Liarou +3 more
- 01 Aug 2011
TL;DR: It is envisioned that next generation database systems should interpret queries by their intent, rather than as a contract carved in stone for complete and correct answers, and response times should be close to instant such that they allow a scientist to interact with the system and explore the data in a contextualized way.
Updating a cracked database
Stratos Idreos,Martin L. Kersten,Stefan Manegold +2 more
- 11 Jun 2007
TL;DR: In this article, the authors introduce several novel algorithms for high-volume insertions, deletions and updates against a cracked database, which comply with the cracking philosophy, i.e., a table is informed on pending insertions and deletions, but only when the relevant data is needed for query processing just enough pending update actions are applied.