Article

SRI: exploiting semantic information for effective query routing in a PDMS

Authors:

Federica Mandreoli,

Riccardo Martoglia,

Simona Sassatelli,

Wilma PenzoAuthors Info & Claims

WIDM '06: Proceedings of the 8th annual ACM international workshop on Web information and data management

Pages 19 - 26

https://doi.org/10.1145/1183550.1183556

Published: 10 November 2006 Publication History

Abstract

The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMSs). In a PDMS, peers have a schema on their local data, and they are related each other through semantic mappings that can be defined between their own schemas.Querying a PDMS means either flooding the network with messages to all peers or take advantage of a routing mechanism to reformulate a query only on the best peers selected according to some given criteria. As reformulations may lead to semantic approximations, we deem that such approximations can be exploited for locating the semantically best directions to forward a query to.In this paper, we propose a distributed index mechanism where each peer is provided with a Semantic Routing Index (SRI) for routing queries effectively. A fuzzy-oriented model for SRI is presented where operations for creating and maintaining SRIs are well-founded. In addition, we show how SRIs can be employed in the query processing phase with the aim of reducing the space of reformulations. Finally, we conduct a series of meaningful experiments showing the effectiveness of the proposed approach.

References

[1]

BRITE. http://www.cs.bu.edu/brite/.

[2]

Gnutella. http://www.gnutella.com/.

[3]

Napster. http://www.napster.com/.

[4]

M. Arenas, V. Kantere, A. Kementsietsidis, I. Kiringa, R. Miller, and J. Mylopoulos. The hyperion project: from data integration to data coordination. SIGMOD Record, 32(3):53--58, 2003.

Digital Library

[5]

M. Ben-Akiva and S. Lerman. Discrete Choice Analysis: Theory and Application to Travel Demand. The MIT Press, 1985.

[6]

B. Cooper. Using Information Retrieval Techniques to Route Queries in an InfoBeacons Network. In Proc. of DBISP2P, 2004.

Digital Library

[7]

A. Crespo and H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. In Proc. of ICDCS, 2002.

Digital Library

[8]

R. Fagin. Combining Fuzzy Information: an Overview. SIGMOD Record, 31(2):109--118, 2002.

Digital Library

[9]

P. Haase, R. Siebes, and F. van Harmelen. Peer Selection in Peer-to-Peer Networks with Semantic Topologies. In Proc. of ICNSW, 2004.

[10]

A. Halevy, Z. Ives, J. Madhavan, P. Mork, D. Suciu, and I. Tatarinov. The Piazza Peer Data Management System. IEEE TKDE, 16(7):787--798, July 2004.

Digital Library

[11]

M. H. K. Aberer, P. Cudré-Mauroux. The Chatty Web: Emergent Semantics Through Gossiping. In Proc. of WWW, 2003.

Digital Library

[12]

G. J. Klir and B. Yuan. Fuzzy Sets and Fuzzy Logic: Theory and Applications. Prentice Hall, 1995.

Digital Library

[13]

G. Koloniari and E. Pitoura. Content-Based Routing of Path Queries in Peer-to-Peer Systems. In Proc. of EDBT, 2004.

[14]

J. Madhavan, P. A. Bernstein, A. Doan, and A. Y. Halevy. Corpus-based schema matching. In Proc. of ICDE, 2005.

Digital Library

[15]

S. Melnik, H. Garcia-Molina, and E. Rahm. Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching. In Proc. of ICDE, 2002.

Digital Library

[16]

S. Michel, M. Bender, P. Triantafillou, and G. Weikum. IQN Routing: Integrating Quality and Novelty in P2P Querying and Ranking. In Proc. of EDBT, 2006.

Digital Library

[17]

W. Nejdl, B. Wolf, S. Staab, and J. Tane. EDUTELLA: Searching and Annotating Resources within an RDF-based P2P Network. In Proc. of WWW Intl. Workshop on the Semantic Web, 2002.

[18]

W. Nejdl et al. Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks. In Proc. of WWW, 2003.

Digital Library

[19]

W. Penzo. Rewriting Rules To Permeate Complex Similarity and Fuzzy Queries within a Relational Database System. IEEE TKDE, 17(2):255--270, 2005.

Digital Library

[20]

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In Proc. of SIGCOMM, 2001.

Digital Library

[21]

I. Tatarinov and A. Halevy. Efficient Query Reformulation in Peer Data Management Systems. In Proc. of SIGMOD, 2004.

Digital Library

[22]

C. Tempich, S. Staab, and A. Wranik. REMINDIN': Semantic Query Routing in Peer-to-Peer Networks Based on Social Metaphors. In Proc. of WWW, 2004.

Digital Library

Cited By

Bergamaschi SBeneventano DMandreoli FMartoglia RGuerra FOrsini MPo LVincini MSimonini GZhu SGagliardelli LMagnotta L(2017)From Data Integration to Big Data IntegrationA Comprehensive Guide Through the Italian Database Research Over the Last 25 Years10.1007/978-3-319-61893-7_3(43-59)Online publication date: 31-May-2017
https://doi.org/10.1007/978-3-319-61893-7_3
Golfarelli MMandreoli FPenzo WRizzi STurricchia E(2012)BINBusiness Intelligence Applications and the Web10.4018/978-1-61350-038-5.ch011(244-265)Online publication date: 2012
https://doi.org/10.4018/978-1-61350-038-5.ch011
Golfarelli MMandreoli FPenzo WRizzi STurricchia E(2012)OLAP query reformulation in peer-to-peer data warehousingInformation Systems10.1016/j.is.2011.06.00337:5(393-411)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.is.2011.06.003
Show More Cited By

