An efficient zoning technique for multi-dimensional access methods

Authors:
Byunggu Yu;Seon Ho Kim
Affiliations:
Computer Science Department, University of Wyoming, Laramie, WY;Computer Science Department, University of Denver, Denver, CO
Venue:
TEAA'05 Proceedings of the 31st VLDB conference on Trends in Enterprise Application Architecture
Year:
2005

Citing 17
Cited 2

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
An introduction to disk drive modeling

Computer
Topological relations in the world of minimum bounding rectangles: a study with R-trees

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Time- and space-optimality in B-trees

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A retrieval technique for high-dimensional data and partially specified queries

Data & Knowledge Engineering
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data

The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Advances in Disk Technology: Performance Issues

Computer
The Effect of Buffering on the Performance of R-Trees

IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases

Zoned-partitioning of tree-like access methods

Information Systems
Construction of tree-based indexes for level-contiguous buffering support

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In emerging database applications that deal with large sets of multidimensional data, the performance of the query system significantly depends on the performance of its access methods and the underlying disk system. In recent years, hard disks are manufactured with multiple physical zones, where seek times and data transfer rates vary significantly across the zones. However, there is a marked lack of investigation on how to optimize multidimensional access methods given a zoned disk model. The paper proposes a novel dynamic zoning technique called DMD-Zoning that can be applied to a variety of multidimensional access methods and that can fully utilize zoning characteristics of hard disks for busy multi-user database systems.