References

1

N. Beckmann, H.P.Kriegel, R.Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD, pages 322 - 331, May 1990.

2

T. Bially. Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Trans. on Information Theory, IT-15(6):658 - 664, November 1969.

3

Arthur R. Butz. Alternative algorithm for hilbert's space-filling curve. IEEE Trans on Computers, C-20(4):424 - 426, April 1971.

4

Y. Q. Chen, M. S. Nixon, and D. W. Thomas. Texture classification using statistical geometrical features. In IEEE International Conference on Image Processing, volume 3, pages 446 - 450, Austin, Texas, November 1994.

5

Myron Flickner, Harpreet Sawhney, Watne Niblack, Jonathan Ashley, Qian Huang, Byron Dom, Monika Gorkani, Jim Hafner, Denis Lee, Dragutin Petkovic, David Steele, and Peter Yanker. Query by image and video content: The qbic system. IEEE Computer, 28(9):23 - 32, September 1995.

6

Antonin Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 45 - 57, 1984.

7

Kamel. I and Faloutsos. C. Hilbert R-tree: an improved R-tree using fractals. In Proc. of Int. Conf. of Information and Knowledge Management, pages 490 - 499, 1993.

8

H. V. Jagadish. Linear clustering of objects with multiple attributes. In ACM SIGMOD Conf., pages 332 - 342, May 1990.

9

P. Lewis, J. Kuan, S. Perry, M. Dobie, H. Davis, and W. Hall. Navigating from images using generic links based on image content. In SPIE conference Storage and Retrieval for Image and Video Database, pages 238 - 248, San Jose, February 1997.

10

Nick Roussopoulos, Stephen Kelley, and Frédéric Vincent. Nearest neighbor queries. In Proceedings of the 1995 ACM-SIGMOD Intl.Conf. on Management of Data, San Jose, CA, June 1995.