Medha Atre
From Semantic Portal Wiki
| Medha Atre (Person) [ Edit ] | |
| File:Anonymous.png | |
| Basic Description | |
| affiliation | RPI |
| occupation | Category:PhD Student |
| Contact Information | |
| General Relation | |
| Inferred Relation
| |
Contents |
publications
total:2
2009
- Medha Atre, Jagannathan Srinivasan, James A. Hendler. BitMat: A Main Memory RDF Triple Store , Tetherless World Constellation, TW-2009-02,January 2009 [TW-2009-02] [ download paper ]
2008
- Medha Atre, Jagannathan Srinivasan, James A. Hendler. BitMat: A Main-memory Bit Matrix of RDF Triples for Conjunctive Triple Pattern Queries , International Semantic Web Conference (Posters \& Demos), 2008 [TW-2008-26]
Projects
CSCI 6966 Advanced Semantic Web (Fall 2008)
Presentations made by Medha Atre for CSCI6966
- (Date: 9/4/2008) Research presentation about BitMat
| Presentation Page | Paper Presented | Authors | URL |
|---|---|---|---|
| Medha GRIN Presentation | GRIN: A Graph Based RDF Index | Octavian Udrea Andrea Pugliese V.S. Subrahmanian |
http://www.cs.umd.edu/users/udrea/papers/grin.pdf |
| Medha Journal Presentation | Discovering and Explaining Abnormal Nodes in Semantic Graphs | Shou-de Lin Hans Chalupsky |
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4358968 |
| Tw:Brahms Medha Presentation 0918 | BRAHMS: A WorkBench RDF Store And High Performance Memory System for Semantic Association Discovery | Maciej Janik Krys Kochut |
http://lsdis.cs.uga.edu/library/download/JK05-ISWC2005.pdf |
Presentation Questions from CSCI6966
Total: 3
| Question for the Presentation | Question asked | |
|---|---|---|
| Abel 2007 Medha Question 1 | Abel2007enabling presented by Tim Lebo 25 sept 2008 | When the authors say that they have come up with this approach to save time which might be spent in exercising access control by first evaluating plain query on RDF store and then applying access control to each and every triple, can they give some hint about how much time was saved by their approach on similar datasets? |
| Abel 2007 Medha Question 2 | Abel2007enabling presented by Tim Lebo 25 sept 2008 | ONE: The given example is a very tiny one w.r.t original query and set of policies defined. Is there any estimate available about what is the number of typical policies on a decent size RDF triple store. TWO: How big a transformed query turns after applying all the policies (THREE:) and especially if multiple policies defined by multiple people get applied? The paper says that if deny policy is applicable then access triple is denied, but then this generic approach doesn't seem to embrace some user's preference to allow access to some information, unless a within policies is provided. E.g. Alice says allow access to (l3s:alice, foaf:phone, Z) and Harry says deny access to (X, foaf:phone, Z)? |
| SPARQL BGP opt Medha Q 1 | Gregory Todd Williams SPARQL BGP Optimization Presentation | What is the size of the typical join pattern graph used for evaluation of the system? When authors mention that query 9 could not be completed for plan space evaluation, audience is curious to know how it looked. (See more comments). |
My statistics for CSCI6966
- I asked questions after the presentations, especially the ones in data management and query processing.
- I did not pose a lot of questions over presentations involving reasoning and description logic.
- I answered the questions posted online for my presentation on GRIN paper on the respective question pages. For the other two of my presentations, I answered the questions in the class after the presentation.
