db-derby-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Apache Wiki <wikidi...@apache.org>
Subject [Db-derby Wiki] Update of "sqlAuth4Dblook" by Hiranya Jayathilaka
Date Sun, 10 May 2009 04:46:28 GMT
Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Db-derby Wiki" for change notification.

The following page has been changed by Hiranya Jayathilaka:

  When dblook finally walks the graph it will need to produce an authentication statement
prior to producing the actual DDL statement required to create each object. For an example
if there is an object O associated with the user U in the graph, dblook will first output
an authentication statement for user U before producing the DDL statement for O. After producing
the creation statement necessary grant statements should be created related to the object.
Basically all the permissions related to the object should be granted to the associated users.
Walking the graph should start from a node which does not have any in bound edges (ie it does
not depend on any other object). As the graph walk continues objects are removed from the
graph along with all edges incident on them. The walk continues until the graph's set of vertices
is empty.
- (The datastructures used to store the elements of the dependency graph should be lightweight.
+ == Dependency Graph Design ==
+ The datastructures used to store the elements of the dependency graph should be lightweight.
This graph will be held in memory and its size will be proportional to the number of persistent
objects in the database. Therefore larger the database, larger the dependency graph. We need
to be conservative in memory usage to efficiently deal with large databases.
+ Each vertex in the graph should store a set of in bound edges, set of out bound edges, an
associated user ID (might also need to store authentication credentials of the user) and a
set of permissions.   
+ == Dependency Graph Construction Algorithm ==
+ == Dependency Graph Walk Algorithm ==

View raw message