A performance analysis of view materialization strategies
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Algorithms for deferred view maintenance
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On-line warehouse view maintenance
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
How to roll a join: asynchronous incremental view maintenance
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Lazy maintenance of materialized views
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Analyzing online social networks
Communications of the ACM - Remembering Jim Gray
Asynchronous view maintenance for VLSD databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Live linked data: synchronising semantic stores with commutative replicated data types
International Journal of Metadata, Semantics and Ontologies
| Hi-index | 0.00 |
We introduce CAMEL, a lazy view maintenance system for social networking applications on a database server with a distributed memory cache. System administrators can control the throughput of the system by tuning the level of freshness of materialized views. CAMEL employs the existing view maintenance techniques of incremental maintenance, lazy maintenance, and control table. In addition, CAMEL optimizes view maintenance performance by pushing the top-k operation down to before join operations and by constructing a reverse index. We evaluate CAMEL using real data from a mini-blog service. The results show that CAMEL is 6.13 and 11.2 times faster than the method of eager view maintenance while keeping the freshness of materialized views at 66.2% and 38.0%, respectively.