2008 Eighth International Conference on Peer-to-Peer Computing 2008
DOI: 10.1109/p2p.2008.26
|View full text |Cite
|
Sign up to set email alerts
|

Support for Concept Hierarchies in DHTs

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…In [2] an efficient indexing scheme for storing and retrieving concept hierarchies over a fully decentralized system is given, even if folksonomies are not taken into account.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In [2] an efficient indexing scheme for storing and retrieving concept hierarchies over a fully decentralized system is given, even if folksonomies are not taken into account.…”
Section: Related Workmentioning
confidence: 99%
“…Some of the most relevant things to know are nodal degree distributions: in particular we extracted the distribution of the cardinalities of T ags(r), Res(t) and N F G (t) sets. Statistics of degrees (mean, standard deviation and max values, 1 http://likir.di.unito.it 2 The dataset has been collected in collaboration with the School of Informatics and Computing, Indiana University at Bloomington, IN, USA. 5.…”
Section: A Lastfm Dataset Overviewmentioning
confidence: 99%
“…HIS was designed for peer-to-peer systems. Asiki et al in [17] presented a similar method that uses concept hierarchies; however, similar to [43], it does not contain a centralized tree structure. In another study by Asiki et al in [18,19], authors improved their previous work and implemented a decentralized concept hierarchy on a grid system.…”
Section: Real-time Olapmentioning
confidence: 99%
“…In another study by Doka et al [45], an online system was presented that is capable of performing online OLAP operations. Their method is based on concept hierarchies similar to [17,18,19]; however, the method lacks a multi-dimensional data indexing structure such as R-tree. The method tries to integrate the concept hierarchies of different dimensions and use them to store input data.…”
Section: Real-time Olapmentioning
confidence: 99%