Approximate retrieval of high-dimensional data with L1 metric by spatial indexing

New Generation Computing

Volumn 18, Issue 1, 2000, Pages 39-47

  Shinohara, Takeshi ^a   An, Jiyuan ^a   Ishizaka, Hiroki ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA ACQUISITION; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; QUERY LANGUAGES; TREES (MATHEMATICS);

EUCLIDEAN METRIC; HIGH-DIMENSIONAL DATA;

DATA STRUCTURES;

EID: 0033895454     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037567     Document Type: Article

References (7)

1. Beckmann, N., Kriegal, H. P., Schneider, R. and Seeger, B., "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles," in Proc. ACM SIGMOD International Conference on Management of Data, 19(2), pp. 322-331, 1990.
2. Bially, T., "Space-filling Curves: Their Generation and Their Application to Bandwidth Reduction," IEEE Trans, on Information Theory, IT-15 (6), pp. 658-664, 1969.
3. Faloutsos, C. and Roseman, S., "Fractals for Secondary Key Retrieval," in Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 247-252, 1989.
4. Faloutsos, C. and Lin, K. I., "FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets," in Proc. ACM SIGMOD International Conference on Management of Data, 24 (2), pp. 163-174, 1995.
5. Guttman, A., "R-tree: A Dynamic Index Structure for Spatial Searching," in Proc. ACM SIGMOD, pp. 47-57, 1984.
6. Kamel, I. and Faloutsos, C., "On Packing R-trees," in Proc. 2nd. International Conference on Information and Knowledge Management, pp. 490-499, 1993.
7. Otterman, M., "Approximate Matching with High Dimensionality R-trees," M. Sc. Scholarly paper, Dept. of Computer Science, Univ. of Maryland, 1992.