A parallel computing framework for big data

DOI10.1007/S11704-016-5003-YMaRDI QIDQ1712556zbMATH OpenOpenAlexFDO

Authors Rui Mao, Kezhong Lu, Guoliang 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

data partitioningmetric spaceNC-computingparallel computing

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic aspects of parallel data processing
• The scientific problems and methodology of big data
• Parallel attribute reduction in dominance-based neighborhood rough set
• Algorithms for Big Data
• A research overview of big data technology

Cites work

• Finding the maximum, merging, and sorting in a parallel computation model
• Foundations of multidimensional and metric data structures.
• scientific article; zbMATH DE number 437556 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Parallel sorting by regular sampling
• Parallelism in Comparison Problems
• Pivot selection: dimension reduction for distance-based indexing
• Satisfying general proximity/similarity queries with metric trees
• Similarity search. The metric space approach.

Cited in

(3)

• Parallel sampling from big data with uncertainty distribution
• Robinia: scalable framework for data-intensive scientific computing on wide area network
• Connecting patterns inspire link prediction in complex networks

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

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