Index Terms

SRI: exploiting semantic information for effective query routing in a PDMS
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing
  2. Information storage systems
    1. Storage architectures
      1. Distributed storage

Recommendations

A path-traceable query routing mechanism for search in unstructured peer-to-peer networks

Unstructured Peer-to-Peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. Searching for content in unstructured P2P networks is a challenging task because the distribution of ...
Indexing views to route queries in a PDMS

P2P computing gains increasing attention lately, since it provides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. Peer Data Management Systems (PDMS) ...
Query workload-aware overlay construction using histograms
CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management

Peer-to-peer(p2p) systems over an efficient means of data sharing among a dynamically changing set of a large number of a tonomous nodes.Each node in a p2p system is connected with a small number of other nodes thus creating an overlay network of nodes. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WIDM '06: Proceedings of the 8th annual ACM international workshop on Web information and data management

November 2006

102 pages

ISBN:1595935258

DOI:10.1145/1183550

Program Chairs:
Angela Bonifati
Icar CNR, Italy
,
Irini Fundulaki
University of Edinburgh, UK

Copyright © 2006 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: 10 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM06

Sponsor:

CIKM06: Conference on Information and Knowledge Management

November 10, 2006

Virginia, Arlington, USA

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
270
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bergamaschi SBeneventano DMandreoli FMartoglia RGuerra FOrsini MPo LVincini MSimonini GZhu SGagliardelli LMagnotta L(2017)From Data Integration to Big Data IntegrationA Comprehensive Guide Through the Italian Database Research Over the Last 25 Years10.1007/978-3-319-61893-7_3(43-59)Online publication date: 31-May-2017
https://doi.org/10.1007/978-3-319-61893-7_3
Golfarelli MMandreoli FPenzo WRizzi STurricchia E(2012)BINBusiness Intelligence Applications and the Web10.4018/978-1-61350-038-5.ch011(244-265)Online publication date: 2012
https://doi.org/10.4018/978-1-61350-038-5.ch011
Golfarelli MMandreoli FPenzo WRizzi STurricchia E(2012)OLAP query reformulation in peer-to-peer data warehousingInformation Systems10.1016/j.is.2011.06.00337:5(393-411)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.is.2011.06.003
Doulkeridis CVlachou ANørvåg KKotidis YVazirgiannis MHuang JKoudas NJones GWu XCollins-Thompson KAn A(2010)On the selectivity of multidimensional routing indicesProceedings of the 19th ACM international conference on Information and knowledge management10.1145/1871437.1871456(109-118)Online publication date: 26-Oct-2010
https://dl.acm.org/doi/10.1145/1871437.1871456
Mandreoli FMartoglia RPenzo WSassatelli SVillani G(2010)Leveraging Semantic Approximations in Heterogeneous XML Data Sharing Networks: The SUNRISE ApproachSoft Computing in XML Data Management10.1007/978-3-642-14010-5_12(315-350)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14010-5_12
Dohnal VSedmidubsky J(2009)Query Routing Mechanisms in Self-Organizing Search SystemsProceedings of the 2009 Second International Workshop on Similarity Search and Applications10.1109/SISAP.2009.13(132-139)Online publication date: 29-Aug-2009
https://dl.acm.org/doi/10.1109/SISAP.2009.13
Mandreoli FMartoglia RPenzo WSassatelli S(2009)Data-Sharing P2P Networks with Semantic Approximation CapabilitiesIEEE Internet Computing10.1109/MIC.2009.10513:5(60-70)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1109/MIC.2009.105
Gennaro CMandreoli FMartoglia RMordacchini MOrlando SPenzo WSassatelli STiberio P(2009)Toward an Effective and Efficient Query Processing in the NeP4B ProjectInformation Systems: People, Organizations, Institutions, and Technologies10.1007/978-3-7908-2148-2_26(219-226)Online publication date: 31-Jul-2009
https://doi.org/10.1007/978-3-7908-2148-2_26
Mandreoli FMartoglia RSassatelli SVillani GPenzo W(2008)Building a PDMS infrastructure for XML data sharing with SUNRISEProceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web10.1145/1416691.1416702(51-59)Online publication date: 25-Mar-2008
https://dl.acm.org/doi/10.1145/1416691.1416702
Penzo WLodi SMandreoli FMartoglia RSassatelli SMouaddib NValduriez PKemper ABouzeghoub MMarkl VAmsaleg LManolescu ITeubner J(2008)Semantic peer, here are the neighbors you want!Proceedings of the 11th international conference on Extending database technology: Advances in database technology10.1145/1353343.1353351(26-37)Online publication date: 25-Mar-2008
https://dl.acm.org/doi/10.1145/1353343.1353351
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents