CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets

DOI10.1007/S00453-006-1218-XMaRDI QIDQ2502286zbMATH OpenOpenAlexFDO

Authors Jie Chi, Mehmet Koyutürk, Ananth Grama

Publication date 12 September 2006

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-006-1218-x

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Parallel algorithms in computer science (68W10)

Recommendations

• Summary data structures for massive data
• The Communication Complexity of Distributed epsilon-Approximations
• A parallel \(k\)-means algorithm based on constrained information
• High Performance Computing - HiPC 2003
• Mergeable summaries

Cited in

(1)

• Semantic indexing in structured peer-to-peer networks

Describes a project that uses

Uses Software

• PROXIMUS

This page was built for publication: CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502286)