Multidimensional access methods

Gaede, Volker; Günther, Oliver

doi:10.1145/280277.280279

Cited by 1,266 publications

(765 citation statements)

References 119 publications

Supporting

Mentioning

741

Contrasting

Unclassified

Order By: Relevance

“…For a survey on these methods see [7]. We focus in this paper in general metric spaces, although the solutions are well suited also for D-dimensional spaces.…”

Section: Nearest Neighbor Query (K-nn)mentioning

confidence: 99%

Enlarging nodes to improve dynamic spatial approximation trees

Barroso

Reyes

Paredes

2010

Proceedings of the Third International Conference on SImilarity Search and APplications

View full text Add to dashboard Cite

The metric space model allows abstracting many similarity search problems. Similarity search has multiple applications especially in the multimedia databases area. The idea is to index the database so as to accelerate similarity queries. Although there are several promising indices, few of them are dynamic, i.e., once created very few allow to perform insertions and deletions of elements at a reasonable cost.The Dynamic Spatial Approximation Trees (DSA-trees) have shown to be a suitable data structure for searching high dimensional metric spaces or queries with low selectivity (i.e., large radius), and are also completely dynamic. The performance of DSA-trees is directly related to the amount of backtracking in search time. To boost the performance in this data structure a sufficient condition is to maintain in the nodes elements close-to-each-other. In this work we propose a new data structure for searching in metric spaces, based on the DSA-tree, which holds its virtues and takes advantage of element clusters, which are present in many metric spaces, and can also make better use of available memory to improve searches. In fact, we use these element clusters to improve the spatial approximation.

show abstract

“…For a survey on these methods see [7]. We focus in this paper in general metric spaces, although the solutions are well suited also for D-dimensional spaces.…”

Section: Nearest Neighbor Query (K-nn)mentioning

confidence: 99%

Enlarging nodes to improve dynamic spatial approximation trees

Barroso

Reyes

Paredes

2010

Proceedings of the Third International Conference on SImilarity Search and APplications

View full text Add to dashboard Cite

show abstract

“…There is a wealth of publications in the the area of spatial databases [5] and computational geometry [11]. However, these spatial indexes, especially those used for geographic information systems applications, assume little or no overlapping among the objects, and when the objects are large, static segmentation is used to reduce large objects to many small rectangles, which increases the space and insertion cost.…”

Section: The Rc-treementioning

confidence: 99%

Coordination of Many Agents

2005

View full text Add to dashboard Cite

Abstract. This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framework is a highly structured shared store in the form of a constraint logic program (CLP), which is used as a knowledge base and being reacted to by agents through the use of "reactors". The biggest challenge arising from such a reactive programming framework using CLP is to develop a trigger mechanism that allows efficient "wakeup" of blocked reactors. This paper addresses the architecture of this open framework, and discusses a general methodology for doing triggering of logic conditions using views and abstractions.

show abstract

“…B-Trees, for instance, provide one-dimensional clustering. Multidimensional clustering has been discussed in the field of multidimensional access methods (e.g., [GG97,Sam90] A great deal of research has been done in the field of access methods and access path selection. Especially for DW environments, specialized access methods have been proposed [Inf97,OQ97].…”

Section: Rdbms and Query Processingmentioning

confidence: 99%

MISTRAL: Processing Relational Queries using a Multidimensional Access Technique

Markl

2000

Ausgezeichnete Informatikdissertationen 1999

View full text Add to dashboard Cite

PrefaceClassical one dimensional B-trees have been the standard access method of all commercial database systems for many years. This dissertation is a very promising effort to introduce universal B-trees (UB-trees), the multidimensional variant of Btrees, as a basic access method into the core of fundamental DB-technology. The universal relevance of UB-trees is a consequence of the fact, that every relation can be considered as a set of points in multidimensional space. UB-trees organize this space for efficient processing of the data, resulting for many types of queries in orders of magnitude improvement over classical methods.The thesis lays the theoretical foundations of UB-tress, predicts their performance by analytical models and validates these models by experiments using large real world databases and real life applications and queries from the field of datawarehousing. The need to sort data and intermediate results frequently is an annoying drawback of today' s query processing methods. In combination with the Tetris algorithm UBtrees allow to avoid sorting in most cases, leading to dramatic improvements of response time, storage requirement and overall query processing time.Adding a new access method requires to consider all aspects of database systems:-architecture of subsystems -query optimization -query processing -multiuser operation and synchronization -bulk loading -storage requirement -parallelism, etc.Since UB-trees rely on classical B-trees for their implementation, all of these issues can be solved in a satisfactory way and can be dealt with elegantly.The performance experiments reported in this thesis were carried out with an implementation of UB-trees as a middleware layer on top of SQL. Additional performance improvements can be gained by integrating the UB-tree technology in the kernel of database systems.This thesis is a cornerstone of the MISTRAL project. MISTRAL has the goal to introduce UB-trees as a new access method into database systems with the fascinating vision, to extend fundamental database technology in an essential way. MISTRAL is financially supported by SAP, Teijin, NEC, Hitachi, the European Commission, Project MDA, TAS, Gfk and Microsoft. Abstract:A multidimensional access method offering significant performance increases by intelligently partitioning the query space is applied to relational database management systems (RDBMS). We introduce a formal model for multidimensional partitioned relations and discuss several typical query patterns. The model identifies the significance of multidimensional range queries and sort operations. The discussion of current access methods gives rise to the need for a multidimensional partitioning of relations. A detailed analysis of space partitioning focussing especially on Z-ordering illustrates the principle benefits of multidimensional indexes. After describing the UB-Tree and its standard algorithms for insertion, deletion, point queries, and range queries, we introduce the spiral algorithm for nearest neighbor queries with UB-Tree...

show abstract

Multidimensional access methods

Cited by 1,266 publications

References 119 publications

Enlarging nodes to improve dynamic spatial approximation trees

Enlarging nodes to improve dynamic spatial approximation trees

Coordination of Many Agents

MISTRAL: Processing Relational Queries using a Multidimensional Access Technique

Contact Info

Product

Resources

About