2007
DOI: 10.1016/j.jpdc.2007.01.005
|View full text |Cite
|
Sign up to set email alerts
|

Efficient semantic search on DHT overlays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(19 citation statements)
references
References 21 publications
0
19
0
Order By: Relevance
“…22 The concept used by ESS is to place indexes of semantically close files into same nodes with high probability of exploiting information retrieval algorithms and locality sensitive hashing. 23 A multiple keyword based searching technique called local indexing is used for locating resource using multiple keywords. 24 In this approach, the record of terms contained in each resource is stored on that particular node.…”
Section: Resource Discovery In Unstructured P2p Systemsmentioning
confidence: 99%
See 2 more Smart Citations
“…22 The concept used by ESS is to place indexes of semantically close files into same nodes with high probability of exploiting information retrieval algorithms and locality sensitive hashing. 23 A multiple keyword based searching technique called local indexing is used for locating resource using multiple keywords. 24 In this approach, the record of terms contained in each resource is stored on that particular node.…”
Section: Resource Discovery In Unstructured P2p Systemsmentioning
confidence: 99%
“…global indexing for instance in Ref. 23 In global indexing, the inverted list record is maintained on every node -information about nodes that contain a particular term. Upon query that contains multiple keywords, the query is routed to node containing that keyword.…”
Section: Co-published By Atlantis Press and Taylor And Francismentioning
confidence: 99%
See 1 more Smart Citation
“…But reference vectors are still chosen in a centralized fashion, which is not well suited for large datasets. Zhu and Hu (2007) generate the same index for semantically close files by using LSH and Vector Space Model (VSM), with the purpose of answering queries by only visiting a small number of nodes. But these hash values are directly used as resource keys, which destroy the load balance of Chord.…”
Section: Related Workmentioning
confidence: 99%
“…• Zhu et al [29] have proposed an approach to conduct efficient semantic search on DHT overlays. Their basic idea was to place indexes of semantically close files into the same peer nodes with high probability by adding major components on top of a DHT: extractor registry and semantic indexing and locating utility.…”
Section: Context and Related Workmentioning
confidence: 99%