A parallel computing framework for big data

DOI10.1007/S11704-016-5003-YzbMath1403.68068OpenAlexW2556349216MaRDI QIDQ1712556

Rui Mao, Kezhong Lu, Guo-Liang Chen

Publication date: 22 January 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-016-5003-y

zbMATH Keywords

metric spaceparallel computingdata partitioningNC-computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Abstract data types; algebraic specification (68Q65) Theory of data (68P99)

Related Items (1)

Connecting patterns inspire link prediction in complex networks

Cites Work

• Unnamed Item
• Unnamed Item
• Pivot selection: dimension reduction for distance-based indexing
• Satisfying general proximity/similarity queries with metric trees
• Parallel sorting by regular sampling
• Foundations of multidimensional and metric data structures.
• Similarity search. The metric space approach.
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallelism in Comparison Problems

This page was built for publication: A parallel computing framework for big data