Aggregate Processing of Planar Points

Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Traditional approaches for processing such queries usually retrieve considerable extra information, thus compromising the processing cost. The paper addresses this problem for planar points from both theoretical and practical points of view. We show that, an aggregate window query can be answered in logarithmic worst-case time by an indexing structure called the aPtree. Next we study the practical behavior of the aP-tree and propose efficient cost models that predict the structure size and actual query cost. Extensive experiments show that the aP-tree, while involving more space consumption, accelerates query processing by up to an order of magnitude compared to a specialized method based on R-trees. Furthermore, our cost models are accurate and can be employed for the selection of the most appropriate method, bal...

• Type: Conference
• Year: 2002
• Where: EDBT
• Authors: Yufei Tao, Dimitris Papadias, Jun Zhang
• Keywords: Actual Query Cost, Aggregate Window Query, Database, EDBT 2002, Query Time Tradeoff