ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Schema-assisted peer selection for XML querying in unstructured P2P systems
Full text PdfPdf (309 KB)
Source International Workshop on Data Engineering for Wireless and Mobile Access archive
Proceedings of the Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access table of contents
Vancouver, Canada
SESSION: Caching and replication table of contents
Pages: 31-38  
Year of Publication: 2008
ISBN:978-1-60558-221-4
Authors
Christos Doulkeridis  Athens University of Economics and Business, Greece
Kjetil Nørvåg  NTNU, Trondheim, Norway
Michalis Vazirgiannis  Athens University of Economics and Business, Greece
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 22,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1626536.1626543
What is a DOI?

ABSTRACT

XML is emerging as the de-facto standard for semistructured contents and metadata. Searching this content in mobile environments is challenging, since centralized approaches are not appropriate in a very dynamic environment with limited resources available for keeping a centralized index up-to-date. A more appropriate solution is to organize the mobile devices in an unstructured peer-to-peer (P2P) network. The main challenge in the context of unstructured P2P is to determine the peers that might store documents matching a query, i.e., peer selection. In this paper, we propose a summary caching method for increasing the efficiency and recall of peer selection during XML querying. Our approach is based on caching parts of XML schemas along the query path, to enable subsequent jumps to remote peers storing content relevant to the query. We evaluate the performance improvements of our search strategy in terms of completeness of the search and reduced latency. The results show that our approach can significantly enhance a naive query mechanism such as flooding, and consistently outperform a baseline path caching technique similar to techniques used in related work.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. Bhattacharjee, S. Chawathe, V. Gopalakrishnan, P. Keleher, and B. Silaghi. Efficient Peer-to-Peer Searches Using Result-caching. In Proceeding of IPTPS'03, 2003.
 
2
I. Brunkhorst, H. Dhraief, A. Kemper, W. Nejdl, and C. Wiesner. Distributed queries and query optimization in schema-based P2P-systems. In Proceedings of DBISP2P'03, 2003.
3
 
4
 
5
 
6
L. Galanis, Y. Wang, S. Jeffery, and D. DeWitt. Processing queries in a large peer-to-peer system. In Proceedings of CAISE'03, 2003.
7
 
8
 
9
G. Koloniari and E. Pitoura. Content based routing of path queries in peer-to-peer systems. In Proceedings of EDBT'04, 2004.
10
 
11
12
13
 
14
15
 
16
 
17
C. Sartiani, P. Manghi, G. Ghelli, and G. Conforti. XPeer: A self-organizing XML P2P database system. In Proceedings of EDBT Workshops 2004, 2004.
18
 
19
K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In Proceedings of INFOCOM'03, 2003.
 
20
 
21
 
22

Collaborative Colleagues:
Christos Doulkeridis: colleagues
Kjetil Nørvåg: colleagues
Michalis Vazirgiannis: colleagues