Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
IEEE Transactions on Software Engineering
An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
On the propagation of errors in the size of join results
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Materialized view selection and maintenance using multi-query optimization
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The SDSS skyserver: public access to the sloan digital sky server data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Mid-tier caching: the TimesTen approach
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Middle-tier database caching for e-business
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems
IEEE Transactions on Software Engineering
Form-Based Proxy Caching for Database-Backed Web Sites
Proceedings of the 27th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
MTCache: Transparent Mid-Tier Database Caching in SQL Server
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Optimal File-Bundle Caching Algorithms for Data-Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Bypass Caching: Making Scientific Databases Good Network Citizens
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Cache tables: paving the way for an adaptive database cache
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Adaptive Physical Design for Curated Archives
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Adaptive query execution for data management in the cloud
CloudDB '10 Proceedings of the second international workshop on Cloud data management
Predicting cost amortization for query services
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A dynamic data middleware cache for rapidly-growing scientific repositories
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Being picky: processing top-k queries with set-defined selections
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
Making multi-terabyte scientific databases publicly accessible over the Internet is increasingly important in disciplines such as Biology and Astronomy. However, contention at a centralized, backend database is a major performance bottleneck, limiting the scalability of Internet-based, database applications. Midtier caching reduces contention at the backend database by distributing database operations to the cache. To improve the performance of mid-tier caches, we propose the caching of query prototypes, a workload-driven unit of cache replacement in which the cache object is chosen from various classes of queries in the workload. In existingmid-tier caching systems, the storage organization in the cache is statically defined. Our approach adapts cache storage to workload changes, requires no prior knowledge about the workload, and is transparent to the application. Experiments over a one-month, 1.4 million query Astronomy workload demonstrate up to 70% reduction in network traffic and reduce query response time by up to a factor of three when compared with alternative units of cache replacement.