{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:02:39Z","timestamp":1725494559551},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654520"},{"type":"electronic","value":"9783540492573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49257-7_29","type":"book-chapter","created":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T02:44:59Z","timestamp":1194662699000},"page":"471-488","source":"Crossref","is-referenced-by-count":4,"title":["The Data Warehouse of Newsgroups"],"prefix":"10.1007","author":[{"given":"Himanshu","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. In Proceedings of the Foundations of Computer Science, 1993.","DOI":"10.1109\/SFCS.1993.366815"},{"key":"29_CR2","unstructured":"S. Arora and C. Lund. Hardness of approximations. Technical Report TR-504-95, Princeton University, Computer Science Department, 1995."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle. Filtering search: A new approach to query-answering. In Proceeding of the Foundations of Computer Science, 1983.","DOI":"10.1109\/SFCS.1983.17"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"V. Chvatal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4(3):233\u2013235, 1979.","journal-title":"Mathematics of Operations Research"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207168308803364","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"H. Edelsbrunner. A new approach to rectangle intersections, Part I. International Journal of Computer Mathematics, 13:209\u2013219, 1983.","journal-title":"International Journal of Computer Mathematics"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/00207168308803365","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"H. Edelsbrunner. A new approach to rectangle intersections, Part II. International Journal of Computer Mathematics, 13:221\u2013229, 1983.","journal-title":"International Journal of Computer Mathematics"},{"issue":"4","key":"29_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(81)90053-3","volume":"13","author":"H. Edelsbrunner","year":"1981","unstructured":"H. Edelsbrunner and H.A. Maurer. On the intersection of orthogonal objects. Information Processing Letters, 13(4):177\u2013180, 1981.","journal-title":"Information Processing Letters"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"C. Faloutsos. Access methods for text. ACM Comp. Surveys, 17(1), 1985.","DOI":"10.1145\/4078.4080"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Info. Proc. Letters, 12(3), 1981.","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"E. Fredkin. Trie memory. Communications of the ACM, 3(9), 1960.","DOI":"10.1145\/367390.367400"},{"key":"29_CR11","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, D. J. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"H. Gupta, V. Harinarayan, A. Rajaraman, and J. Ullman. Index selection in OLAP. In Proceedings of the ICDE, 1997.","DOI":"10.1109\/ICDE.1997.581755"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"M. Goldwasser and R. Motwani. Intractability of assembly sequencing: Unit disks in the plane. In Proceeding of the Workshop on Algorithms and Data Structures, August 1997.","DOI":"10.1007\/3-540-63307-3_70"},{"key":"29_CR14","volume-title":"Proceedings of the ICDT","author":"H. Gupta","year":"1997","unstructured":"H. Gupta. Selection of views to materialize in a data warehouse. In Proceedings of the ICDT, Delphi, Greece., January 1997."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"E. Hanson, M. Chaabouni, C.-H. Kim, and Y.-W. Wang. A predicate matching algorithm for database rule systems. In PODS, 1990.","DOI":"10.1145\/93597.98736"},{"key":"29_CR16","unstructured":"HGMW+95._J. Hammer, H. Garcia-Molina, J. Widom, W. Labio, and Y. Zhuge. The Stanford Data Warehousing Project. IEEE Data Engineering Bulletin, Special Issue on Materialized Views and Data Warehousing, 18(2), 1995."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing data cubes efficiently. In SIGMOD, 1996.","DOI":"10.1145\/233269.233333"},{"key":"29_CR18","volume-title":"Rdb\/VMS: Developing the Data Warehouse","author":"W.H. Inmon","year":"1993","unstructured":"W.H. Inmon and C. Kelley. Rdb\/VMS: Developing the Data Warehouse. QED Publishing Group, Boston, Massachusetts, 1993."},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, and J.S. Vitter. Indexing for data models with constraints and classes. In PODS, 1993.","DOI":"10.1145\/153850.153884"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"M. Persin. Document filtering for fast ranking. Proc. ACM SIGIR Conf., Dublin, Ireland, 1994.","DOI":"10.1007\/978-1-4471-2099-5_35"},{"key":"29_CR21","unstructured":"S. Ramaswamy and S. Subramanian. Path caching: A technique in optimal external searching. In PODS, 1994."},{"key":"29_CR22","unstructured":"S. Ramaswamy and S. Subramanian. The p-range tree: A new data structure for range searching in secondary memory. In SODA, 1995."},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing &Management, 24(5), 1988.","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"29_CR24","unstructured":"Hanan Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, 1989."},{"key":"29_CR25","unstructured":"Hanan Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989."},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"D.E. Vengroff and J.S. Vitter. Efficient 3-D searching in external memory. In Proceeding of the STOC, 1996.","DOI":"10.1145\/237814.237864"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"J. Widom. Research problems in data warehousing. In Proceedings of the Conference on Info. and Knowledge Management, 1995.","DOI":"10.1145\/221270.221319"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49257-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T09:00:29Z","timestamp":1556960429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49257-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540654520","9783540492573"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-49257-7_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}