ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Rdb/VMS: developing the data warehouse
Rdb/VMS: developing the data warehouse
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Document filtering for fast ranking
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Intractability of Assembly Sequencing: Unit Disks in the Plane
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Filtering search: A new approach to query-answering
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
The hardness of approximate optima in lattices, codes, and systems of linear equations
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On Efficient Matching of Streaming XML Documents and Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
View Derivation Graph with Edge Fitting for Adaptive Data Warehousing
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Modeling and Maintaining Multi-View Data Warehouses
ER '99 Proceedings of the 18th International Conference on Conceptual Modeling
Is a Voting Approach Accurate for Opinion Mining?
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Hi-index | 0.00 |
Electronic newsgroups are one of the primary means for the dissemination, exchange and sharing of information. We argue that the current newsgroup model is unsatisfactory, especially when posted articles are relevant to multiple newsgroups. We demonstrate that considerable additional flexibility can be achieved by managing newsgroups in a data warehouse, where each article is a tuple of attribute-value pairs, and each newsgroup is a view on the set of all posted articles. Supporting this paradigm for a large set of newsgroups makes it imperative to efficiently support a very large number of views: this is the key difference between newsgroup data warehouses and conventional data warehouses. We identify two complementary problems concerning the design of such a newsgroup data warehouse. An important design decision that the system needs to make is which newsgroup views to eagerly maintain (i.e., materialize). We demonstrate the intractability of the general newsgroup-selection problem, consider various natural special cases of the problem, and present efficient exact/approximation algorithms and complexity hardness results for them. A second important task concerns the efficient incremental maintenance of the eagerly maintained newsgroups. The newsgroup-maintenance problem for our model of newsgroup definitions is a more general version of the classical point-location problem, and we design an I/O and CPU efficient algorithm for this problem.