Report No. UCB/CSD-2-1174 March 2002 Computer Science Division (EECS)...  Home/Search
Context
Related
| berkeley.edu/techrepor...CSD021174.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: berkeley.edu/access...CSD021174 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Tree-based multidimensional indexes are integral to e#cient querying in multimedia and GIS applications. These indexes frequently use shapes in internal tree nodes to describe the data stored in a subtree below. We show that the standard Minimum Bounding Rectangle descriptor can lead to significant ine#ciency during tree traversal, due to false positives. We also observe that there is often space in internal nodes for richer, more accurate descriptors than rectangles. We propose exploiting ... (Update)
Active bibliography (related documents): More All
0.8: Creating a Customized Access Method for Blobworld - Thomas, Carson, Hellerstein (2000) (Correct)
0.3: Bounding Predicates and Insertion Policies for.. - Thomas, Zhang.. (2000) (Correct)
0.2: On Indexing Large Databases for Advanced Data Models - Samoladas (2001) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ ucb-megan,
author = "Report No Ucb",
title = "Megan Thomas and Joseph M. Hellerstein",
url = "citeseer.ist.psu.edu/736784.html" }
Citations (may not include all citations):983 The Art of Scientific Computing (context) - Press, Teukolsky et al. - 1992
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
262 Multidimensional access methods - Gaede, Guenther - 1998
229 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 2000
165 The SR-tree: An index structure for high dimensional nearest.. - Katayama, Satoh - 1997
162 Similarity indexing with the SS-tree (context) - White, Jain - 1996
117 Generalized search trees for database systems - Hellerstein, Naughton et al. - 1995
59 cient and robust access method for points and rectangles (context) - Beckmann, Schneider et al. - 1990
52 Multidimensional binary search trees in database application.. (context) - Bentley - 1979
36 ACM Transactions on Mathematical Software (context) - Barber, Dobkin et al. - 1996
33 Searching in high-dimensional spaces - index structures for .. (context) - Bohm, Berchtold et al. - 2001
16 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
11 STR: A simple and e#cient algorithm for R-tree packing (context) - Leutenegger, Lopez et al. - 1997
9 trees with inserts and deletes: Why free-at-empty is better .. (context) - Johnson, Shasha - 1993
7 An analysis framework for access methods - Kornacker, Shah et al. - 1999
6 amdb: A visual access method development tool - Shah, Kornacker et al. - 1999
2 Jagged bite problem NP-complete construction - Hildrum, Thomas - 1999
http://elib.cs.berkeley.edu/photos/blobworld/
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