![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Jonathan Goldstein 6 Jonathan Goldstein, Per-Åke Larson : Optimizing Queries Using Materialized Views: A practical, scalable solution. SIGMOD Conference 2001 5 Jonathan Goldstein, Raghu Ramakrishnan : Squeezing the Most out of Relational Database Systems. ICDE 2000 : 81 4 Jonathan Goldstein, Raghu Ramakrishnan : Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches. VLDB 2000 : 429-440 3 Kevin S. Beyer , Jonathan Goldstein, Raghu Ramakrishnan , Uri Shaft : When Is ''Nearest Neighbor'' Meaningful? ICDT 1999 : 217-235 2 Jonathan Goldstein, Raghu Ramakrishnan , Uri Shaft : Compressing Relations and Indexes. ICDE 1998 : 370-379 1 Jonathan Goldstein, Raghu Ramakrishnan , Uri Shaft , Jie-Bing Yu : Processing Queries By Linear Constraints. PODS 1997 : 257-267 ![]() DiSC'02 © 2003 Association for Computing Machinery |