Recognizing the tractability in big data computing

DOI10.1007/978-3-030-36412-0_18zbMath1435.68295arXiv1910.01357OpenAlexW3130849407MaRDI QIDQ5918820

Xiang-Yu Gao, Xianmin Liu, Dongjing Miao, Jian-Zhong Li

Publication date: 13 May 2020

Published in: Theoretical Computer Science, Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.01357

zbMATH Keywords

sublinearcomplexity theorytractabilitysublinear timebig data computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of data analysis and big data (68T09)

Related Items (6)

Turing machines with two-level memory: a deep look into the input/output complexity ⋮ Approximate sorting and its applications in I/O model ⋮ Turing machines with two-level memory: new computational models for analyzing the input/output complexity ⋮ Sublinear-time reductions for big data computing ⋮ Sampling-based approximate skyline calculation on big data ⋮ Sublinear-time reductions for big data computing

Cites Work

• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• SEF view deletion under bounded condition
• Tree size reduction with keeping distinguishability
• Triangle edge deletion on planar glasses-free RGB-digraphs
• Vertex cover in conflict graphs
• Sublinear-time Algorithms
• Computational Complexity
• Sublinear Geometric Algorithms
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing the tractability in big data computing