Semantic indexing in structured peer-to-peer networks
From MaRDI portal
Publication:436647
DOI10.1016/j.jpdc.2007.06.003zbMath1243.68277OpenAlexW1976902140MaRDI QIDQ436647
Mehmet Koyutürk, Ananth Grama, Suresh Jagannathan, Ronaldo A. Ferreira
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.06.003
information retrievalmatrix decompositionspeer-to-peer networksdistributed hash tablesemantic indexingsemantic overlay networks
Network design and communication in computer systems (68M10) Knowledge representation (68T30) Information storage and retrieval of data (68P20)
Uses Software
Cites Work
- CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- Matrices, Vector Spaces, and Information Retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Semantic indexing in structured peer-to-peer networks