Improving Table Compression with Combinatorial Optimization

We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on the theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, off-line training algorithm, based on a link to the asymmetric traveling salesman problem, which improves on prior work by rearranging columns prior to partitioning. We demonstrate these results experimentally. On various test files, the on-line algorithms provide 35-55% improvement over gzip with negligible slowdown; the off-line reordering provides up to 20% further improvement over partitioning alone. We also show that a variation of the table compression problem is MAX-SNP hard.Comment: 22 pages, 2 figures, 5 tables, 23 references. Extended abstract appears in Proc. 13th ACM-SIAM SODA, pp. 213-222, 200

2-Vertex Connectivity in Directed Graphs

We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex different from v and w leaves v and w in the same strongly connected component. We show how to compute the above relations in linear time so that we can report in constant time if two vertices are 2-vertex-connected or if they are vertex-resilient. We also show how to compute in linear time a sparse certificate for these relations, i.e., a subgraph of the input graph that has O(n) edges and maintains the same 2-vertex-connectivity and vertex-resilience relations as the input graph, where n is the number of vertices.Comment: arXiv admin note: substantial text overlap with arXiv:1407.304

TCP Compression Filter

We propose a TCP filter option to install compression in a virtual layer between TCP and the application layer. The method is incrementally deployable, as neither party will install the compression layer without the other's consent

Microwave Gaseous Discharges

Contains reports on three research projects

Microwave Gaseous Discharges

Contains reports on three research projects.Atomic Energy Commission under Contract AT(30-1)- 184

TCP Compression Filter

We propose a TCP filter option to install compression in a virtual layer between TCP and the application layer. The method is incrementally deployable, as neither party will install the compression layer without the other's consent

TCP Filters

We propose a method to specify general-purpose filters between TCP and the application layer. The method is incrementally deployable, as neither party will use a filter layer without the other's consent

Microwave Gaseous Discharges

Contains reports on three research projects

Microwave Gaseous Discharges

Contains reports on four research projects.Atomic Energy Commission under Contract AT(30-1)-184

Microwave Gaseous Discharges

Contains reports on two research projects