| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Prasan Roy Shariq Rizvi , Alberto O. Mendelzon , S. Sudarshan , Prasan Roy: Extending Query Rewriting Techniques for Fine-Grained Access Control. SIGMOD Conference 2004 Philip Bohannon , Juliana Freire , Jayant R. Haritsa , Maya Ramanath , Prasan Roy, Jérôme Siméon : Bridging the XML Relational Divide with LegoDB. ICDE 2003 : 759-760 Maya Ramanath , Juliana Freire , Jayant R. Haritsa , Prasan Roy: Searching for Efficient XML-to-Relational Mappings. Xsym 2003 : 19-36 Nilesh N. Dalvi , Sumit K. Sanghai , Prasan Roy, S. Sudarshan : Pipelining in multi-query optimization. J. Comput. Syst. Sci. 66 (4): 728-762 (2003) Philip Bohannon , Juliana Freire , Prasan Roy, Jérôme Siméon : From XML Schema to Relations: A Cost-Based Approach to XML Storage. ICDE 2002 : 64- Juliana Freire , Jayant R. Haritsa , Maya Ramanath , Prasan Roy, Jérôme Siméon : StatiX: making XML count. SIGMOD Conference 2002 : 181-191 Philip Bohannon , Juliana Freire , Jayant R. Haritsa , Maya Ramanath , Prasan Roy, Jérôme Siméon : LegoDB: Customizing Relational Storage for XML Documents. VLDB 2002 : 1091-1094 Nilesh N. Dalvi , Sumit K. Sanghai , Prasan Roy, S. Sudarshan : Pipelining in Multi-Query Optimization. PODS 2001 Hoshi Mistry , Prasan Roy, S. Sudarshan , Krithi Ramamritham : Materialized View Selection and Maintenance Using Multi-Query Optimization. SIGMOD Conference 2001 Prasan Roy, S. Seshadri , S. Sudarshan , Siddhesh Bhobe : Efficient and Extensible Algorithms for Multi Query Optimization. SIGMOD Conference 2000 : 249-260 Prasan Roy, S. Seshadri , Abraham Silberschatz , S. Sudarshan , Srinivas Ashwin : Garbage Collection in Object-Oriented Databases Using Transactional Cyclic Reference Counting. VLDB J. 7 (3): 179-193 (1998) Srinivas Ashwin , Prasan Roy, S. Seshadri , Abraham Silberschatz , S. Sudarshan : Garbage Collection in Object Oriented Databases Using Transactional Cyclic Reference Counting. VLDB 1997 : 366-375 1 [ 1 ] [ 2 ] 2 [ 3 ] 3 [ 6 ] [ 8 ] [ 11 ] 4 [ 5 ] [ 9 ] 5 [ 6 ] [ 7 ] [ 8 ] [ 10 ] [ 11 ] 6 [ 6 ] [ 7 ] [ 10 ] [ 11 ] 7 [ 12 ] 8 [ 4 ] 9 [ 4 ] 10 [ 6 ] [ 7 ] [ 10 ] [ 11 ] 11 [ 12 ] 12 [ 5 ] [ 9 ] 13 [ 1 ] [ 2 ] [ 3 ] 14 [ 1 ] [ 2 ] 15 [ 6 ] [ 7 ] [ 8 ] [ 11 ] 16 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 9 ] [ 12 ]  ©2004 Association for Computing Machinery |
