Open AccessProceedings Article
Native Multidimensional Indexing in Relational Databases
David Hoksza,Tomáš Skopal +1 more
- 01 Jan 2008
pp 251-260
TL;DR: This paper proposes a native multidimensional method for indexing tables with simple attributes, such that multi-attribute queries can be processed more eciently than by simple B + -tree with compound keys.
read more
Abstract: In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes is provided by B + -tree (or it’s variants) with compound keys. On the other hand, such systems provide also multidimensional indexing, however, just for spatial purposes (such as GIS or CAD applications) and use special data types and querying syntax. In this paper we propose a native multidimensional method for indexing tables with simple attributes, such that multi-attribute queries can be processed (with standard SQL queries) more eciently than by simple B + -tree with compound keys. For implementation we have used the PostgreSQL and Rtree-based index, though our method is applicable to any other multidimensional indexing method. With this combination we outperformed commercial platforms (Oracle, SQL Server) by an order of magnitude in the number of accesses to index. As a by-product, a framework for easy implementation of external indexing methods into PostgreSQL was designed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Books online
TL;DR: Microsoft Operations Manager (MOM) 2005: Integrated for the Dell Scalable Enterprise reveals best practices for MOM 2005 integration of complete solution stacks—including managed application, OS, virtualization, server, and data center infrastructure—to help you achieve the scalable enterprise benefits of simplified operations, improved resource utilization, and cost-effective scaling.
59
References
R-trees: a dynamic index structure for spatial searching
Antonin Guttman
- 01 Jun 1984
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
8K
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann,Hans-Peter Kriegel,Ralf Schneider,Bernhard Seeger +3 more
- 01 May 1990
TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
•Proceedings Article
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
Paolo Ciaccia,Marco Patella,Pavel Zezula +2 more
- 25 Aug 1997
TL;DR: The results demonstrate that the Mtree indeed extends the domain of applicability beyond the traditional vector spaces, performs reasonably well in high-dimensional data spaces, and scales well in case of growing files.
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
Timos Sellis,Nick Roussopoulos,Christos Faloutsos +2 more
- 01 Sep 1987
TL;DR: A variation to Guttman’s Rtrees (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree is introduced and analytical results indicate that R+-Trees achieve up to 50% savings in disk accesses compared to an R-tree when searching files of thousands of rectangles.
Searching in metric spaces
TL;DR: A unified view of all the known proposals to organize metric spaces, so as to be able to understand them under a common framework, and presents a quantitative definition of the elusive concept of "intrinsic dimensionality".
1.4K