Compressing Large Boolean Matrices Using Reordering Techniques

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 13-23

  Johnson, David ^a   Krishnan, Shankar ^a   Venkatasubramanian, Suresh ^a   Chhugani, Jatin ^b   Kumar, Subodh ^b  

^a AT AND T LABS RESEARCH   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85103976849     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50005-X     Document Type: Chapter

References (24)

1. D. Aliaga, J. Cohen, A. Wilson, H. Zhang, C. Erikson, K. Hoff, T. Hudson, W. Stuerzlinger, E. Baker, R. Bastos, M. Whitton, F. Brooks and D. Manocha (1999) Mmr: An integrated massive model rendering system using geometric and image-based acceleraction. Proc. of ACM Symposium on Interactive 3D Graphics 199-206.
2. F. Alizadeh, R.M. Karp, L.A. Newberg and D.K. Weisser (1993) Physical mapping of chromosomes: A combinatorial problem in molecular biology. Proc. 3rd ACM-SIAM Symp. Discrete Algorithms 371-381.
3. K. Beyer, J. Goldstein, R. Ramakrishnan and U. Shaft (1999) When is “nearest neighbor” meaningful? Lecture Notes in Computer Science 1540 217-235.
4. K.S. Booth and G.S. Lueker (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using P-Q tree algorithms. J. of Comp. and Syst. Sci. 13 335-379.
5. B. Brinkman and M. Charikar (2003) On the impossibility of dimension reduction in l 1. Proc. 44th IEEE Symp. Foundations of Computer Science 514-523.
6. A.L. Buchsbaum, D.F. Caldwell, K.W. Church, G.S. Fowler and S. Muthukrishnan (2000) Engineering the compression of massive tables: an experimental approach. Proc. 10th ACM-SIAM Symp. Discrete Algorithms Society for Industrial and Applied Mathematics 175-184.
7. A.L. Buchsbaum, G.S. Fowler and R. Giancarlo (2003) Improving table compression with combinatorial optimization. J. ACM 50(6), 825-851.
8. M. Burrows and D.J. Wheeler (1994) A blocksorting lossless data compression system. Tech. Rep. 124, DEC SRC
9. J. Chhugani, B. Purnomo, S. Krishnan, J. Cohen, S. Venkatasubramanian, D. Johnson and S.L.O.D. Kumar S. vLOD (2003) High-fidelity walkthrough of large virtual environments. Submitted
10. N. Christofides (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. 388 Graduate School of Industrial Administration, CMU
11. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J.D. Ullman and C. Yang (2001) Finding interesting associations without support pruning. Knowledge and Data Engineering 13(1), 64-78.
12. C. Cortes, D. Pregibon and C. Volinsky (2003) Computational methods for dynamic graphs. Journal of Computational and Graphical Statistics 12 950-970.
13. T.A. Funkhouser, C.H. Sequin and S.J. Teller (Mar. 1992) Management of large amounts of data in interactive building walkthroughs. D. Zeltzer (Eds) Computer Graphics (1992 Symposium on Interactive 3D Graphics) vol. 25 11-20.
14. M.R. Garey and D.S. Johnson (1979) Computers and Intractability W. H. Freeman
15. A. Gionis, T. Kujala and H. Mannila (2003) Fragments of order. Proc. 9th ACM Conf. Knowledge Discovery and Data Mining
16. S. Guha, A. Meyerson, N. Mishra, R. Motwani and L. O'Callaghan (2003) Clustering data streams: Theory and practice. IEEE Trans. Knowl. Data Eng 15(3), 515-528.
17. D.S. Johnson and L.A. McGeoch (1997) The Traveling Salesman Problem: A Case Study in Local Optimization John Wiley and Sons ch. 8
18. T. Johnson (1999) Performance measurements of compressed bitmap indices. Proc. 25th Intnl. Conf. Very Large Databases (VLDB)
19. E. Kushilevitz, R. Ostrovsky and Y. Rabani (1998) Efficient search for approximate near-est neighbor in high dimensional speces. Proc. 30th ACM Symp. Theory of Computing 614-623.
20. S. Lin and B. Kernighan (1973) An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21 498-516.
21. Moffat, A., and Zobel, J.: Parameterised compression for sparse bitmaps. In Research and Development in Information Retrieval (1992), pp. 274–285.
22. L. Shou, J. Chionh, Z. Huang, Y. Ruan and K.-L. Tan (2001) Walking through a very large virtual environment in real-time. Proc. 27th Intnl. Conf. Very Large Databases (VLDB)
23. S. Teller, C. Fowler, T. Funkhouser and P. Hanrahan (July 1994) Partitioning and ordering large radiosity computations. A. Glassner (Eds) Proceedings of SIGGRAPH '94 (Orlando, Florida, July 24–29, 1994) Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH ACM Press 0-89791-667-0 443-450.
24. T. Zhang, R. Ramakrishnan and M. Livny (1996) Birch: an efficient data clustering method for very large databases. Proceedings of the 1996 ACM SIGMOD international conference on Management of data ACM Press 103-114.