Progressive approximate aggregate queries with a multi-resolution tree structure

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 2, 2001, Pages 401-412

  Lazaridis, Losif ^a   Mehrotra, Sharad ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040746902     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375718     Document Type: Article

References (13)

1. P. M. Aoki. How to avoid building datablades (r) that know the value of everything and the cost of nothing. In 11th International Conference on Scientific and Statistical Database Management, Proceedings, Cleveland, Ohio, USA, 28-30 July, 1999.
2. D. Barbará and X. Wu. Supporting online queries in rolap. In Proceedings of the Second Int'l Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000, London, UK, September 4-6, 2000, pages 234-243.
3. K. Chakrabarti, M. N. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, pages 111-122.
4. D. Gunopulos, G. Kollios, V. J. Tsotras, and C. Domeniconi. Approximating multi-dimensional aggregate range queries over real attributes. In SIGMOD Conference 2000, Dallas, Texas., pages 463-474.
5. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984, pages 47-57.
6. J. M. Hellerstein, P. J. Haas, and H. Wang. Online aggregation. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 171-182.
7. J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized search trees for database systems. In VLDB '95, Proceedings of 21th International Conference on Very Large Data Bases, September 11-15, 1995, Zurich, Switzerland, pages 562-573.
8. Y. E. Ioannidis and V. Poosala. Histogram-based approximation of set-valued query-answers. In VLDB '99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, pages 174-185.
9. I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. Technical Report TR-DB-01-02, Dept. of Information and Computer Science, University of California, Irvine, 2001.
10. J. T. Robinson. The K-D-B-Tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data, Ann Arbor, Michigan, April 29 - May 1, 1981, pages 10-18.
11. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, May 22-25, 1995, pages 71-79.
12. H. Samet. The quadtree and related hierarchical data structures. Computing Surveys, 16(2):187-260, 1984.
13. J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadephia, Pennsylvania, USA, pages 193-204.