Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2002). Mixed Integer Problems for Finding Optimal Tree-Based Index Structures. In: Index Structures for Data Warehouses. Lecture Notes in Computer Science, vol 1859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45935-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-45935-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43368-2
Online ISBN: 978-3-540-45935-4
eBook Packages: Springer Book Archive