String matching with metric trees using an approximate distance

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

Volumn 2476, Issue , 2002, Pages 271-283

  Bartolini, Ilaria ^a   Ciaccia, Paolo ^a   Patella, Marco ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; FILTRATION; INFORMATION RETRIEVAL; PATTERN RECOGNITION;

APPROXIMATE DISTANCE FUNCTIONS; EDIT DISTANCE; LARGE DATASETS; METRIC TREES; MODERN APPLICATIONS; STRING MATCHING;

FORESTRY;

EID: 84958759968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_24     Document Type: Conference Paper

References (19)

1. Project Gutenberg official home site. http://www.gutenberg.net/.
2. R. Baeza-Yates and G. Navarro. Fast approximate string matching in a dictionary. In Proceedings of the 5th String Processing and Information Retrieval Symposium (SPIRE’98), Santa Cruz, Bolivia, Sept. 1998.
3. S. Berretti, A. Del Bimbo, and P. Pala. Retrieval by shape similarity with perceptual distance and effective indexing. IEEE Transaction on Multimedia, 2(4):225–239, Dec. 2000.
4. T. Bozkaya and M. Özsoyoglu. Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems, 24(3):361–404, Sept. 1999.
5. S. Brin. Near neighbor search in large metric spaces. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB’95), pages 574–584, Zurich, Switzerland, Sept. 1995.
6. W.A. Burkhard and R.M. Keller. Some approaches to best-match file searching. Communications of the ACM, 16(4):230–236, Apr. 1973.
7. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273–321, Sept. 2001.
8. W. Chen and K. Aberer. Efficient querying on genomic databases by using metric space indexing techniques. In 1st International Workshop on Query Processing and Multimedia Issues in Distributed Systems (QPMIDS’97), Toulouse, France, Sept. 1997.
9. P. Ciaccia, M. Patella, and P. Zezula: M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB’97), pages 426–435, Athens, Greece, Aug. 1997.
10. P. Ciaccia, M. Patella, and P. Zezula. A cost model for similarity queries in metric spaces. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98), pages 59–68, Seattle, WA, June 1998.
11. T. Kahveci and A. K. Singh. An efficient index structure for string databases. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB 2001), pages 351–360, Rome, Italy, Sept. 2001.
12. G. Navarro. Multiple approximate string matching by counting. In Proceedings of the 4th South American Workshop on String Processing (WSP’97), pages 125–139, Valparaiso, Chile, Nov. 1997.
13. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31–88, Mar. 2001.
14. G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4):19–27, Dec. 2001. Special Issue on Text and Databases.
15. S. Santini. Exploratory Image Databases: Content-Based Retrieval. Series inCommunications, Networking, and Multimedia. Academic Press, 2001.
16. C. Traina Jr., A. J.M. Traina, and C. Faloutsos: Distance exponent: A new concept for selectivity estimation in metric trees. In Proceedings of the 16th International Conference on Data Engineering (ICDE 2000), page 195, San Diego, CA, Mar. 2000.
17. C. Traina Jr., A. J. M. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization of metric data sets using Slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244–260, Mar. 2002.
18. E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6(1):132–137, Mar. 1985.
19. R.A. Wagner and M. J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168–173, Jan. 1974.