DATABASE POLICIES
-----------------

Indexing scheme for efficient storing and searching for policies in a DBMS. Policies here are expressed as conjunctions of atomic predicates where the domain of predicates can be 
a numeric, string or regular expressions.
	
	Possible schemes : A R-tree like data structure
	Research Issues  : Measure of policy similarity. Union of policies. Intersection of policies. Policy clustering.
	

 

NON-PARAMETRIC DENSITY ESTIMATION FROM UNCERTAIN DATA
-----------------------------------------------------

To estimate the probability mass function of an uncertain attribute using the concept of entropy maximization.