-
1
-
-
0015489880
-
Organization and Maintenance of Large Ordered Indices
-
Bayer R., McCreight E.M.: 'Organization and Maintenance of Large Ordered Indices', Acta Informatica 1(3), 1977, pp. 173-189.
-
(1977)
Acta Informatica
, vol.1
, Issue.3
, pp. 173-189
-
-
Bayer, R.1
McCreight, E.M.2
-
2
-
-
0031168920
-
Fast Parallel Similarity Search in Multimedia Databases
-
Tucson, Arizona
-
Berchtold S., Böhm C., Braunmüller B., Keim D. A., Kriegel H.-P.: 'Fast Parallel Similarity Search in Multimedia Databases', Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, Tucson, Arizona.
-
(1997)
Proc. ACM SIGMOD Int. Conf. on Management of Data
-
-
Berchtold, S.1
Böhm, C.2
Braunmüller, B.3
Keim, D.A.4
Kriegel, H.-P.5
-
3
-
-
0012975570
-
Improving the Query Performance of High-Dimensional Index Structures Using Bulk-Load Operations
-
Valencia, Spain
-
Berchtold S., Böhm C., Kriegel H.-P.: 'Improving the Query Performance of High-Dimensional Index Structures Using Bulk-Load Operations', 6th. Int. Conf. on Extending Database Technology, Valencia, Spain, 1998.
-
(1998)
6th. Int. Conf. on Extending Database Technology
-
-
Berchtold, S.1
Böhm, C.2
Kriegel, H.-P.3
-
4
-
-
17944371868
-
-
submitted
-
Berchtold S., Böhm C., Keim D., Kriegel H.-P., Xu X.: 'Optimal Multidimensional Query Processing Using Tree Striping', submitted.
-
Optimal Multidimensional Query Processing Using Tree Striping
-
-
Berchtold, S.1
Böhm, C.2
Keim, D.3
Kriegel, H.-P.4
Xu, X.5
-
5
-
-
0030679825
-
A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space
-
Tucson, Arizona
-
Berchtold S., Böhm C., Keim D., Kriegel H.-P.: 'A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space', ACM PODS Symposium on Principles of Database Systems, 1997, Tucson, Arizona.
-
(1997)
ACM PODS Symposium on Principles of Database Systems
-
-
Berchtold, S.1
Böhm, C.2
Keim, D.3
Kriegel, H.-P.4
-
6
-
-
0001802606
-
The X-Tree: An Index Structure for High-Dimensional Data
-
Bombay, India
-
Berchtold S., Keim D., Kriegel H.-P.: 'The X-Tree: An Index Structure for High-Dimensional Data', 22nd Conf. on Very Large Databases, 1996, Bombay, India, pp. 28-39.
-
(1996)
22nd Conf. on Very Large Databases
, pp. 28-39
-
-
Berchtold, S.1
Keim, D.2
Kriegel, H.-P.3
-
7
-
-
0031653130
-
Fast Nearest Neighbor Search in High-Dimensional Spaces
-
Orlando
-
Berchtold S., Ertl B., Keim D., Kriegel H.-P., Seidl T.: 'Fast Nearest Neighbor Search in High-Dimensional Spaces', Proc. 14th Int. Conf. on Data Engineering, Orlando, 1998.
-
(1998)
Proc. 14th Int. Conf. on Data Engineering
-
-
Berchtold, S.1
Ertl, B.2
Keim, D.3
Kriegel, H.-P.4
Seidl, T.5
-
9
-
-
0025447750
-
The R*-tree: An Efficient and Robust Access Method for Points and Rectangles
-
Atlantic City, NJ
-
Beckmann N., Kriegel H.-P., Schneider R., Seeger B.: 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles', Proc. ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322-331.
-
(1990)
Proc. ACM SIGMOD Int. Conf. on Management of Data
, pp. 322-331
-
-
Beckmann, N.1
Kriegel, H.-P.2
Schneider, R.3
Seeger, B.4
-
10
-
-
0018480749
-
The Ubiquitous B-tree
-
Comer D.: 'The Ubiquitous B-tree', ACM Computing Surveys 11(2), 1979, pp. 121-138
-
(1979)
ACM Computing Surveys
, vol.11
, Issue.2
, pp. 121-138
-
-
Comer, D.1
-
11
-
-
0031166712
-
Data Warehousing and OLAP for Decision Support
-
Tucson, Arizona
-
Chaudhuri S., Dayal U.: 'Data Warehousing and OLAP for Decision Support', Tutorial, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, Tucson, Arizona.
-
(1997)
Tutorial, Proc. ACM SIGMOD Int. Conf. on Management of Data
-
-
Chaudhuri, S.1
Dayal, U.2
-
12
-
-
34249772390
-
Efficient and Effective Querying by Image Content
-
Faloutsos C., Barber R., Flickner M., Hafner J., et al.: 'Efficient and Effective Querying by Image Content', Journal of Intelligent Information Systems, 1994, Vol. 3, pp. 231-262.
-
(1994)
Journal of Intelligent Information Systems
, vol.3
, pp. 231-262
-
-
Faloutsos, C.1
Barber, R.2
Flickner, M.3
Hafner, J.4
-
14
-
-
84945709355
-
An Algorithm for Finding Best Matches in Logarithmic Expected Time
-
September
-
Friedman J. H., Bentley J. L., Finkel R. A.: 'An Algorithm for Finding Best Matches in Logarithmic Expected Time', ACM Transactions on Mathematical Software, Vol. 3, No. 3, September 1977, pp. 209-226.
-
(1977)
ACM Transactions on Mathematical Software
, vol.3
, Issue.3
, pp. 209-226
-
-
Friedman, J.H.1
Bentley, J.L.2
Finkel, R.A.3
-
15
-
-
84957646742
-
Ranking in Spatial Databases
-
Portland, ME
-
Hjaltason G. R., Samet H.: 'Ranking in Spatial Databases', Proc. 4th Int. Symp. on Large Spatial Databases, Portland, ME, 1995, pp. 83-95.
-
(1995)
Proc. 4th Int. Symp. on Large Spatial Databases
, pp. 83-95
-
-
Hjaltason, G.R.1
Samet, H.2
-
17
-
-
0029772894
-
Similarity Indexing: Algorithms and Performance
-
San Jose, CA
-
Jain R, White D.A.: 'Similarity Indexing: Algorithms and Performance', Proc. SPIE Storage and Retrieval for Image and Video Databases IV, Vol. 2670, San Jose, CA, 1996, pp. 62-75.
-
(1996)
Proc. SPIE Storage and Retrieval for Image and Video Databases IV
, vol.2670
, pp. 62-75
-
-
Jain, R.1
White, D.A.2
-
19
-
-
34249762939
-
The TV-Tree: An Index Structure for High-Dimensional Data
-
Lin K., Jagadish H. V., Faloutsos C.: 'The TV-Tree: An Index Structure for High-Dimensional Data', VLDB Journal, Vol. 3, pp. 517-542, 1995.
-
(1995)
VLDB Journal
, vol.3
, pp. 517-542
-
-
Lin, K.1
Jagadish, H.V.2
Faloutsos, C.3
-
21
-
-
85010847034
-
The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes
-
Robinson J. T.: 'The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes', Proc. ACM SIGMOD Int. Conf. on Management of Data, 1981, pp. 10-18.
-
(1981)
Proc. ACM SIGMOD Int. Conf. on Management of Data
, pp. 10-18
-
-
Robinson, J.T.1
|