-
1
-
-
0025447750
-
The R*-tree: An efficient and robust access method for points and rectangles
-
N. Berkmann, H.-P. Krigel. R. Schneider, and B. Seeger. (1990) "The R*-tree: an Efficient and Robust Access Method for Points and Rectangles" ACM SIGMOD 90, pages 322-331.
-
(1990)
ACM SIGMOD 90
, pp. 322-331
-
-
Berkmann, N.1
Krigel, H.-P.2
Schneider, R.3
Seeger, B.4
-
2
-
-
0031162081
-
The SR-tree: An index structure for high-dimensional nearest neighbor queries
-
N. Katayama and S. Satoh. (1997) "The SR-tree: an Index Structure for High-dimensional Nearest Neighbor Queries ACM SIGMOD 97, pages 369-380.
-
(1997)
ACM SIGMOD 97
, pp. 369-380
-
-
Katayama, N.1
Satoh, S.2
-
3
-
-
0029752929
-
Similarity indexing with the SS-tree
-
D. A. White and R. Jain.(1996) "Similarity Indexing with the SS-tree" ICDE 96, pages 516-523.
-
(1996)
ICDE 96
, pp. 516-523
-
-
White, D.A.1
Jain, R.2
-
4
-
-
34249762939
-
The TV-tree: An index structure for high-dimensional data
-
K.-I. Lin, H. V. Jagadish, and C. Faloutsos. (1994) "The TV-tree: An Index Structure for High-Dimensional Data" VLDB Journal, Vol. 3, No. 4, pages 517-542.
-
(1994)
VLDB Journal
, vol.3
, Issue.4
, pp. 517-542
-
-
Lin, K.-I.1
Jagadish, H.V.2
Faloutsos, C.3
-
5
-
-
0026256261
-
Satisfying general proximity/ similarity queries with metric trees
-
J. K. Uhlmann.(1991) "Satisfying General Proximity/ Similarity Queries with Metric Trees", Information Processing Letters, vol 40, pages 175-179.
-
(1991)
Information Processing Letters
, vol.40
, pp. 175-179
-
-
Uhlmann, J.K.1
-
6
-
-
46249119876
-
M-tree: A dynamic index for similarity queries in multimedia databases
-
HERMES ESPRIT LTR Project
-
P. Zezula, P. Ciaccia, and F. Rabitti.(1996) "M-tree: A Dynamic Index for Similarity Queries in Multimedia Databases" TR 7, HERMES ESPRIT LTR Project.
-
(1996)
TR
, vol.7
-
-
Zezula, P.1
Ciaccia, P.2
Rabitti, F.3
-
7
-
-
0031162001
-
Distance-based indexing for high-dimensional metric spaces
-
T. Bozkaya, M. Ozsoyoglu.(1997) "Distance-based Indexing for High-dimensional Metric Spaces" ACM SIGMOD 97, page 357-368.
-
(1997)
ACM SIGMOD 97
, pp. 357-368
-
-
Bozkaya, T.1
Ozsoyoglu, M.2
-
8
-
-
84993661659
-
M-tree: An efficient access method for similarity search in metric spaces
-
Greece
-
P. Ciaccia, M. Patella, P. Zezula.(1997) "M-tree: An Efficient Access Method for Similarity Search in Metric Spaces" VLDB 97, Greece.
-
(1997)
VLDB 97
-
-
Ciaccia, P.1
Patella, M.2
Zezula, P.3
-
10
-
-
84937433025
-
Slim-trees: High performance metric trees minimizing overlap between nodes
-
C. Traina Jr, A. Traina, B. Seeger, C. Faloutsos (2000) "Slim-trees: High Performance Metric Trees Minimizing Overlap Between Nodes. EDBT 2000, pages 51-65.
-
(2000)
EDBT 2000
, pp. 51-65
-
-
Traina Jr., C.1
Traina, A.2
Seeger, B.3
Faloutsos, C.4
-
12
-
-
0037948284
-
Managing very large document collections using semantics
-
G. Wang, H. Lu, G. Yu, Y. Bao (2003). "Managing Very Large Document Collections Using Semantics." Journal of Computer Science and Technology, 18(3): 403-406.
-
(2003)
Journal of Computer Science and Technology
, vol.18
, Issue.3
, pp. 403-406
-
-
Wang, G.1
Lu, H.2
Yu, G.3
Bao, Y.4
-
13
-
-
24544436399
-
High-dimensional Spaces - Index structures for improving the performance of multimedia databases
-
2002
-
C. Böhm, S. Berchtold, D. A. Keim (2002), "High-dimensional Spaces - Index Structures for Improving the Performance of Multimedia Databases". ACM Computing Surveys, 2002.
-
(2002)
ACM Computing Surveys
-
-
Böhm, C.1
Berchtold, S.2
Keim, D.A.3
|