Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Keyword Search in P2P Relational Databases

Authors

[ 1 ] Instytut Automatyki i Inżynierii Informatycznej, Wydział Elektryczny, Politechnika Poznańska | [ P ] employee

Year of publication

2015

Chapter type

paper

Publication language

english

Keywords
EN
  • keywords queries
  • relational databases
  • P2P data integration
Abstract

EN We discuss the way of using keyword search in the case of P2P connected relational databases. Each peer is then an agent deciding about translation and propagation of a keyword query, as well as about the way of merging partial answers. The way of merging (partial or total) is essential for both efficiency of execution and information contents in the final answer. We prove a theorem stating a necessary condition for deciding about the strategy of merging made by a peer.

Pages (from - to)

325 - 335

DOI

10.1007/978-3-319-19728-9_27

URL

https://link.springer.com/chapter/10.1007/978-3-319-19728-9_27

Book

Agent and Multi-Agent Systems: Technologies and Applications : 9th KES International Conference, KES-AMSTA 2015 Sorrento, Italy, June 2015

Presented on

9th KES International Conference on Agent and Multi-Agent Systems: Technologies and Applications, KES-AMSTA 2015, 17-19.06.2015, Sorrento, Italy

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.