![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Prakash Ramanan 2 Prakash Ramanan: Covering Indexes for XML Queries: Bisim-Sim-Negation. VLDB 2003 1 Prakash Ramanan: Efficient algorithms for minimizing tree pattern queries. SIGMOD Conference 2002 : 299-309 ![]() DiSC'03 © 2003 Association for Computing Machinery |