Please use this identifier to cite or link to this item:
|Title:||Invalidation clues for database scalability services|
|Citation:||Manjhi, A.,Gibbons, P.B.,Ailamaki, A.,Garrod, C.,Maggs, B.M.,Mowry, T.C.,Olston, C.,Tomasic, A.,Yu, H. (2007). Invalidation clues for database scalability services. Proceedings - International Conference on Data Engineering : 316-325. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2007.367877|
|Abstract:||For their scalability needs, data-intensive Web applications can use a Database Scalability Service (DBSS), which caches applications' query results and answers queries on their behalf. One way for applications to address their security/privacy concerns when using a DBSS is to encrypt all data that passes through the DBSS. Doing so, however, causes the DBSS to invalidate large regions of its cache when data updates occur. To invalidate more precisely, the DBSS needs help in order to know which results to invalidate; such help inevitably reveals some properties about the data. In this paper, we present invalidation clues, a general technique that enables applications to reveal little data to the DBSS, yet limit the number of unnecessary invalidations. Compared with previous approaches, invalidation clues provide applications significantly improved tradeoffs between security/privacy and scalability. Our experiments using three Web application benchmarks, on a prototype DBSS we have built, confirm that invalidation clues are indeed a low-overhead, effective, and general technique for applications to balance their privacy and scalability needs. © 2007 IEEE.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 20, 2019
checked on Dec 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.