Raghav Kaushik Papers on DiSC'03 Covering indexes for branching path queries Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data Updates for Structure Indexes Publications Note: Links lead to the DBLP on the Web. Raghav Kaushik 7 Surajit Chaudhuri , Raghav Kaushik, Jeffrey F. Naughton : On Relational Support for XML Publishing: Beyond Sorting and Tagging. SIGMOD Conference 2003 : 611-622 6 Rajasekar Krishnamurthy , Raghav Kaushik, Jeffrey F. Naughton : XML-SQL Query Translation Literature: The State of the Art and Open Problems. Xsym 2003 : 1-18 5 Raghav Kaushik, Pradeep Shenoy , Philip Bohannon , Ehud Gudes : Exploiting Local Similarity for Indexing Paths in Graph-Structured Data. ICDE 2002 : 129-140 4 Raghav Kaushik, Philip Bohannon , Jeffrey F. Naughton , Henry F. Korth : Covering indexes for branching path queries. SIGMOD Conference 2002 : 133-144 3 Raghav Kaushik, Philip Bohannon , Jeffrey F. Naughton , Pradeep Shenoy : Updates for Structure Indexes. VLDB 2002 : 239-250 2 Jin-yi Cai , Venkatesan T. Chakaravarthy , Raghav Kaushik, Jeffrey F. Naughton : On the Complexity of Join Predicates. PODS 2001 1 Karthikeyan Ramasamy , Jignesh M. Patel , Jeffrey F. Naughton , Raghav Kaushik: Set Containment Joins: The Good, The Bad and The Ugly. VLDB 2000 : 351-362 DiSC'03 © 2003 Association for Computing Machinery