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

Sanjiv Behl

Papers on DiSC'03


K-tree/forest: efficient indexes for boolean queries

Publications


Note: Links lead to the DBLP on the Web.

Sanjiv Behl

2 Rakesh M. Verma , Sanjiv Behl: K-tree/forest: efficient indexes for boolean queries. SIGIR 2002 : 433-434

1 Sanjiv Behl, Rakesh M. Verma : Efficient declustering techniques for temporal access structures. ADC 2001 : 91-98




DiSC'03 © 2003 Association for Computing Machinery