𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the 14th International Conference - Uppsala, Sweden (2011.03.21-2011.03.24)] Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11 - Native support of multi-tenancy in RDBMS for software as a service

✍ Scribed by Schiller, Oliver; Schiller, Benjamin; Brodt, Andreas; Mitschang, Bernhard


Book ID
121458147
Publisher
ACM Press
Year
2011
Weight
931 KB
Category
Article
ISBN
1450305288

No coin nor oath required. For personal study only.

✦ Synopsis


Software as a Service (SaaS) facilitates acquiring a huge number of small tenants by providing low service fees. To achieve low service fees, it is essential to reduce costs per tenant. For this, consolidating multiple tenants onto a single relational schema instance turned out beneficial because of low overheads per tenant and scalable manageability. This approach implements data isolation between tenants, per-tenant schema extension and further tenant-centric data management features in application logic. This is complex, disables some optimization opportunities in the RDBMS and represents a conceptual misstep with Separation of Concerns in mind.Therefore, we contribute first features of a RDBMS to support tenant-aware data management natively. We introduce tenants as first-class database objects and propose the concept of a tenant context to isolate a tenant from other tenants. We present a schema inheritance concept that allows sharing a core application schema among tenants while enabling schema extensions per tenant. Finally, we evaluate a preliminary implementation of our approach.


πŸ“œ SIMILAR VOLUMES


[ACM Press the 14th International Confer
✍ Nobari, Sadegh; Lu, Xuesong; Karras, Panagiotis; Bressan, StΓ©phane πŸ“‚ Article πŸ“… 2011 πŸ› ACM Press βš– 757 KB

Today, several database applications call for the generation of random graphs. A fundamental, versatile random graph model adopted for that purpose is the ErdΕ‘s-RΓ©nyi Ξ“v,p model. This model can be used for directed, undirected, and multipartite graphs, with and without self-loops; it induces algorit