![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Raghav Kaushik Rajasekar Krishnamurthy , Venkatesan T. Chakaravarthy , Raghav Kaushik, Jeffrey F. Naughton : Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation. ICDE 2004 : 42-53 Raghav Kaushik, Rajasekar Krishnamurthy , Jeffrey F. Naughton , Raghu Ramakrishnan : On the Integration of Structure Indexes and Inverted Lists. ICDE 2004 : 829 Raghav Kaushik, Rajasekar Krishnamurthy , Jeffrey F. Naughton , Raghu Ramakrishnan : On the Integration of Structure Indexes and Inverted Lists. SIGMOD Conference 2004 Surajit Chaudhuri , Raghav Kaushik, Jeffrey F. Naughton : On Relational Support for XML Publishing: Beyond Sorting and Tagging. SIGMOD Conference 2003 : 611-622 Rajasekar Krishnamurthy , Raghav Kaushik, Jeffrey F. Naughton : XML-SQL Query Translation Literature: The State of the Art and Open Problems. Xsym 2003 : 1-18 Raghav Kaushik, Pradeep Shenoy , Philip Bohannon , Ehud Gudes : Exploiting Local Similarity for Indexing Paths in Graph-Structured Data. ICDE 2002 : 129-140 Raghav Kaushik, Philip Bohannon , Jeffrey F. Naughton , Henry F. Korth : Covering indexes for branching path queries. SIGMOD Conference 2002 : 133-144 Raghav Kaushik, Philip Bohannon , Jeffrey F. Naughton , Pradeep Shenoy : Updates for Structure Indexes. VLDB 2002 : 239-250 Jin-yi Cai , Venkatesan T. Chakaravarthy , Raghav Kaushik, Jeffrey F. Naughton : On the Complexity of Join Predicates. PODS 2001 Karthikeyan Ramasamy , Jignesh M. Patel , Jeffrey F. Naughton , Raghav Kaushik: Set Containment Joins: The Good, The Bad and The Ugly. VLDB 2000 : 351-362 1 [ 3 ] [ 4 ] [ 5 ] 2 [ 2 ] 3 [ 2 ] [ 10 ] 4 [ 7 ] 5 [ 5 ] 6 [ 4 ] 7 [ 6 ] [ 8 ] [ 9 ] [ 10 ] 8 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] 9 [ 1 ] 10 [ 8 ] [ 9 ] 11 [ 1 ] 12 [ 3 ] [ 5 ] ![]() ©2004 Association for Computing Machinery |