2018 IEEE International Conference on Big Data (Big Data) 2018
DOI: 10.1109/bigdata.2018.8622353
|View full text |Cite
|
Sign up to set email alerts
|

Polypheny-DB: Towards a Distributed and Self-Adaptive Polystore

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 42 publications
0
10
0
Order By: Relevance
“…Currently, we are working on a new low-level storage engine for Cottontail DB, which will enable more fine grained control over I/O and buffering of data pages while at the same time taking advantage of certain access patterns inherent to certain types of queries and data. We also plan to add support for SQL by integrating Cottontail DB into the polystore Polypheny DB [20]. Long-term ideas involve support for distribution to several nodes and leveraging SIMD instructions for nearest neighbour search operations through Java's project Panama 9 and JVM support for vector intrinsics.…”
Section: Discussionmentioning
confidence: 99%
“…Currently, we are working on a new low-level storage engine for Cottontail DB, which will enable more fine grained control over I/O and buffering of data pages while at the same time taking advantage of certain access patterns inherent to certain types of queries and data. We also plan to add support for SQL by integrating Cottontail DB into the polystore Polypheny DB [20]. Long-term ideas involve support for distribution to several nodes and leveraging SIMD instructions for nearest neighbour search operations through Java's project Panama 9 and JVM support for vector intrinsics.…”
Section: Discussionmentioning
confidence: 99%
“…The most relevant work in the category “Fragmentation of Multimedia Databases” is [ 1 ] since it has been cited in several papers ([ 26 , 32 , 40 , 41 , 55 , 67 , 73 ]); in contrast, the most influential method in the category “Dynamic Fragmentation” is [ 70 ] because it has motivated a number of approaches ([ 28 , 29 , 30 , 31 , 32 , 35 , 52 , 56 , 60 , 66 , 69 , 70 , 75 , 77 , 79 , 91 ]); in the category “Fragmentation for NOSQL DBMS”, the article that has attracted more attention is [ 63 ]; finally, [ 25 ] is the most cited work in the category “Other Types of Fragmentation” ([ 23 , 26 , 27 , 32 ]).…”
Section: Discussionmentioning
confidence: 99%
“…Vogt, Stiemer & Schuldt [ 77 ] presented Polypheny-DB’s vision of a distributed polystore system that seamlessly combines replication and partitioning with local polystore and can dynamically adapt all parts of the system when workload changes. The basic components for both parts of the system were presented and the open challenges towards the implementation of the Polypheny-DB vision were shown.…”
Section: Description Of the Set Of Work By Categorymentioning
confidence: 99%
“…In [20], we have introduced Polypheny-DB, a novel distributed polystore database. Polypheny-DB considers distribution at two levels: At global level, data is fragmented and replicated (the latter to increase availability) in order to allocate it to different sites in a global network.…”
Section: Introductionmentioning
confidence: 99%
“…At local level, each site runs an independent polystore that can decide unilaterally, based on a local cost model, which data stores to provide, how to distribute data across these data stores, and how to process queries. Assume, as an example for an organization running such a distributed polystore, an international auction house with databases and compute centers distributed around the globe (see [20] for more details). The auction house has to jointly deal with several workloads such as Online Transaction Processing (OLTP) (for the actual auctions), Online Analytical Processing (OLAP) (for analyzes of past auctions), graph queries (for recommendations to their customers), and finally also multimedia similarity search queries (to find items and thus auctions based on the visual appearance of the former).…”
Section: Introductionmentioning
confidence: 99%