{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:39Z","timestamp":1763467959516},"reference-count":24,"publisher":"Elsevier","isbn-type":[{"value":"9780120884698","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1016\/b978-012088469-8.50005-x","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T09:12:29Z","timestamp":1257498749000},"page":"13-23","source":"Crossref","is-referenced-by-count":34,"title":["Compressing Large Boolean Matrices Using Reordering Techniques"],"prefix":"10.1016","author":[{"given":"David","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shankar","family":"Krishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jatin","family":"Chhugani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subodh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-012088469-8.50005-X_bib1","series-title":"Proc. of ACM Symposium on Interactive 3D Graphics","first-page":"199","article-title":"Mmr: An integrated massive model rendering system using geometric and image-based acceleraction","author":"Aliaga","year":"1999"},{"key":"10.1016\/B978-012088469-8.50005-X_bib2","series-title":"Proc. 3rd ACM-SIAM Symp. Discrete Algorithms","first-page":"371","article-title":"Physical mapping of chromosomes: A combinatorial problem in molecular biology","author":"Alizadeh","year":"1993"},{"key":"10.1016\/B978-012088469-8.50005-X_bib3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","article-title":"When is \u201cnearest neighbor\u201d meaningful?","volume":"1540","author":"Beyer","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/B978-012088469-8.50005-X_bib4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using P-Q tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. of Comp. and Syst. Sci."},{"key":"10.1016\/B978-012088469-8.50005-X_bib5","series-title":"Proc. 44th IEEE Symp. Foundations of Computer Science","first-page":"514","article-title":"On the impossibility of dimension reduction in l1","author":"Brinkman","year":"2003"},{"key":"10.1016\/B978-012088469-8.50005-X_bib6","series-title":"Proc. 10th ACM-SIAM Symp. Discrete Algorithms","first-page":"175","article-title":"Engineering the compression of massive tables: an experimental approach","author":"Buchsbaum","year":"2000"},{"issue":"6","key":"10.1016\/B978-012088469-8.50005-X_bib7","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/950620.950622","article-title":"Improving table compression with combinatorial optimization","volume":"50","author":"Buchsbaum","year":"2003","journal-title":"J. ACM"},{"key":"10.1016\/B978-012088469-8.50005-X_bib8","article-title":"A blocksorting lossless data compression system","author":"Burrows","year":"1994","journal-title":"Tech. Rep. 124, DEC SRC"},{"key":"10.1016\/B978-012088469-8.50005-X_bib9","series-title":"High-fidelity walkthrough of large virtual environments","author":"Chhugani","year":"2003"},{"key":"10.1016\/B978-012088469-8.50005-X_bib10","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"Christofides","year":"1976"},{"issue":"1","key":"10.1016\/B978-012088469-8.50005-X_bib11","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/69.908981","article-title":"Finding interesting associations without support pruning","volume":"13","author":"Cohen","year":"2001","journal-title":"Knowledge and Data Engineering"},{"key":"10.1016\/B978-012088469-8.50005-X_bib12","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1198\/1061860032742","article-title":"Computational methods for dynamic graphs","volume":"12","author":"Cortes","year":"2003","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"10.1016\/B978-012088469-8.50005-X_bib13","first-page":"11","article-title":"Management of large amounts of data in interactive building walkthroughs","volume":"vol. 25","author":"Funkhouser","year":"1992"},{"key":"10.1016\/B978-012088469-8.50005-X_bib14","author":"Garey","year":"1979"},{"key":"10.1016\/B978-012088469-8.50005-X_bib15","series-title":"Proc. 9th ACM Conf. Knowledge Discovery and Data Mining","article-title":"Fragments of order","author":"Gionis","year":"2003"},{"issue":"3","key":"10.1016\/B978-012088469-8.50005-X_bib16","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","article-title":"Clustering data streams: Theory and practice","volume":"15","author":"Guha","year":"2003","journal-title":"IEEE Trans. Knowl. Data Eng"},{"key":"10.1016\/B978-012088469-8.50005-X_bib17","author":"Johnson","year":"1997"},{"key":"10.1016\/B978-012088469-8.50005-X_bib18","series-title":"Proc. 25th Intnl. Conf. Very Large Databases (VLDB)","article-title":"Performance measurements of compressed bitmap indices","author":"Johnson","year":"1999"},{"key":"10.1016\/B978-012088469-8.50005-X_bib19","series-title":"Proc. 30th ACM Symp. Theory of Computing","first-page":"614","article-title":"Efficient search for approximate near-est neighbor in high dimensional speces","author":"Kushilevitz","year":"1998"},{"key":"10.1016\/B978-012088469-8.50005-X_bib20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/B978-012088469-8.50005-X_bib21","unstructured":"Moffat, A., and Zobel, J.: Parameterised compression for sparse bitmaps. In Research and Development in Information Retrieval (1992), pp. 274\u2013285."},{"key":"10.1016\/B978-012088469-8.50005-X_bib22","series-title":"Proc. 27th Intnl. Conf. Very Large Databases (VLDB)","article-title":"Walking through a very large virtual environment in real-time","author":"Shou","year":"2001"},{"key":"10.1016\/B978-012088469-8.50005-X_bib23","series-title":"Proceedings of SIGGRAPH '94 (Orlando, Florida, July 24\u201329, 1994)","isbn-type":"print","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1145\/192161.192279","article-title":"Partitioning and ordering large radiosity computations","author":"Teller","year":"1994","ISBN":"http:\/\/id.crossref.org\/isbn\/0897916670"},{"key":"10.1016\/B978-012088469-8.50005-X_bib24","series-title":"Proceedings of the 1996 ACM SIGMOD international conference on Management of data","first-page":"103","article-title":"Birch: an efficient data clustering method for very large databases","author":"Zhang","year":"1996"}],"container-title":["Proceedings 2004 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2018,12,15]],"date-time":"2018-12-15T14:28:32Z","timestamp":1544884112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978012088469850005X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9780120884698"],"references-count":24,"URL":"https:\/\/doi.org\/10.1016\/b978-012088469-8.50005-x","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}