Show simple item record

dc.contributor.authorBhattacharya, Indrajiten_US
dc.contributor.authorKashyap, Srinivas R.en_US
dc.contributor.authorParthasarathy, Srinivasanen_US
dc.date.accessioned2004-05-31T21:10:32Z
dc.date.available2004-05-31T21:10:32Z
dc.date.created2004-02en_US
dc.date.issued2004-02-25en_US
dc.identifier.urihttp://hdl.handle.net/1903/537
dc.description.abstractWe consider the problem of handling "similarity queries" in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the set of objects in the database that are semantically related to the query. Our schemes can be implemented on a variety of structured overlays such as CAN, CHORD, Pastry, and Tapestry. We provide analytical and experimental evaluation of our schemes in terms of the search accuracy, search cost, and load balancing. Our analytical guarantees perfectly predict the experimentally observed trends for the search accuracy.en_US
dc.format.extent110551 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4558en_US
dc.titleSimilarity Searching in Peer-to-Peer Databasesen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtComputer Science Department Technical Reportsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record