Kenneth A. Ross, Inga Sitzmann, Peter J. Stuckey  Home/Search
Context Related
| cs.mu.oz.au/~pjs/pape...ssdbm2001.ps.gz 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: cs.mu.oz.au/~pjs/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Cost-based unbalanced R-trees (CUR-trees) are a cost-function based data structure for spatial data. CUR-trees are constructed speci cally to improve the evaluation of intersection queries, the most basic selection query in an R-tree. A CUR-tree is built taking into account a given query distribution for the queries and a cost model for their execution. Depending on the expected frequency of access, objects or subtrees are stored higher up in the tree. After each insertion in the tree, local... (Update)
Context of citations to this paper: More
.... More experimental results including experiments with an optimized evaluation of split, demotion and promotion operations can be found in [15]. In that report, we also describe the operations in greater detail. 7.1 Implementation Details We implemented a common in memory...
...child node needs to be stored in the parent. This pointer elimination technique was extended to spatial data structures in the paper [Ross et al. 2001] which introduced cost based unbalanced R trees (CUR trees) The cost factors of the cache behaviour of a given architecture...
Cited by: More
R-Trees Have Grown Everywhere - Manolopoulos, Nanopoulos.. (Correct)
Compacting Discriminator Information for Spatial Trees - Sitzmann, Stuckey (Correct)
Cost-based Unbalanced R-Trees - Ross, Sitzmann, Stuckey (2000) (Correct)
Active bibliography (related documents): More All
0.2: Scalable Access within the Context of Digital Libraries - Cheng (1997) (Correct)
0.2: Implementing Database Operations Using SIMD Instructions - Zhou, Ross (2002) (Correct)
0.2: Fractal Prefetching B+-Trees: Optimizing Both Cache.. - Chen, Gibbonst.. (Correct)
Similar documents based on text: More All
0.4: O-Trees: a Constraint-based Index Structure - Sitzmann, Stuckey (Correct)
0.4: The O-Tree - A Constraint-Based Index Structure - Sitzmann, Stuckey (1999) (Correct)
0.3: Master-Client R-trees: A New Parallel R-tree Architecture - Schnitzer, al. (1998) (Correct)
Related documents from co-citation: More All
3: The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
3: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
3: Multidimensional Access Methods - Gaede, Gunther - 1997
BibTeX entry: (Update)
K. A. Ross, I. Sitzmann, and P. J. Stuckey. Cost-based Unbalanced R-Trees. Technical report, CSSE, The University of Melbourne, 2000. http://citeseer.ist.psu.edu/ross00costbased.html More
@inproceedings{ ross01costbased,
author = "Kenneth A. Ross and Inga Sitzmann and Peter J. Stuckey",
title = "Cost-based Unbalanced R-Trees",
booktitle = "Statistical and Scientific Database Management",
pages = "203-212",
year = "2001",
url = "citeseer.ist.psu.edu/ross00costbased.html" }
Citations (may not include all citations):765 trees: a dynamic index structure for spatial searching (context) - Guttman
666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
262 Multidimensional Access Methods - Gaede, unther - 1998
106 Priority search trees (context) - McCreight - 1985
42 Tree: An Ecient and Robust Access Method for Points and Rect.. (context) - Beckmann, Kriegel et al.
27 Trees Cache Conscious in Main Memory (context) - Rao, Ross - 2000
14 Improving pointer-based codes through cache-conscious data p.. - Chilimbi, Larus et al. - 1998
13 A new approach to rectangle intersections: Part II (context) - Edelsbrunner - 1983
13 A new approach to rectangle intersections: Part (context) - Edelsbrunner - 1983
11 An Optimal Node Splitting for R-trees - Garcia, Mario et al.
8 Towards an analysis of range query performance in spatial da.. (context) - Pagel, Six et al.
5 Cost-based Unbalanced R-Trees - Ross, Sitzmann et al. - 2000
5 tree indexes and cpu caches (context) - Graefe, Larson
4 Indexing non-uniform spatial data - Kanth, Agrawal et al.
1 The Sun Ultra 5 and Ultra 10 Workstation Architecture { Tech.. (context) - Microsystems
1 Oversize Shelves: A Storage Management Technique for Large S.. - unther, Gaede - 1997
1 Ecient Cost Models for Spatial Queries Using R-Trees (context) - Theodoris, Stefanakis et al. - 2000
Documents on the same site (http://www.cs.mu.oz.au/~pjs/papers.html): More
A Unit Two Variable Per Inequality Integer Constraint Solver.. - Harvey, Stuckey (1997) (Correct)
A Lagrangian reconstruction of GENET - Choi (2000) (Correct)
Differential Methods in Logic Program Analysis - Banda, Marriott, Stuckey.. (1996) (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