A common database approach for OLTP and OLAP using an in-memory column database

Plattner, Hasso

doi:10.1145/1559845.1559846

Cited by 262 publications

(144 citation statements)

References 10 publications

Supporting

Mentioning

138

Contrasting

Unclassified

Order By: Relevance

“…The necessity of modern ERP system is not only to provide reporting but also provide in depth insight of business processes via mathematical analysis of data. So was necessary to evaluate the performance and behaviour of column-oriented system in relation to ERP system [3]. Vertical Partitioned schema has been widely studied.…”

Section: Literature Reviewmentioning

confidence: 99%

Performance Review System – An ERP Application with Secure Data Storage and Cloud Backup

Olkar¹,

Deo²,

Deo³

et al. 2016

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

Traditionally we have seen that ERP systems are developed using Row-oriented database system. Our project tries to implement column-oriented approach in development of ERP systems. The system which we are trying to develop is Employee Performance Review System. Modern software applications (ERP application in this case) are highly data-centric. As data is highly sensitive security is primary concern, we are trying to increase randomness of the encryption algorithms so as to increase the level of the data security. Loss of important data can affect business process. Hence we provide the data backup using cloud so that in case of application failure the important data needed for business decision making is not lost.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Performance Review System – An ERP Application with Secure Data Storage and Cloud Backup

Olkar¹,

Deo²,

Deo³

et al. 2016

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

show abstract

“…Current research shows that main-memory DBMSs outperform classical disk-based DBMSs in OLTP as well as OLAP applications by orders of magnitudes [8], [16]. The performance boost of main-memory DBMSs relies not only on exploiting huge amounts of main-memory as primary storage but also on using cache-aware algorithms and data structures.…”

Section: A Design Considerationsmentioning

confidence: 99%

Toward Efficient Variant Calling Inside Main-Memory Database Systems

Dorok

Breß

Saake

2014

2014 25th International Workshop on Database and Expert Systems Applications

View full text Add to dashboard Cite

Abstract-Mutations in genomes indicate predisposition for diseases or effects on efficacy of drugs. A variant calling algorithm determines possible mutations in sample genomes. Afterwards, scientists have to decide about the impact of these mutations. Certainly, many different variant calling algorithms exist that generate different outputs due to different sequence alignments as input and parameterizations of variant calling algorithms. Thus, a combination of variant calling results is necessary to provide a more complete set of mutations than single algorithm runs can provide. Therefore, a system is required that facilitates the integration and parameterization of different variant calling algorithms and processing of different sequence alignments. Moreover, against the backdrop of ever increasing amounts of available genome sequencing data, such a system must provide matured database management capabilities to enable flexible and efficient analyses while keeping data consistent. In this paper, we present a first approach to integrate variant calling into a main-memory database management system that allows for calling variants via SQL.

show abstract

“…Indexes: It has been claimed that column-stores do not benefit from indexes due to cheap column-scans that can be used for tuple retrieval [29]. While Column-Scans are hard to avoid for search-like queries like Query 1, queries that are mere identity-selects may benefit more from indexes in To investigate the benefit of indexed selects on various storage layouts we created supporting indexes (hash indexes for primary keys and one RB-Tree on VBAP(VBELN)) for these queries using the same storage strategy.…”

Section: B the Sap-sd Benchmarkmentioning

confidence: 99%

CPU and cache efficient management of memory-resident databases

Pirk

Funke²,

Grund

et al. 2013

2013 IEEE 29th International Conference on Data Engineering (ICDE)

View full text Add to dashboard Cite

Abstract-Memory-Resident Database Management Systems (MRDBMS) have to be optimized for two resources: CPU cycles and memory bandwidth. To optimize for bandwidth in mixed OLTP/OLAP scenarios, the hybrid or Partially Decomposed Storage Model (PDSM) has been proposed. However, in current implementations, bandwidth savings achieved by partial decomposition come at increased CPU costs. To achieve the aspired bandwidth savings without sacrificing CPU efficiency, we combine partially decomposed storage with Just-in-Time (JiT) compilation of queries, thus eliminating CPU inefficient function calls. Since existing cost based optimization components are not designed for JiT-compiled query execution, we also develop a novel approach to cost modeling and subsequent storage layout optimization. Our evaluation shows that the JiT-based processor maintains the bandwidth savings of previously presented hybrid query processors but outperforms them by two orders of magnitude due to increased CPU efficiency.

show abstract

A common database approach for OLTP and OLAP using an in-memory column database

Cited by 262 publications

References 10 publications

Performance Review System – An ERP Application with Secure Data Storage and Cloud Backup

Performance Review System – An ERP Application with Secure Data Storage and Cloud Backup

Toward Efficient Variant Calling Inside Main-Memory Database Systems

CPU and cache efficient management of memory-resident databases

Contact Info

Product

Resources

About