Alternatives to conjunctive query processing in peer-to-peer file-sharing systems
Pages 1737 - 1741
Abstract
Peer-to-peer file-sharing systems suffer from the over-specification of query results due to the fact that query processing is conjunctive and the descriptions of shared files are sparse. Ultimately, longer queries, which should yield more accurate results, do the opposite. To alleviate this problem, we consider alternative means of query processing. That is, results are sent from the server to the client only if they are deemed relevant based on cosine similarity. Based on our results, these alternatives can increase query accuracy by 40% at virtually no cost.
References
[1]
D. Grossman, O. Frieder. Information Retrieval: Algorithms and Heuristics. Springer, 2nd ed., 2004.
[2]
K. Nakauchi, Y. Ishikawa, H. Morikawa, and T. Aoyama. Peer-to-peer keyword search using keyword relationship. In Proc. Wkshp. Global and Peer-to-Peer Comp. Large Scale Dist. Sys (GP2PC), 2003.
[3]
M. Nilsson. Id3v2 web site. www.id3.org. 2007.
[4]
I. Muslea and T. J. Lee. Online Query Relaxation via Bayesian Causal Structures Discovery. In Proc. AAAI, 2005.
[5]
C. Rohrs. Keyword matching {in gnutella}. Technical report, LimeWire, Dec. 2000. www.limewire.org/techdocs/KeywordMatching.htm.
[6]
S. Saroiu, P. K. Gummadi, S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proc. Multimed Comp. and Netw. (MMCN), 2002.
[7]
M. T. Schlosser, T. E. Condie, and S. D. Kamvar. Simulating a file-sharing p2p network. In Proc. Wkshp. Semantics in Peer-to-Peer and Grid Comp., 2003.
[8]
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, 2001.
[9]
C. Tang, Z. Xu, S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. In Proc. ACM SIGCOMM, Aug. 2003.
[10]
W. G. Yee, L. T. Nguyen, and O. Frieder. Masked Queries for Search Accuracy in Peer-to-Peer File-Sharing Systems. In Proc. IEEE IPDPS, 2007.
[11]
J. Lu and J. Callan. User modeling for full-text federated search in peer-to-peer networks. In Proc. ACM SIGIR, 2006.
[12]
J. Xu and W. B. Croft. Improving the effectiveness of information retrieval with local context analysis. ACM Trans. Info. Sys. 18(1), Jan., 2000.
[13]
H. V. Jagadish, B. C. Ooi, K.-L. Tan, Q. H. Vu, R. Zhang. Speeding up search in peer-to-peer networks with a multi-way tree structure. In Proc. ACM SIGMOD, 2006.
[14]
W.-T. Balke, W. Nejdl, W. Siberski, U. Thaden. Progressive Distributed Top k Retrieval in Peer-to-Peer Networks. In Proc. ICDE, 2005.
[15]
G. Skobeltsyn, T. Luu, I. Podnar Zarko, M. Rajman, K. Aberer: Web text retrieval with a P2P query-driven index. SIGIR 2007: 679--686.
[16]
P. Godfrey, Minimization in Cooperative Response to Failing Database Queries, International Journal of Cooperative Information System (IJCIS), World Scientific, 6(2):95--149, June 1997.
[17]
IIT P2P Information Retrieval System Web Site. www.ir.iit.edu/~waigen/pirs.
Index Terms
- Alternatives to conjunctive query processing in peer-to-peer file-sharing systems
Recommendations
Efficient Range Query Processing in Peer-to-Peer Systems
With the increasing popularity of the peer-to-peer (P2P) computing paradigm, many general range query schemes for distributed hash table (DHT)-based P2P systems have been proposed in recent years. Although those schemes can provide range query ...
Combining Joint and Semi-Join Operations for Distributed Query Processing
The application of a combination of join and semi-join operations to minimize the amount of data transmission required for distributed query processing is discussed. Specifically, two important concepts that occur with the use of join operations as ...
Comments
Information & Contributors
Information
Published In
March 2009
2347 pages
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 March 2009
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SAC09
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 117Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in