Fast retrieval of high-dimensional feature vectors in P2P networks using compact peer data summaries

Proceedings of the 5th ACM SIGMM International Workshop on Multimedia Information Retrieval, MIR 2003

Volumn , Issue , 2003, Pages 79-86

  Müller, Wolfgang ^a   Henrich, Andreas ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT BASED RETRIEVAL; DISTRIBUTED COMPUTER SYSTEMS; IMAGE RETRIEVAL; INFORMATION RETRIEVAL;

COMMUNICATION OVERHEADS; CONTENT-BASED IMAGE RETRIEVAL; CURSE OF DIMENSIONALITY; DATA REPRESENTATIONS; HIGH DIMENSIONAL FEATURE; MULTIDIMENSIONAL SEARCH; PEER-TO-PEER SYSTEM; UNIQUE IDENTIFIERS;

PEER TO PEER NETWORKS;

EID: 84862460783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/973264.973278     Document Type: Conference Paper

References (29)

1. C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the Surprising Behavior of Distance Metrics in High Dimensional Space. In 8th Intl. Conf. on Database Theory, 2001.
2. H. Balakrishnan, M. F. Kasshoek, D. Karger, R. Morris, and I. Stoica. Looking Up data in P2P Systems. Communications of the ACM, 46(2):43-48, February 2003.
3. ∗-tree: an efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD, Atlantic City, NJ, 1990.
4. The Benchathlon Network. URL: http://www.benchathlon. net.
5. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An Index Structure for High-Dimensional Data. In Proc. 22nd VLDB, San Francisco, CA, 1996.
6. J. P. Callan, Z. Lu, and W. B. Croft. Searching Distributed Collections with Inference Networks. In Proc. 18th ACM SIGIR, Seattle, Washington, 1995.
7. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In H. Federrath, editor, Designing Privacy Enhancing Technologies, volume 2009 of LNCS, 2000.
8. Clip2. The Gnutella Protocol Specification v0.4. URL: http://www9.limewire.com/developer/gnutella protocol 0.4.pdf, 2000.
9. F. M. Cuenca-Acuna and T. D. Nguyen. Text-Based Content Search and Retrieval in ad hoc P2P Communities. Technical Report DCS-TR-483, Department of Computer Science, Rutgers University, 2002.
10. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. JASIS, 41(6):391-407, 1990.
11. I. S. Dhillon and D. S. Modha. A data-clustering algorithm on distributed memory multiprocessors. In Large-Scale Parallel Data Mining, LNAI, 2000.
12. M. Eisenhardt, W. Müller, and A. Henrich. Classifying documents by distributed P2P clustering. submitted for publication, 2003.
13. Gnunet homepage. URL: http://www.gnu.org/software/GNUnet/.
14. L. Gravano, H. Garcia-Molina, and A. Tomasic. The Effectiveness of GlOSS for the Text Database Discovery Problem. In SIGMOD Conf., Minneapolis, MN, USA, 1994.
15. J. Hafner, H. S. Sawhney, W. Equitz, M. Flickner, and W. Niblack. Efficient color histogram indexing for quadratic form distance functions. IEEE Transactions on PAMI, 17(7):729-736, 1995.
16. M. Harren, J. M. Hellerstein, R. Huebsch, B. T. Loo, S. Shenker, and I. Stoica. Complex Queries in DHT-based Peer-to-Peer Networks. In F. Kaashoek and A. Rowstron, editors, 1st Intl. Workshop on Peer-to-Peer Systems, MIT, Cambridge, MA, USA, 2002.
17. S. Joseph. Adaptive routing in distributed decentralized systems: Neurogrid, gnutella and freenet. In Proc. of workshop on Infrastructure for Agents, MAS, and Scalable MAS, at Autonomous Agents, Montreal, Canada, 2001.
18. A. Z. Kronfol. A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine. URL: http://www.searchlore.org/library/kronfol final thesis.pdf, May 2002. Final Thesis, Princeton.
19. C. H. Ng and K. C. Sia. Peer clustering and firework query model. In Poster Proc. of The 11th Interational World Wide Web Conf., Honululu, HI, USA, 2002.
20. C. H. Ng, K. C. Sia, and C. H. Chang. Advanced peer clustering and firework query model in the peer-to-peer network. poster in WWW2003, (accepted), 2003.
21. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proc. 2001 Conf. on applications, technologies, architectures, and protocols for computer communications, San Diego, CA, United States, 2001.
22. J. Ritter. Why Gnutella Can't Scale. No, Really. URL: http://www.darkridge.com/~jpr5/doc/gnutella.html, February 2001.
23. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proc. 18th IFIP/ACM Intl. Conf. on Distributed Systems Platforms (Middleware), Heidelberg, Germany, 2001.
24. A. W. Smeulders, M. Worring, S. Santini, A. Gupta, and R. Jain. Content based retrieval at the end of the early years. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(12):1349-1380, 2000.
25. D. M. Squire, W. Müller, H. Müller, and J. Raki. Content-based query of image databases, inspirations from text retrieval: inverted files, frequency-based weights and relevance feedback. In 11th Scandinavian Conf. on Image Analysis, Kangerlussuaq, Greenland, 1999.
26. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proc. ACM SIGCOMM Conf., San Diego, CA, USA, 2001.
27. C. Tang, Z. Xu, and M. Mahalingam. pSearch: Information retrieval in structured overlays. In First Workshop on Hot Topics in Networks (HotNets-I), Princeton, NJ, 2002.
28. N. Vasconcelos. Bayesian Models for Visual Information Retrieval. PhD thesis, MIT, June 2000.
29. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. Intl. Conf. on VLDB, New York, USA, 1998.