Extending metric index structures for efficient range query processing

Knowledge and Information Systems

Volumn 10, Issue 2, 2006, Pages 211-227

  Kailing, Karin ^a   Kriegel, Hans Peter ^a   Pfeifle, Martin ^a   Schönauer, Stefan ^a,b  

^a UNIVERSITY OF MUNICH   (Germany)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Complex objects; Density based clustering; Metric indexing; Multi step query processing

Indexed keywords

DATABASE SYSTEMS; QUERY PROCESSING; TREES (MATHEMATICS);

COMPLEX OBJECTS; DENSITY-BASED CLUSTERING; INDEX STRUCTURE; METRIC INDEXING; MULTI-STEP; MULTIMEDIA APPLICATIONS; RANGE QUERY PROCESSING; SIMILARITY MEASURE;

INDEXING (MATERIALS WORKING);

EID: 33747178932     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-006-0018-6     Document Type: Article

References (18)

1. Agrawal R, Faloutsos C, Swami AN (1993) Efficient similarity search in sequence databases. In: Proceedings of the 4th international conference of foundations of data organization and algorithms (FODO), pp 69-84
2. Ankerst M, Breunig MM, Kriegel H-P, Sander J (1999) OPTICS: Ordering points to identify the clustering structure. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD'99), Philadelphia, PA, pp 49-60
3. Brecheisen S, Kriegel H-P, Kröger P, Pfeifle M (2004) Visually mining through cluster hierarchies. In: Proceedings of the SIAM international conference on data mining (SDM'04), Orlando, FL
4. Chavez E, Navarro G, Baeza-Yates R, Marroquin JL (2001) Searching in metric spaces. ACM Comput Surv 33(3):273-321
5. Ciaccia P, Patella M, Zezula P (1997) M-tree: An efficient access method for similarity search in metric spaces. In: VLDB'97, Proceedings of the 23rd international conference on very large databases, August 25-29, 1997, Athens, Greece, pp 426-435
6. Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd international conference on knowledge discovery and data mining (KDD'96), Portland, OR, pp 291-316
7. Kailing K, Kriegel H-P, Pfeifle M, Schönauer S (2004) Efficient indexing of complex objects for density-based clustering. In: Proceedings of the 5th international workshop on multimedia data mining (MDM/KDD), Seattle, WA, pp 28-37
8. Kailing K, Kriegel H-P, Pryakhin A, Schubert M (2004) Clustering multi-represented objects with noise. In: Proceedings of the 8th Pacific-Asia conference on knowledge discovery and data mining (PAKDD'04), Sydney, Australia, pp 394-403
9. Kailing K, Kriegel, H-P, Schönauer S, Thomas S (2004) Efficient similarity search for hierachical data in large databases. In: Proceedings of the 9th international conference on extending database technology (EDBT 2004), pp 676-693
10. Kriegel H-P, Brecheisen S, Krger P, Pfeifle M, Schubert M (2003) Using sets of feature vectors for similarity search on voxelized cad objects. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD'03), San Diego, CA, pp 587-598
11. Kriegel H-P, Schönauer S (2003) Similarity search in structured data. In: Proceedings of the 5th international conference, DaWaK 2003, Prague, Czech Republic, pp 309-319
12. Kuhn H (1955) The Hungarian method for the assignment problem. Naval Res Logist Quart 2:83-97
13. Munkres J (1957) Algorithms for the assignment and transportation problems. J SIAM 6:32-38
14. Nierman A, Jagadish HV (2002) Evaluating structural similarity in XML documents. In: Proceedings of the 5th international workshop on the web and databases (WebDB 2002), Madison, Wisconsin, USA, pp 61-66
15. Sebastian TB, Klein PN, Kimia BB (2001) Recognition of shapes by editing shock graphs. In: Proceedings of the 8th international conference on computer vision (ICCV'01), Vancouver, BC, Canada, vol 1, pp 755-762
16. Traina C Jr., Traina A, Seeger B, Faloutsos C (2000) Slim-trees: High performance metric trees minimizing overlap between nodes. In: Proceedings of the 7th international conference on extending database technology, Konstanz, Germany, March 27-31, 2000, pp 51-65
17. Wang JTL, Zhang K, Chang G, Shasha D (2002) Finding approximate patterns in undirected acyclic graphs. Pattern Recog 35(2):473-483
18. Zhang K, Wang J, Shasha D (1996) On the editing distance between undirected acyclic graphs. Int J Found Comput Sci 7(1):43-57