Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP Alfredo Cuzzocrea   View Paper (PDF)   Return to Query Processing and View Maintenance Abstract for the first one. The KSyn synopsis data structure, which implements the guidelines of the proposed framework and overcomes the recognized limitations, is also presented and discussed in detail, along with a query-conscious error metrics-based storage space allocation scheme. Finally, encouraging preliminary experimental results stating the goodness of our proposal are presented and discussed. ©2006 Association for Computing Machinery