Querying the SaintEtiQ Summaries – A First Attempt

Voglozin, W. Amenel; Raschia, Guillaume; Ughetto, Laurent; Mouaddib, Noureddine

doi:10.1007/978-3-540-25957-2_32

Cited by 9 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, a selection algorithm performs a fast exploration of the hierarchy and returns the set Z Q of most abstract summary nodes that satisfy the query. For more details see [26].…”

Section: Query Evaluationmentioning

confidence: 99%

“…The aggregation in a given class is a union of descriptors: for each attribute in the selection set Y (i.e. age), the querying process supplies a set of descriptors which characterize the summary nodes that answer the query through the same interpretation [26]. For example, according to Table 2, the output set obtained for the different classes found in z Q is:…”

Section: Approximate Answeringmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Then, a selection algorithm performs a fast exploration of the hierarchy and returns the set Z Q of most abstract summary nodes that satisfy the query. For more details see [26].…”

Section: Query Evaluationmentioning

confidence: 99%

Section: Approximate Answeringmentioning

confidence: 99%

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

show abstract

“…Then, a selection algorithm performs a fast exploration of the hierarchy and returns the set Z Q of most abstract summaries that satisfy the query. For more details see (Voglozin et al, 2004). Once Z Q determined, the evaluation process can achieve two distinct tasks: 1) Peer localization, and 2) Approximate answering.…”

Section: Query Evaluationmentioning

confidence: 99%

Summary management in unstructured P2P systems

Hayek¹,

Raschia²,

Valduriez³

et al. 2008

isi

Self Cite

View full text Add to dashboard Cite

In this paper, we propose managing data summaries in unstructured P2P systems. Our summaries are intelligible views with two main virtues. First, they can be directly queried and used to approximately answer a query. Second, as semantic indexes, they support locating relevant nodes based on data content. The performance evaluation of our proposal shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance. RÉSUMÉ. Dans ce travail, nous proposons de maintenir des résumés de données dans les systèmes P2P non structurés. Nos résumés sont des vues intelligibles ayant un double avantage en traitement de requête. Ils peuvent soit répondre d'une manière approximative à une requête, soit guider sa propagation vers les pairs pertinents en se basant sur le contenu des données. L'évaluation de performance de notre proposition a montré que le coût de requêtes est largement réduit, sans induire des côuts élevés de maintenance de résumés.

show abstract

“…Then, a selection algorithm performs a fast exploration of the hierarchy and returns the set Z Q of most precise summaries that satisfy the query. For more details see [20]. Once Z Q determined, the query evaluation process is able to achieve two distinct tasks depending on the user/application requirements: 1) Peer localization to return the original result records and 2) Summary answering to return approximate answers.…”

Section: Query Evaluationmentioning

confidence: 99%

“…The aggregation in a given class is a union of descriptors: for each attribute of the selection list (i.e. BMI), the querying process supplies a set of descriptors which characterize summaries that respond to the query through the same interpretation [20]. For example, for the class {young, malaria}, we can obtain an output set BMI = {underweight, normal}.…”

Section: Summary Answeringmentioning

confidence: 99%

Design of PeerSum: A Summary Service for P2P Applications

Hayek

Raschia

Valduriez

et al.

Advances in Grid and Pervasive Computing

Self Cite

View full text Add to dashboard Cite

Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more efficient approach is to rely on compact database summaries rather than raw database records, whose access is costly in large distributed systems. In this paper, we propose PeerSum, a new service for managing summaries over shared data in large P2P and Grid applications. Our summaries are synthetic, multidimensional views with two main virtues. First, they can be directly queried and used to approximately answer a query without exploring the original data. Second, as semantic indexes, they support locating relevant nodes based on data content. Our main contribution is to define a summary model for P2P systems, and the algorithms for summary management. Our performance evaluation shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance.

show abstract

Querying the SaintEtiQ Summaries – A First Attempt

Cited by 9 publications

References 11 publications

Managing Linguistic Data Summaries in Advanced P2P Applications

Managing Linguistic Data Summaries in Advanced P2P Applications

Summary management in unstructured P2P systems

Design of PeerSum: A Summary Service for P2P Applications

Contact Info

Product

Resources

About