(Enter summary)
Abstract: Designing and tuning access methods (AMs) has always been more
of a black art than a rigorous discipline, with performance assessments
being mostly reduced to presenting bottom-line runtime or
I/O numbers. (This paper presents an analysis framework for AMs
that gives detailed feedback about observed page access performance
and the performance implications of individual aspects of an
AM design.) The framework defines performance metrics which
are more meaningful than bottom-line numbers and... (Update)
Context of citations to this paper: More
...unable to describe the implementation metrics in this paper and will ignore them in further discussions. Please refer to the technical report [14] for details. 3 Having knowledge of the execution profile of the workload, in particular the result sets of the queries, allows us to...
...a tool for the visualization, profiling and debugging of AMs implemented in GiST. In addition, amdb incorporates an AM analysis framework [16]. Amdb access method analysis takes as input a GiST AM, a data set and a workload (set of queries) and outputs a set of metrics...
Cited by: More
Megan Thomas and Joseph M. Hellerstein - Report No Ucb
(Correct)
Amdb: A Design Tool for Access Methods - Kornacker, Shah, Hellerstein
(Correct)
Bounding Predicates and Insertion Policies for.. - Thomas, Zhang.. (2000)
(Correct)
Similar documents (at the sentence level):
50.4%: Marcel Kornacker - Marcel Cs Berkeley
(Correct)
49.5%: Access Methods for Next-Generation Database Systems - Kornacker
(Correct)
5.4%: Amdb: A Visual Access Method Development Tool - Shah, Kornacker, Hellerstein (1999)
(Correct)
Active bibliography (related documents): More All
0.7: RESEARCH TRACK: An Analysis Framework for Access Methods - Kornacker, Shah, Hellerstein
(Correct)
0.1: Accurate Estimation of the Cost of Spatial Selections - Aboulnaga, Naughton (2000)
(Correct)
0.1: On the Generation of 2-Dimensional Index Workloads - Hellerstein, Hellerstein.. (1999)
(Correct)
Similar documents based on text: More All
0.3: Highly Available, Fault-Tolerant, Parallel Dataflows - Shah, Hellerstein, Brewer (2004)
(Correct)
0.1: amdb: An Access Method Debugging Tool - Kornacker, Shah, Hellerstein (1998)
(Correct)
0.1: Concurrency and Recovery in Generalized Search Trees - Kornacker, Mohan, Hellerstein (1997)
(Correct)
Related documents from co-citation: More All
7: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
7: The sr-tree: An index structure for high-dimensional nearest neighbor queries
- Katayama, Satoh - 1997
7: Generalized Search Trees for Database Systems
- Hellerstein, Naughton et al. - 1995
BibTeX entry: (Update)
M. Kornacker, M. Shah, and J. Hellerstein. An analysis framework for access methods. Submitted for publication to ICDE 2000. http://citeseer.ist.psu.edu/kornacker00analysis.html More
@techreport{ kornacker99analysis,
author = "Marcel Kornacker and Mehul Shah and Joseph Hellerstein",
title = "An Analysis Framework for Access Methods",
number = "CSD-99-1051",
month = "9,",
pages = "12",
year = "1999",
url = "citeseer.ist.psu.edu/kornacker00analysis.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
765
Trees: A Dynamic Index Structure for Spatial Searching (context) - Guttman - 1984
516
Tree: An Efficient and Robust Access Method for Points and R.. (context) - Beckmann, Kriegel et al. - 1990
262
Multidimensional Access Methods
- Gaede, Gunther - 1998
233
Tree: A Dynamic Index for Multidimensional Objects
- Sellis, Roussopoulos et al. - 1987
165
The SR-Tree: An Index Structure for High-Dimensional Nearest..
- Katayama, Satoh - 1997
162
Similarity Indexing with the SS-Tree (context) - White - 1996
162
Multilevel Hypergraph Partitioning: Applications in VLSI Dom..
- Karypis, Aggarwal et al. - 1997
117
Generalized Search Trees for Database Systems
- Hellerstein, Naughton et al. - 1995
101
Beyond Uniformity and Independence: Analysis of R-trees Usin..
- Faloutsos, Kamel - 1994
72
Nearest Neighbor (context) - Shaft, Beyer et al. - 1999
65
A Model for the Prediction of R-tree Performance
- Theodoridis, Sellis - 1996
46
DEVise: Integrated Querying and Visual Exploration of Large ..
- Livny, Ramakrishnan et al. - 1997
43
STR: A Simple and Efficient Algorithm for R-tree Packing
- Leutenegger, Lopez et al. - 1997
40
The Effect of Buffering on the Performance of R-Trees
- Leutenegger, Lopez - 1998
34
Correlation (context) - Belussi, Faloutsos et al. - 1995
11
Window queryoptimal clustering of spatial objects
- Pagel, Six et al. - 1995
8
Towards an Analysis of Range Query Performance in Spatial Da.. (context) - Pagel, Six et al. - 1993
6
Visualizing and Animating R-Trees and Spatial Operations in ..
- Brabec, Samet - 1998
3
amdb: An Access Method Debugging Tool
- Kornacker, Shah et al. - 1998
1
Are Window Queries Representative for Arbitrary Range Querie.. (context) - Pagel, Six - 1996
1
A Performance Stude of Sequential I/O on Windows NT (context) - Riedel - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://gist.cs.berkeley.edu/gist1.html): More
Blobworld: A System for Region-Based Image Indexing.. - Carson, Thomas.. (1999)
(Correct)
Generalized Search Trees for Database Systems - Hellerstein, Naughton, Pfeffer (1995)
(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