Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Raghav Kaushik

Papers on DiSC'02


On the Complexity of Join Predicates

Publications


Note: Links lead to the DBLP on the Web.

Raghav Kaushik

5 Raghav Kaushik, Pradeep Shenoy , Philip Bohannon , Ehud Gudes : Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data. ICDE 2002

4 Raghav Kaushik, Philip Bohannon , Jeffrey F. Naughton , Henry F. Korth : Covering Indexes for Branching Path Queries. SIGMOD Conference 2002

3 Raghav Kaushik, Philip Bohannon , Jeffrey F. Naughton , Pradeep Shenoy : Updates for Structure Indexes. VLDB 2002

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'02 © 2003 Association for Computing Machinery