Mobile P2P fast similarity search

Authors:
Thomas Bocek;Fabio Victora Hecht;David Hausheer;Ela Hunt;Burkhard Stiller
Affiliations:
Department of Informatics, IFI, University of Zurich, Switzerland;Department of Informatics, IFI, University of Zurich, Switzerland;Department of Informatics, IFI, University of Zurich, Switzerland;CIS, University of Strathclyde, UK;Department of Informatics, IFI, University of Zurich, Zurich, Switzerland
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 2
Cited 0

Evaluating a Spelling Support in a Search Engine

NLDB '02 Proceedings of the 6th International Conference on Applications of Natural Language to Information Systems-Revised Papers
Distributed pattern matching: a key to flexible and efficient P2P search

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In informal data sharing environments, misspellings cause problems for data indexing and retrieval. This is even more pronounced in mobile environments, in which devices with limited input devices are used. In a mobile environment, similarity search algorithms for finding misspelled data need to account for limited CPU and bandwidth. This demo shows P2P fast similarity search (P2PFastSS) running on mobile phones and laptops that is tailored to uncertain data entry and uses available resources efficiently. In this demo, users publish and search for textual content containing misspellings without relying on query logging, as done by Google, and with a minimum distributed indexing infrastructure. Similarity search is supported by using the concept of deletion neighborhood to evaluate the edit distance metric of string similarity.