![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Prakash Ramanan Prakash Ramanan: Covering Indexes for XML Queries: Bisimulation - Simulation = Negation. VLDB 2003 : 165-176 Prakash Ramanan: Efficient algorithms for minimizing tree pattern queries. SIGMOD Conference 2002 : 299-309 ![]() ©2004 Association for Computing Machinery |