Approximation algorithms for array partitioning problems

We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into p (respectively, q) intervals, resulting in p × q rectangular regions. This problem arises in several applications in databases, parallel computation, and image processing. Our main contribution are new approximation algorithms for these NP-complete problems that improve significantly over previously known bounds. The algorithms are fast and simple, work for a variety of measures of partitioning quality, generalize to dimensions d > 2, and achieve almost optimal approximation ratios. We also extend previous NP-completeness results for this class of problems.

[1]  Shahid H. Bokhari.  Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.

[2]  Surajit Chaudhuri,et al.  Self-tuning histograms: building histograms without looking at data , 1999, SIGMOD '99.

[3]  Yannis E. Ioannidis,et al.  Balancing histogram optimality and practicality for query result size estimation , 1995, SIGMOD '95.

[4]  David J. DeWitt,et al.  Equi-depth multidimensional histograms , 1988, SIGMOD '88.

[5]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[6]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[7]  Kenneth L. Clarkson,et al.  A Las Vegas algorithm for linear programming when the dimension is small , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8]  Torsten Suel,et al.  Optimal Histograms with Quality Guarantees , 1998, VLDB.

[9]  R. Pollack,et al.  Advances in Discrete and Computational Geometry , 1999 .

[10]  Sanjay Ranka,et al.  Array Decompositions for Nonuniform Computational Environments , 1996, J. Parallel Distributed Comput..

[11]  Geoffrey C. Fox,et al.  Solving problems on concurrent processors: vol. 2 , 1990 .

[12]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[13]  Emo Welzl,et al.  Partition trees for triangle counting and other range searching problems , 1988, SCG '88.

[14]  김태일,et al.  변형된 저지특성을 갖도록 λg/4 변환기를 정합 시킨 마이크로스트립 라인 포토닉 밴드갭 구조의 설계 및 응용 ( Design and Application of Microstrip Line Photonic Bandgap Structure with a Quarter-Wavelength Transformer for The Modified Characteristics of Stopband ) , 2000 .

[15]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[16]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[17]  Bengt Aspvall,et al.  Approximations for the general block distribution of a matrix , 1998, Theor. Comput. Sci..

[18]  Torsten Suel,et al.  On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications , 1999, ICDT.

[19]  David M. Nicol,et al.  Rectilinear Partitioning of Irregular Data Parallel Computations , 1994, J. Parallel Distributed Comput..

[20]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[21]  Gregory Piatetsky-Shapiro,et al.  Accurate estimation of the number of tuples satisfying a condition , 1984, SIGMOD '84.

[22]  Viswanath Poosala.  Histogram-Based Estimation Techniques in Database Systems , 1997 .

[23]  Yannis E. Ioannidis,et al.  Universality of Serial Histograms , 1993, VLDB.

[24]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[25]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[26]  Aristide Mingozzi,et al.  Partitioning a Matrix to Minimize the Maximum Cost , 1995, Discret. Appl. Math..

[27]  Robert Kooi,et al.  The Optimization of Queries in Relational Databases , 1980 .

[28]  Barbara M. Chapman,et al.  Programming in Vienna Fortran , 1992, Sci. Program..

[29]  Tor Sørevik,et al.  Partitioning an Array onto a Mesh of Processors , 1996, PARA.

[30]  Michelangelo Grigni,et al.  On the Complexity of the Generalized Block Distribution , 1996, IRREGULAR.

[31]  Rice UniversityCORPORATE,et al.  High performance Fortran language specification , 1993 .

[32]  Steven Skiena,et al.  Efficient Array Partitioning , 1997, ICALP.

[33]  Peter J. Haas,et al.  Improved histograms for selectivity estimation of range predicates , 1996, SIGMOD '96.

[34]  Dimitrios Gunopulos,et al.  Approximating multi-dimensional aggregate range queries over real attributes , 2000, SIGMOD '00.

[35]  Awi Federgruen,et al.  Structured Partitioning Problems , 1991, Oper. Res..