Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
A linear-time probabilistic counting algorithm for database applications
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Hitting the memory wall: implications of the obvious
ACM SIGARCH Computer Architecture News
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Conjunctive selection conditions in main memory
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
PRISMA/DB: A Parallel, Main Memory Relational DBMS
IEEE Transactions on Knowledge and Data Engineering
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Key Range Locking Strategies for Improved Concurrency
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Selection conditions in main memory
ACM Transactions on Database Systems (TODS)
QPipe: a simultaneously pipelined relational query engine
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Cooperative scans: dynamic bandwidth sharing in a DBMS
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Main-memory scan sharing for multi-core CPUs
Proceedings of the VLDB Endowment
Constant-Time Query Processing
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
The DataPath system: a data-centric analytic processing engine for large data warehouses
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Variance aware optimization of parameterized queries
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Database engines on multicores, why parallelize when you can distribute?
Proceedings of the sixth conference on Computer systems
Predictable performance and high query concurrency for data analytics
The VLDB Journal — The International Journal on Very Large Data Bases
Fast checkpoint recovery algorithms for frequently consistent applications
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Predicting cost amortization for query services
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
CoScan: cooperative scan sharing in the cloud
Proceedings of the 2nd ACM Symposium on Cloud Computing
I/O streaming evaluation of batch queries for data-intensive computational turbulence
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
SharedDB: killing one thousand queries with one stone
Proceedings of the VLDB Endowment
From cooperative scans to predictive buffer management
Proceedings of the VLDB Endowment
Workload optimization using SharedDB
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Application level ballooning for efficient server consolidation
Proceedings of the 8th ACM European Conference on Computer Systems
Scaling up analytical queries with column-stores
Proceedings of the Sixth International Workshop on Testing Database Systems
Data management systems on GPUs: promises and challenges
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
MacroDB: scaling database engines on multicores
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Sharing data and work across concurrent analytical queries
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
This paper introduces Crescando: a scalable, distributed relational table implementation designed to perform large numbers of queries and updates with guaranteed access latency and data freshness. To this end, Crescando leverages a number of modern query processing techniques and hardware trends. Specifically, Crescando is based on parallel, collaborative scans in main memory and so-called "query-data" joins known from data-stream processing. While the proposed approach is not always optimal for a given workload, it provides latency and freshness guarantees for all workloads. Thus, Crescando is particularly attractive if the workload is unknown, changing, or involves many different queries. This paper describes the design, algorithms, and implementation of a Crescando storage node, and assesses its performance on modern multi-core hardware.