A research agenda for query processing in large-scale peer data management systems

  • Authors:

  • Katja Hose;Armin Roth;André Zeitz;Kai-Uwe Sattler;Felix Naumann

  • Affiliations:

  • Technische Universität Ilmenau, FG Datenbanken und Informationssysteme, D-98684 Ilmenau, Germany;Hasso-Plattner-Institut für Softwaresystemtechnik (HPI), D-14482 Potsdam, Germany;Universität Rostock, Universtitätsrechenzentrum/Lehrstuhl Datenbank- und Informationssysteme, D-18051 Rostock, Germany;Technische Universität Ilmenau, FG Datenbanken und Informationssysteme, D-98684 Ilmenau, Germany;Hasso-Plattner-Institut für Softwaresystemtechnik (HPI), D-14482 Potsdam, Germany

  • Venue:
  • Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Peer Data Management Systems (Pdms) are a novel, useful, but challenging paradigm for distributed data management and query processing. Conventional integrated information systems have a hierarchical structure with an integration component that manages a global schema and distributes queries against this schema to the underlying data sources. Pdmsare a natural extension to this architecture by allowing each participating system (peer) to act both as a data source and as an integrator. Peers are interconnected by schema mappings, which guide the rewriting of queries between the heterogeneous schemas, and thus form a P2P (peer-to-peer)-like network. Despite several years of research, the development of efficient Pdmsstill holds many challenges. In this article we first survey the state of the art on peer data management: We classify Pdmsby characteristics concerning their system model, their semantics, their query planning schemes, and their maintenance. Then we systematically examine open research directions in each of those areas. In particular, we observe that research results from both the domain of P2P systems and of conventional distributed data management can have an impact on the development of Pdms.