Skip to main content

Handling Preferences in P2P Systems

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNISA,volume 7153)

Abstract

A peer to peer system easily provides a way to aggregate information distributed in the network. Anyhow, while collecting data it is quite natural for a source peer to associate different degrees of reliability to the portion of data provided by its neighbor peers. This paper investigates the data exchange problem among distributed independent sources and concentrates on the task of using dynamic preferences to drive the integration process in the case of conflicting information. Previous works in the literature are rigid in the sense that preferences between conflicting sets of atoms, that a peer can import, only depends on the priorities associated to the source peers at design time. These approaches do not allow to model concepts such as “import tuples from the peer having the highest upload speed if they conflict” or “among conflicting values import the most recent ones”. In this paper it is supposed the existence of a special peer, called authority peer. It contains information about the peers in the network, is accessible from each peer of the system and is used to enhance preference mechanism. The framework, here proposed, ensures dynamism by allowing to select among different scenarios looking at the properties of data provided by the peers: this is done by “dynamically” establishing priorities among mapping rules.

Keywords

  • Logic Program
  • Stable Model
  • Mapping Atom
  • Priority Level
  • Integrity Constraint

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)

    Google Scholar 

  2. Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: PODS, pp. 68–79 (1999)

    Google Scholar 

  3. Bertossi, L.E., Bravo, L.: Query Answering in Peer-to-Peer Data Exchange Systems. In: Lindner, W., Fischer, F., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 476–485. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  4. Bertossi, L.E., Bravo, L.: The Semantics of Consistency and Trust in Peer Data Exchange Systems. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 107–122. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  5. Bikakis, A., Antoniou, G.: Distributed Defeasible Contextual Reasoning in Ambient Computing. In: Aarts, E., Crowley, J.L., de Ruyter, B., Gerhäuser, H., Pflaum, A., Schmidt, J., Wichert, R. (eds.) AmI 2008. LNCS, vol. 5355, pp. 308–325. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  6. Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence 109, 297–356 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Brewka, G., Eiter, T.: Equilibria in heterogeneous nonmonotonic multi-context systems. In: AAAI, pp. 385–390 (2007)

    Google Scholar 

  8. Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)

    CrossRef  Google Scholar 

  9. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Inconsistency tolerance in p2p data integration: An epistemic logic approach. Inf. Syst. 33(4-5), 360–384 (2008)

    CrossRef  MATH  Google Scholar 

  10. Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Logical foundations of peer-to-peer data integration. In: PODS, pp. 241–251 (2004)

    Google Scholar 

  11. Caroprese, L., Greco, S., Zumpano, E.: A logic programming approach to querying and integrating p2p deductive databases. In: FLAIRS Conference, pp. 31–36 (2006)

    Google Scholar 

  12. Caroprese, L., Molinaro, C., Zumpano, E.: Integrating and querying p2p deductive databases. In: IDEAS, pp. 285–290 (2006)

    Google Scholar 

  13. Caroprese, L., Zumpano, E.: Consistent Data Integration in P2P Deductive Databases. In: Prade, H., Subrahmanian, V.S. (eds.) SUM 2007. LNCS (LNAI), vol. 4772, pp. 230–243. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  14. Caroprese, L., Zumpano, E.: Modeling Cooperation in P2P Data Management Systems. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 225–235. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  15. Franconi, E., Kuper, G.M., Lopatenko, A., Serafini, L.: A robust logical and computational characterisation of peer-to-peer database systems. In: DBISP2P, pp. 64–76 (2003)

    Google Scholar 

  16. Franconi, E., Kuper, G.M., Lopatenko, A., Zaihrayeu, I.: Queries and updates in the codb peer to peer database system. In: VLDB, pp. 1277–1280 (2004)

    Google Scholar 

  17. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080 (1988)

    Google Scholar 

  18. Greco, G., Greco, S., Zumpano, E.: A logical framework for querying and repairing inconsistent databases. IEEE Trans. Knowl. Data Eng. 15(6), 1389–1408 (2003)

    CrossRef  Google Scholar 

  19. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. Papadimitriou, C.M.: Computational complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  21. Roelofsen, F., Serafini, L.: Minimal and absent information in contexts. In: Proc. 19th International Joint Conference on Artificial Intelligence, IJCAI 2005 (2005)

    Google Scholar 

  22. Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning (2000)

    Google Scholar 

  23. Syrjänen, T., Niemelä, I.: The Smodels System. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 434–438. Springer, Heidelberg (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caroprese, L., Zumpano, E. (2012). Handling Preferences in P2P Systems. In: Lukasiewicz, T., Sali, A. (eds) Foundations of Information and Knowledge Systems. FoIKS 2012. Lecture Notes in Computer Science, vol 7153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28472-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28472-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28471-7

  • Online ISBN: 978-3-642-28472-4

  • eBook Packages: Computer ScienceComputer Science (R0)