TY - GEN
T1 - Materialized views for count aggregates of spatial data
AU - Yaagoub, Anan
AU - Liu, Xudong
AU - Trajcevski, Goce
AU - Tanin, Egemen
AU - Scheuermann, Peter I
PY - 2012
Y1 - 2012
N2 - We address the problem of efficient processing of count aggregate queries for spatial objects in OLAP systems. One of the main issues affecting the efficient spatial analysis is the, so called, distinct counting problem. The core of the problem is due to the fact that spatial objects such as lakes, rivers, etc... - and their representations - have extents. We investigate the trade-offs that arise when (semi) materialized views of the count aggregate are maintained in a hierarchical index and propose two data structures that are based on the Quadtree indexes: Fully Materialize Views (FMV) and Partially Materialized Views (PMV). Each aims at achieving a balance between the: (1) benefits in terms of response time for range queries; (2) overheads in terms of extra space and update costs. Our experiments on real datasets (Minnesota lakes) demonstrate that the proposed approaches are beneficial for the first aspect achieving up to five times speed-up, while incurring relatively minor overheads with respect to the second one, when compared to the naïve approach.
AB - We address the problem of efficient processing of count aggregate queries for spatial objects in OLAP systems. One of the main issues affecting the efficient spatial analysis is the, so called, distinct counting problem. The core of the problem is due to the fact that spatial objects such as lakes, rivers, etc... - and their representations - have extents. We investigate the trade-offs that arise when (semi) materialized views of the count aggregate are maintained in a hierarchical index and propose two data structures that are based on the Quadtree indexes: Fully Materialize Views (FMV) and Partially Materialized Views (PMV). Each aims at achieving a balance between the: (1) benefits in terms of response time for range queries; (2) overheads in terms of extra space and update costs. Our experiments on real datasets (Minnesota lakes) demonstrate that the proposed approaches are beneficial for the first aspect achieving up to five times speed-up, while incurring relatively minor overheads with respect to the second one, when compared to the naïve approach.
UR - http://www.scopus.com/inward/record.url?scp=84867665380&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867665380&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-33074-2_32
DO - 10.1007/978-3-642-33074-2_32
M3 - Conference contribution
AN - SCOPUS:84867665380
SN - 9783642330735
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 427
EP - 440
BT - Advances in Databases and Information Systems - 16th East European Conference, ADBIS 2012, Proceedings
T2 - 16th East European Conference on Advances in Databases and Information Systems, ADBIS 2012
Y2 - 18 September 2012 through 21 September 2012
ER -