Quaestor
| Autor: | Norbert Ritter, Michael Schaarschmidt, Eiko Yoneki, Wolfram Wingerath, Felix Gessert, Erik Witt |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Hardware_MEMORYSTRUCTURES
Database 4609 Information Systems business.industry Computer science General Engineering 020206 networking & telecommunications Cloud computing 02 engineering and technology Bloom filter computer.software_genre Data structure 4605 Data Management and Data Science 4606 Distributed Computing and Systems Software 46 Information and Computing Sciences 020204 information systems Scalability 0202 electrical engineering electronic engineering information engineering Web performance Cache business computer Cache algorithms |
| Zdroj: | Proceedings of the VLDB Endowment. 10:1670-1681 |
| ISSN: | 2150-8097 |
| DOI: | 10.14778/3137765.3137773 |
| Popis: | Today, web performance is primarily governed by round-trip latencies between end devices and cloud services. To improve performance, services need to minimize the delay of accessing data. In this paper, we propose a novel approach to low latency that relies on existing content delivery and web caching infrastructure. The main idea is to enable application-independent caching of query results and records with tunable consistency guarantees, in particular bounded staleness. Q uaestor (Query Store) employs two key concepts to incorporate both expiration-based and invalidation-based web caches: (1) an Expiring Bloom Filter data structure to indicate potentially stale data, and (2) statistically derived cache expiration times to maximize cache hit rates. Through a distributed query invalidation pipeline, changes to cached query results are detected in real-time. The proposed caching algorithms offer a new means for data-centric cloud services to trade latency against staleness bounds, e.g. in a database-as-a-service. Q uaestor is the core technology of the backend-as-a-service platform Baqend, a cloud service for low-latency websites. We provide empirical evidence for Q uaestor 's scalability and performance through both simulation and experiments. The results indicate that for read-heavy workloads, up to tenfold speed-ups can be achieved through Q uaestor 's caching. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|