Summary management in P2P systems

Hayek, Rabab; Raschia, Guillaume; Valduriez, Patrick; Mouaddib, Noureddine

doi:10.1145/1352431.1352438

Cited by 9 publications

(15 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They propose a tree-based structure, named QTree, for summarizing data and discuss requirements that need to be fulfilled by such routing structures. P2P data summaries have also been proposed in [7]. SIM-PEER [3] is a state-of-the-art approach for exact query processing over multidimensional data distributed in a superpeer network.…”

Section: Related Workmentioning

confidence: 99%

Multidimensional routing indices for efficient distributed query processing

Doulkeridis

Vlachou

Nørvåg

et al. 2009

Proceedings of the 18th ACM Conference on Information and Knowledge Management

View full text Add to dashboard Cite

Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the number of documents that can be obtained in a certain direction in the network. In this paper, we introduce the concept of multidimensional routing indices (MRIs), which are suitable for handling multidimensional data represented by minimum bounding regions (MBRs). Depending on data distribution on peers, the aggregation of the MBRs may lead to MRIs that exhibit extremely poor performance, which renders them ineffective. Thus, focusing on a hybrid unstructured P2P network, we analyze the parameters for building MRIs of high selectivity. We present techniques that boost the query routing performance by detecting similar peers and grouping and reassigning these peers to other parts of the hybrid network in a distributed and scalable way. We demonstrate the advantages of our approach using largescale simulations.

show abstract

Section: Related Workmentioning

confidence: 99%

Multidimensional routing indices for efficient distributed query processing

Doulkeridis

Vlachou

Nørvåg

et al. 2009

Proceedings of the 18th ACM Conference on Information and Knowledge Management

View full text Add to dashboard Cite

show abstract

“…Then, we define the input data and describe the summarization process of the approach adopted in [21]. Finally, the structure of distributed summaries in P2P systems is formally defined.…”

Section: Summarization Processmentioning

confidence: 99%

“…In [21], the approach used for data summarization is based on SaintEtiQ [22]: an online linguistic approach for summarizing databases. The SaintEtiQ model aims at apprehending the information from a database in a synthetic manner.…”

Section: Data Summarizationmentioning

confidence: 99%

“…In [21], a summary tree is also considered as an indexing structure over distributed data in a P2P system. Thus, a new dimension has been added to the definition of a summary node z: a peer-extent P z , which provides the set of peers having data described by z.…”

Section: Distributed Summary Representationmentioning

confidence: 99%

“…The authors in [21] propose a new solution for managing linguistic data summaries in P2P systems. The produced summaries are synthetic, multidimensional views over relational tables.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Managing Linguistic Data Summaries in Advanced P2P Applications

Hayek

Raschia

Valduriez

et al. 2009

Handbook of Peer-to-Peer Networking

Self Cite

View full text Add to dashboard Cite

As the amount of stored data increases, data localization techniques become no longer sufficient in P2P systems. A practical approach is to rely on compact database summaries rather than raw database records, whose access is costly in large P2P systems. In this chapter, we describe a solution for managing linguistic data summaries in advanced P2P applications which are dealing with semantically rich data. The produced summaries are synthetic, multidimensional views over relational tables. The novelty of this proposal relies on the double summary exploitation in distributed P2P systems. First, as semantic indexes, they support locating relevant nodes based on their data descriptions. Second, due to their intelligibility, these summaries can be directly queried and thus approximately answer a query without the need for exploring original data. The proposed solution consists first in defining a summary model for hierarchical P2P systems. Second, appropriate algorithms for summary creation and maintenance are presented. A query processing mechanism, which relies on summary querying, is then proposed to demonstrate the benefits that might be obtained from summary exploitation.

show abstract

Knowledge Based Query Processing in Large Scale Virtual Organizations

Pomares

Roncancio

Abásolo

et al. 2009

Enterprise Information Systems

View full text Add to dashboard Cite

International audienceThis work concerns query processing to support data sharing in large scale Virtual Organizations(VO). Characterization of VO's data sharing contexts reflects the coexistence of factors like sources overlapping, uncertain data location, and fuzzy copies in dynamic large scale environments that hinder query processing. Existing results on distributed query evaluation are useful for VOs, but there is no appropriate solution combining high semantic level and dynamic large scale environments required by VOs. This paper proposes a characterization of VOs data sources, called Data Profile, and a query processing strategy (called QPro2e) for large scale VOs with complex data profiles. QPro2e uses an evolving distributed knowledge base describing data sources roles w.r.t shared domain concepts. It allows the identification of logical data source clusters which improve query evaluation in presence of a very large number of data sources

show abstract

Summary management in P2P systems

Cited by 9 publications

References 0 publications

Multidimensional routing indices for efficient distributed query processing

Multidimensional routing indices for efficient distributed query processing

Managing Linguistic Data Summaries in Advanced P2P Applications

Knowledge Based Query Processing in Large Scale Virtual Organizations

Contact Info

Product

Resources

About