Optimal Dimension Order: A generic technique for the similarity join

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2454 LNCS, Issue , 2002, Pages 135-149

  Böhm, Christian ^a   Krebs, Florian ^b   Kriegel, Hans Peter ^b  

^a UNIVERSITY FOR HEALTH SCIENCES   (Austria)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; DECISION TREES; FORESTRY; VECTOR SPACES; WAREHOUSES; DATA MINING;

COMPUTATIONAL OVERHEADS; DIMENSION ORDERINGS; DISTANCE CALCULATION; DISTANCE COMPUTATION; EXPERIMENTAL EVALUATION; MULTI-DIMENSIONAL VECTORS; PROBABILITY MODELING; SIMILARITY SEARCH;

DATA MINING; ALGORITHMS;

EID: 84864835440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46145-0_14     Document Type: Conference Paper

References (20)

1. Ankerst M., Breunig M.M., Kriegel H.-P., Sander J.: OPTICS: Ordering Points To Identify the Clustering Structure, ACM SIGMOD Int. Conf. on Management of Data, 1999.
2. Agrawal R., Lin K., Sawhney H., Shim K.: Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases, Int. Conf. on Very Large Data Bases (VLDB), 1995.
3. Arge L., Procopiuc O., Ramaswamy S., Suel T., Vitter J.S.: Scalable Sweeping-Based Spatial Join, Int. Conf. on Very Large Databases (VLDB), 1998.
4. Böhm C., Braunmüller B., Breunig M.M., Kriegel H.-P.: Fast Clustering Based on High-Dimensional Similarity Joins, Int. Conf. on Information Knowledge Management (CIKM), 2000.
5. Berchtold S., Böhm C., Jagadish H.V., Kriegel H.-P., Sander J.: Independent Quantization: An Index Compression Technique for High Dimensional Spaces, IEEE Int. Conf. on Data Engineering (ICDE), 2000.
6. Berchtold S., Böhm C., Keim D., Kriegel H.-P.: A Cost Model For Neurest Neighbor Search in High-Dimensional Data Space, ACM Symposium on Principles of Database Systems (PODS), 1997.
7. Böhm C., Braunmüller B., Krebs F., Kriegel H.-P.: Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data, ACM SIGMOD Int. Conf. on Management of Data, 2001.
8. Böhm C., Kriegel H.-P.: A Cost Model und Index Architecture for the Similarity Join, IEEE Int. Conf. on Data Engineering (ICDE), 2001.
9. Brinkhoff T., Kriegel H.-P., Seeger B.: Efficient Processing of Spatial Joins Using R-trees, ACM SIGMOD Int. Conf. on Management of Data, 1993.
10. Brinkhoff T., Kriegel H.-P., Seeger B.: Parallel Processing of Spatial Joins Sing R-trees, IEEE Int. Conf. on Data Engineering (ICDE), 1996.
11. Huang Y.-W., Jing N., Rundensteiner E. A.: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations, Int. Conf. on Very Large Databases (VLDB), 1997.
12. Koudas N., Sevcik C.: Size Separation Spatial Join, ACM SIGMOD Int. Conf. on Managern. of Data, 1997.
13. Koudas N., Sevcik C.: High Dimensional Similarity Joins: Algorithms and Performance Evaluation, IEEE Int. Conf. on Data Engineering (ICDE), Best Paper Award, 1998.
14. Lo M.-L., Ravishankar C.V.: Spatial Joins Using Seeded Trees, ACM SIGMOD Int. Conf., 1994.
15. Lo M.-L., Ravishankar C.V.: Spatial Hash Joins, ACM SIGMOD Int. Conf, 1996.
16. Patel J.M., DeWitt D.J., Partition Based Spatial-Merge Join, ACM SIGMOD Int. Conf., 1996.
17. Preparata F.P., Shamos M.I.: 'Computational Geometry', Chapter 5 ('Proximity: Fundamental Algorithms'), Springer Verlag New York, 1985.
18. Sander J., Ester M., Kriegel H.-P., Xu X.: Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and its Applications, Data Mining and Knowledge Discovery, Vol. 2, No. 2, 1998.
19. Shim K., Srikant R., Agrawal R.: High-Dimensional Similarity Joins, Int. Conf. on Data Engineering, 1997.
20. Ullman J.D.: Database and Knowledge-Base Systems, Vol. II, Computer Science Press, Rockville MD, 1989