1 / 6

Research Presentation

Research Presentation. Parth Nagarkar Feb. 24, 2012. Background. We have attributes with hierarchical structure We have defined a policy model ok( subject_name , attribute_name , object_name ) E.g. ok (Mithila, Location, PHX) ok (Mithila, Location, California). U.S.

lilah-pratt
Download Presentation

Research Presentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Research Presentation ParthNagarkar Feb. 24, 2012

  2. Background • We have attributes with hierarchical structure • We have defined a policy model • ok(subject_name, attribute_name, object_name) • E.g. ok (Mithila, Location, PHX) ok (Mithila, Location, California) U.S California Arizona PHX L.A. SFO Database Entries for an attribute “Location”

  3. Motivation • In the previous example, we only had one subject. What if there are policies for more than one subject? • Why do we need to partition the hierarchy? • Types of wasted work: • Refinement work (root node) • Replacement work (leaf nodes) U.S Jung’s level CA AZ Xilun’s level PHX L.A. SFO Mithila’s level

  4. Proposed Approach • For a cutoff/level in a hierarchy,

  5. Proposed Approach (contd.) • Top-Down approach • Bottom-Up approach • Binary Search approach

  6. More problems to solve • How to cluster subjects and map them accordingly to different servers? • Subjects that read similar data should be clustered together • Extend the model to multiple attributes • Implementation: • Given a cutoff, how to figure out if the data above the cutoff actually fits in the memory? • Finish the three approaches

More Related