New dynamic construction techniques for M-tree

DOI10.1016/J.JDA.2008.09.013MaRDI QIDQ1013073zbMATH OpenOpenAlexFDO

Authors Tomáš Skopal, Jakub Lokoč

Publication date 16 April 2009

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2008.09.013

zbMATH Keywords

metric access methodsdynamic insertionforced reinsertionsM-tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Recommendations

• Algorithms and Computation
• A new algorithm for the construction of optimal B-trees
• scientific article; zbMATH DE number 753967
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Dynamic tree algorithms
• Dynamic trees in practice
• An Improved Succinct Representation for Dynamic k-ary Trees
• Dynamic Trees with Almost-Optimal Access Cost

Cites work

• scientific article; zbMATH DE number 1304040 (Why is no real title available?)
• Foundations of multidimensional and metric data structures.

Cited in

(2)

• scientific article; zbMATH DE number 1870076 (Why is no real title available?)
• Dynamic spatial approximation trees

Describes a project that uses

Uses Software

• M-TREE

This page was built for publication: New dynamic construction techniques for M-tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013073)