Mixed Integer Problems for Finding Optimal Tree-Based Index Structures

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1859)


This chapter describes an approach for finding optimal index structures by mapping the problem into a Mixed Integer Problem (MIP) and then solving the MIP using standard algorithms.


Time Complexity Leaf Node Index Structure Heuristic Approach Integer Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Personalised recommendations