Abstract
In digital libraries, nearest-neighbor search (NN-search) plays a key role for content-based retrieval over multimedia objects. However, performance of existing NN-search techniques is not satisfactory with large collections and with high-dimensional representations of the objects. To obtain response times that are interactive, we pursue the following approach: it uses a linear algorithm that works with approximations of the vectors and parallelizes it. In more detail, we parallelize NN-search based on the VA-File in a Network of Workstations (NOW). This approach reduces search time to a reasonable level for large collections. The best speedup we have observed is by almost 30 for a NOW with only three components with 900 MB of feature data. But this requires a number of design decisions, in particular when taking load dynamism and heterogeneity of components into account. Our contribution is to address these design issues.
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.
Similar content being viewed by others
References
S. Berchtold, C. Böhm, B. Braunmüller, D.A. Keim, and H.-P. Kriegel. Fast parallel similarity search in multimedia databases. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 1–12, Tucson, USA, 1997.
S. Berchtold, D.A. Keim, and H.-P. Kriegel. The X-tree: An index structure forhigh-dimensional data. In Proc. of the Int. Conference on Very Large Databases, pages 28–39, 1996.
Jakob Bosshard. An open and powerful relevance feedback engine for content-basedimage-retrieval. Diploma thesis (in english), Institute of Information Systems, ETH, Zurich, 2000.
P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proc. of the Int. Conference on Very Large Databases, Greece, 1997.
P. Ciaccia, P. Tiberio, and P. Zezula. Declustering of key-based partitioned signature files. ACM Transactions on Database Systems, 21(3), September 1996.
M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker. Query by image and video content: The QBIC system. Computer, 28(9):23–32, September 1995.
A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 47–57, Boston, MA, June 1984.
I. Kamel and C. Faloutsos. Parallel R-trees. Technical Report CS-TR-2820, University of Maryland Institute for Advanced Computer Studies Dept. of Computer Science, Univ. of Maryland, College Park, MD, January 6 1992.
NASA. Nasa’s eos program. http://www.eos.nasa.gov/, http://eospso.gsfc.nasa.gov/, http://spsosun.gsfc.nasa.gov/New EOSDIS.html.
G. Panagopoulos and C. Faloutsos. Bit-sliced signature files for very large text databases on a parallel machine architecture. Lecture Notes in Computer Science, 779, 1994.
A. N. Papadopoulos and Y. Manolopoulos. Similarity query processing using disk arrays. SIGMOD Record (ACM Special Interest Group on Management of Data), 27(2), 1998.
H.-J. Schek and R. Weber. Higher-Order Databases and Multimedia Information. In Proc. of the Swiss/Japan Seminar “Advances in Databases and Multimedia for the New Century-A Swiss/Japanese Perspective”, Kyoto, Japan, December 1-2, 1999, Singapore, 2000. World Scientific Press.
Columbia University. Webseek: A content-based image and video search and catalog tool for the web. http://disney.ctr.columbia.edu/webseek/.
R. Weber and K. Böhm. Trading Quality for Time with Nearest-Neighbor Search. In Advances in Database Technology EDBT 2000, Proc. of the 7th Int. Conf. on Extending Database Technology, Konstanz, Germany, March 2000, volume 1777 of Lecture Notes in Computer Science, pages 21–35, Berlin, 2000. Springer-Verlag.
R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the Int. Conference on Very Large Databases, New York, USA, August 1998.
Roger Weber, Jürg Bolliger, Thomas Gross, and Hans-J. Schek. Architecture of a networked image search and retrieval system. In Eighth International Conference on Information and Knowledge Management (CIKM99), Kansas City, Missouri, USA, November 2–6 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, R., Böhm, K., Schek, HJ. (2000). Interactive-Time Similarity Search for Large Image Collections Using Parallel VA-Files. In: Borbinha, J., Baker, T. (eds) Research and Advanced Technology for Digital Libraries. ECDL 2000. Lecture Notes in Computer Science, vol 1923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45268-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-45268-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41023-2
Online ISBN: 978-3-540-45268-3
eBook Packages: Springer Book Archive