DMCA
Self-interested Database Managers Playing The View Maintenance Game (2008)
Cached
Download Links
| Citations: | 2 - 0 self |
BibTeX
@MISC{Mostafa08self-interesteddatabase,
author = {Hala Mostafa and et al.},
title = { Self-interested Database Managers Playing The View Maintenance Game},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a view is refreshed when the data sources are updated. We study the view maintenance problem when self-interested database managers from different institutions are involved, each concerned about the privacy of its database. We regard view maintenance as an incremental, sequential process where an action taken at a stage affects what happens at later stages. The contribution of this paper is twofold. First, we formulate the view maintenance problem as a sequential game of incomplete information where at every stage, each database manager decides what information to disclose, if any, without knowledge of the number or nature of updates at other managers. This allows us to adopt a satisficing approach where the final view need not reflect 100 % of the databases updates. Second, we present an anytime algorithm for calculating ɛ-Bayes-Nash equilibria that allows us to solve the large games which our problem translates to. Our algorithm is not restricted to games originating from the view maintenance problem; it can be used to solve general games of incomplete information. In addition, experimental results demonstrate our algorithm’s attractive anytime behavior, which allows it to find good-enough solutions to large games within reasonable amounts of time.
Keyphrases
view maintenance problem self-interested database manager view maintenance game large game incomplete information reasonable amount different underlying database view maintenance final view bayes-nash equilibrium anytime algorithm sequential process satisficing approach different institution general game dynamic virtual table result set algorithm attractive anytime behavior database view experimental result later stage data source database update sequential game database manager good-enough solution
