Execution time analysis of a top-down R-tree construction algorithm

DOI10.1016/J.IPL.2006.07.010MaRDI QIDQ845880zbMATH OpenOpenAlexFDO

Authors Houman Alborzi, Hanan Samet

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.07.010

zbMATH Keywords

data structurespackingspatial databasesbulk loadingR-trees

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Constructing optimal search trees in optimal time
• Construction of a tree from its traversals in optimal time and space
• Time optimal left to right construction of position trees
• Plug-and-play dual-tree algorithm runtime analysis
• scientific article; zbMATH DE number 1285798
• Linear-time construction of treaps and Cartesian trees
• On the construction of weighted time-optimal B-trees
• Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs

Cites work

• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• Efficient bulk operations on dynamic \(R\)-trees
• Foundations of multidimensional and metric data structures.

This page was built for publication: Execution time analysis of a top-down R-tree construction algorithm

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