This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
5. Further Reading
S. Berchtold, C. Boehm, B. Braunmueller, D. A. Keim and H.-P. Kriegel: “Fast Parallel Similarity Search in Multimedia Databases”, Proceedings of the ACM International Conference on Management of Data (SIGMOD’97), pp.1–12, Tucson, AZ, 1997.
B. Seeger and P.A. Larson: “Multi-Disk B-trees”, Proceedings of the ACM International Conference on Management of Data (SIGMOD’91), pp.436–445, Denver, CO, 1991.
P. Trianafillou and C. Faloutsos: “Overlay Striping and Optimal Parallel 1/O for Modern Applications”, Parallel Computing, Vol.24, No.1, pp.21–43, 1998.
P. Zezula, P. Savino, F. Rabitti, G. Amato, P. Ciaccia: “Processing M-trees with Parallel Resources”, Proceedings of the 8th International Workshop on Research Issues in Data Engineering (RIDE’98), pp.147–154, 1998.
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2005). Multidisk Query Processing. In: Nearest Neighbor Search. Series in Computer Science. Springer, Boston, MA . https://doi.org/10.1007/0-387-27544-4_7
Download citation
DOI: https://doi.org/10.1007/0-387-27544-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-22963-8
Online ISBN: 978-0-387-27544-4
eBook Packages: Computer ScienceComputer Science (R0)