Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Conference or Workshop Paper |
| Scope | Discipline-based scholarship |
| Published in Proceedings | No |
| Title | Mobile P2P Fast Similarity Search |
| Organization Unit | |
| Authors |
|
| Presentation Type | other |
| Item Subtype | Original Work |
| Refereed | Yes |
| Status | Published in final form |
| Language |
|
| Event Title | 6th IEEE Consumer Communications and Networking Conference (CCNC 2009) |
| Event Type | conference |
| Event Location | Las Vegas, Nevada, USA |
| Event Start Date | January 10 - 2009 |
| Event End Date | January 13 - 2009 |
| Abstract Text | 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. |
| Official URL | http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4785013&isnumber=4784684 |
| Digital Object Identifier | 10.1109/CCNC.2009.4785013 |
| Other Identification Number | merlin-id:239 |
| PDF File |
Download from ZORA
|
| Export |
BibTeX
EP3 XML (ZORA)
|
| Additional Information | © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |