Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

PODS
1997
ACM

favoriteEmaildiscussreport

117views Database» more PODS 1997»

On the Analysis of Indexing Schemes

13 years 8 months ago

On the Analysis of Indexing Schemes

Download db.cs.berkeley.edu

We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We dene a framework for measuring the eciency of an indexing scheme for a workload based on two characterizations: storage redundancy (how many times each item in the data set is stored), and access overhead (how many times more blocks than necessary does a query retrieve). Using this frameworkwe present some initial results, showing upper and lower bounds and trade-os between them in the case of multi-dimensional range queries and set queries.

Joseph M. Hellerstein, Elias Koutsoupias, Christos

Real-time Traffic

Data Set | Database | General Database Workloads | PODS 1997 | Potential Queries |

claim paper

Related Content

» Centralized versus Distributed Index Schemes in OODBMS A Performance Analysis

» On Index Selection Schemes for Nested Object Hierarchies

» Exponential Index A Parameterized Distributed Indexing Scheme for Data on Air

» LIGHT A QueryEfficient Yet LowMaintenance Indexing Scheme over DHTs

» A comparative analysis of biometric secretkey binding schemes based on QIM and WynerZiv co...

» Shapebased Invariant Texture Indexing

» On Multidimensional Hilbert Indexings

» A Markov Chain Model for the Analysis of RoundRobin Scheduling Scheme

» A novel scheme for domaintransfer problem in the context of sentiment analysis

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	PODS
Authors	Joseph M. Hellerstein, Elias Koutsoupias, Christos H. Papadimitriou

Comments (0)