| [1] |
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger.
The r*-tree: An efficient and robust access method for points and
rectangles.
In H. Garcia-Molina and H. V. Jagadish, editors, Proceedings of
the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic
City, NJ, May 23-25, 1990, pages 322-331. ACM Press, 1990. |
| [2] |
S. Berchtold, D. A. Keim, and H.-P. Kriegel.
The x-tree : An index structure for high-dimensional data.
In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda,
editors, VLDB'96, Proceedings of 22th International Conference on Very
Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India, pages 28-39.
Morgan Kaufmann, 1996. |
| [3] |
B. Bloom.
Space/time trade-offs in hash coding with allowable errors.
In Communications of the ACM, number 7 in 13, pages 422-426,
July 1970. |
| [4] |
C. Faloutsos and S. Chtistodoulakis.
Description and performance analysis of signature file methods for
office filing.
ACM Transactions on Office Information Systems, 5(3):237-257,
July 1987. |
| [5] |
L. Fan, P. Cao, J. Almeida, and A. Broder.
Summary cache: A scalable wide-area web cache sharing protocol.
In Proceedings of the ACM SIGCOMM '98 Conference on
Applications, Technologies, Architectures, and Protocols for Computer
Communication, August 31 - September 4, 1998, Vancouver, B.C., Canada. ACM,
1998, February 1998. [ .html ] |
| [6] |
N. Hachem, C. Bao, and S. Taylor.
Approximate query answering in numerical databases.
In P. P. Svensson and J. C. J. C. French, editors, Proceedings:
Eighth International Conference on Scientific and Statistical Database
Systems, June 18-20, 1996, Stockholm, Sweden, pages 63-75, 1109 Spring
Street, Suite 300, Silver Spring, MD 20910, USA, 1996. IEEE Computer Society
Press.
Described as proceedings. Also known as 8 SSDBM. IEEE cat no
96TB100051; Cover title: Eighth International conference on statistical
database management.Keywords: scientific database systems; statistical database systems;; IEEE; data engineering; statistical computing |
| [7] |
J. M. Hellerstein, J. F. Naughton, and A. Pfeffer.
Generalized search trees for database systems.
In U. Dayal, P. M. D. Gray, and S. Nishio, editors, VLDB'95,
Proceedings of 21th International Conference on Very Large Data Bases,
September 11-15, 1995, Zurich, Switzerland, pages 562-573. Morgan Kaufmann,
1995. |
| [8] |
D. Keim and H. Kriegel.
Issues in visualizing large databases.
In Proc. Conf. on Visual Database Systems (VDB'95), Lausanne,
Schweiz; Visual Database Systems, Chapman & Hall Ltd., pages 203-214, 1995. |
| [9] |
J. Marais and K. Bharat.
Supporting cooperative and personal surfing with a desktop assistant.
In In Proceedings of ACM UIST'97, October 1997. [ .pdf ] |
| [10] |
L. P. Sergey Brin.
The anatomy of a large-scale hypertextual web search engine, 1997. |
| [11] |
M. Waldvogel.
Fast Longest Prefix Matching: Algorithms, Analysis, and
Applications.
PhD thesis, ETH Zurich, 2000. |
This file has been generated by bibtex2html 1.78