scientific article; zbMATH DE number 1304040

zbMATH Open0933.68040MaRDI QIDQ4250720FDOQ4250720

Authors: Paolo Ciaccia, Marco Patella 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• Embedding large complete binary trees in hypercubes with load balancing
• Space-efficient B trees via load-balancing
• Efficient bulk operations on dynamic \(R\)-trees
• Load balanced tree embeddings
• Embedding of \(k\)-ary complete trees into hypercubes with uniform load
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

zbMATH Keywords

multimedia databasesM-treeloading algorithm

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (3)

• Title not available (Why is that?)
• Pivot selection: dimension reduction for distance-based indexing
• New dynamic construction techniques for M-tree

This page was built for publication:

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