Range Aggregate Queries Sathish Govindarajan Pankaj K. Agarwal Lars Arge...  Home/Search
Context
Related
| duke.edu/~gsat/papers/aggregate.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu/TPIE/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a new indexing scheme, called the CRB-tree, for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R , compute the aggregate of weights of points that lie inside a d-dimensional query rectangle. In this paper we focus on COUNT, SUM, AVG aggregates. First, we develop an indexing scheme for answering twodimensional range-COUNT queries that uses O(N=B) disk blocks and answers a query in O(log B N)... (Update)
Active bibliography (related documents): More All
1.2: CRB-Tree: An Efficient Indexing Scheme for.. - Govindarajan, Agarwal.. (2003) (Correct)
0.6: External Memory Data Structures - Arge (2000) (Correct)
0.5: Aggregation Computation over Complex Objects - Zhang (2002) (Correct)
Similar documents based on text: More All
0.4: Indexing Moving Points - Agarwal, Arge, Erickson (2000) (Correct)
0.4: Efficient Searching with Linear Constraints - Agarwal, Arge, Erickson.. (1997) (Correct)
0.4: I/O-Efficient Dynamic Point Location in Monotone.. - Agarwal, Arge.. (Correct)
BibTeX entry: (Update)
@misc{ queries-crbtree,
author = "Range Aggregate Queries",
title = "CRB-Tree: An Efficient Indexing Scheme for",
url = "citeseer.ist.psu.edu/625873.html" }
Citations (may not include all citations):262 Multidimensional access methods - Gaede, Gunther - 1998
248 Implementing data cubes efficiently - Harinarayan, Rajaraman et al. - 1996
162 The TSQL2 Temporal Query Language (context) - Snodgrass - 1995
133 Geometric range searching and its relatives - Agarwal, Erickson - 1999
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1981
109 inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
88 An asymptotically optimal multiversion b-tree - Becker, Gschwind et al. - 1996
67 Approximate computation of multidimensional aggregates of sp.. - Vitter, Wang - 1999
59 A functional approach to data structures and its use in mult.. (context) - Chazelle - 1988
43 Range queries in olap data cubes - Ho, Agarwal et al. - 1997
38 Incremental computation and maintenance of temporal aggregat.. - Yang, Widom - 2001
36 Lower bounds for orthogonal range searching (context) - Chazelle - 1990
34 Segment indexes: Dynamic indexing techniques for multidimens.. (context) - Kolovson, Stonebraker - 1991
33 External memory data structures - Arge - 2002
31 Computing temporal aggregates (context) - Kline, Snodgrass - 1995
31 Cubetree: Organization of and bulk incremental updates on th.. - Roussopoulos, Kotidis et al. - 1997
27 Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 2000
24 The dynamic datacube - Geffner, Agarwal et al. - 2000
22 Hierarchical cubes for range-sum queries (context) - Chan, Ioannidis - 1999
16 the equivalence of some rectangle problems (context) - Edelsbrunner, Overmars - 1982
14 Efficient computation of temporal aggregates with range pred.. - Zhang, Markowetz et al. - 2001
10 Aggregate processing of planar points - Tao, Papadias et al. - 2002
8 A transparent parallel I/O environment (context) - Vengroff - 1994
8 manual and software distribution are available web httpwww (context) - Procopiuc, Vengroff et al. - 1999
7 efficient dynamic planar point location (context) - Arge, Vahrenhold - 2000
5 Effective temporal aggregation using point-based trees - Kim, Kang et al. - 1999
4 Hierarchical compact cubes for range-max queries - Lee, Ling et al. - 2000
1 Aggregates in the temoral query language tquel (context) - Snodgrass, Gomez et al. - 1993
Documents on the same site (http://www.cs.duke.edu/TPIE/): More
Theory and Practice of IO-Efficient Algorithms for.. - Arge, al. (Correct)
Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998) (Correct)
Online Data Structures in External Memory - Vitter (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC