Abstract
Metric Access Methods (MAMs) have been proved to allow performing similarity queries over complex data more efficiently than other access methods. They can be considered dynamic or static depending on the pivot type used in their construction. Global pivots tend to compromise the dynamicity of MAMs, as eventual pivot-related updates must be propagated through the entire structure, while local pivots allow this maintenance to occur locally. Several applications handle online complex data and, consequently, demand efficient dynamic indexes to be successful. In this context, this work presents two techniques for improving the pruning ability of dynamic MAMs: (i) using cutting local additional pivots to reduce distance calculations and (ii) anticipating information from child nodes to reduce unnecessary disk accesses. The experiments reveal significant improvements in a dynamic MAM, reducing execution time in more than 50 % for similarity queries posed on datasets ranging from moderate to high dimensionality and cardinality.
This research has been supported by scholarship grants from the Brazilian Coordination for the Improvement of Higher Education Personnel (CAPES).
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
Notes
- 1.
Available at: http://aloi.science.uva.nl.
- 2.
Available at: http://cophir.isti.cnr.it.
- 3.
References
Batko, M., Kohoutkova, P., Novak, D.: CoPhIR image collection under the microscope. In: 2nd International Workshop on Similarity Search and Applications, pp. 47–54. IEEE Computer Society, Washington, DC (2009)
Bolettieri, P., Esuli, A., Falchi, F., Lucchese, C., Perego, R., Piccioli, T., Rabitti, F.: CoPhIR: A Test Collection for Content-Based Image Retrieval. Computing Research Repository abs/0905.4627v2 (2009)
Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Commun. ACM 16(4), 230–236 (1973)
Carélo, C.C.M., Pola, I.R.V., Ciferri, R.R., Traina, A.J.M., Traina Jr., C., Ciferri, C.D.A.: Slicing the metric space to provide quick indexing of complex data in the main memory. Inf. Syst. 36(1), 79–98 (2011)
Ciaccia, P., Patella, M., Zezula, P.: M-Tree: An efficient access method for similarity search in metric spaces. In: 23rd International Conference on Very Large Data Bases, pp. 426–435. Morgan Kaufmann, San Francisco (1997)
Deza, M.M., Deza, E.: Encyclopedia of Distances. Springer, Heidelberg (2009)
Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Inf. Process. Manage. 48(5), 889–902 (2012)
Faloutsos, C.: Searching Multimedia Databases by Content. Advances in Database Systems, vol. 3. Springer, New York (1996)
Gaede, V., Gunther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170–231 (1998)
Geusebroek, J.M., Burghouts, G.J., Smeulders, A.W.M.: The amsterdam library of object images. Int. J. Comput. Vis. 61(1), 103–112 (2005)
Pola, I.R.V., Traina Jr., C., Traina, A.J.M.: The MM-tree: a memory-based metric tree without overlap between nodes. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol. 4690, pp. 157–171. Springer, Heidelberg (2007)
Skopal, T., Hoksza, D.: Improving the performance of M-Tree family by nearest-neighbor graphs. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol. 4690, pp. 172–188. Springer, Heidelberg (2007)
Skopal, T., Pokorný, J., Snášel, V.: Nearest neighbours search using the PM-tree. In: Zhou, L., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 803–815. Springer, Heidelberg (2005)
Traina Jr., C., Filho, R.F.S., Traina, A.J.M., Vieira, M.R., Faloutsos, C.: The omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J. 16(4), 483–505 (2007)
Traina Jr., C., Traina, A.J.M., Faloutsos, C., Seeger, B.: Fast indexing and visualization of metric data sets using slim-trees. IEEE Trans. Knowl. Data Eng. 14(2), 244–260 (2002)
Traina Jr., C., Traina, A.J.M., Filho, R.F.S., Faloutsos, C.: How to improve the pruning ability of dynamic metric access methods. In: 11th International Conference on Information and Knowledge Management, pp. 219–226. ACM, New York (2002)
Vieira, M.R., Traina Jr., C., Chino, F.J.T., Traina, A.J.M.: DBM-Tree: trading height-balancing for performance in metric access methods. J. Braz. Comput. Soc. 11(3), 37–51 (2005)
Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol. 32. Springer, New York (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Oliveira, P.H., Traina, C., Kaster, D.S. (2015). Improving the Pruning Ability of Dynamic Metric Access Methods with Local Additional Pivots and Anticipation of Information. In: Tadeusz, M., Valduriez, P., Bellatreche, L. (eds) Advances in Databases and Information Systems. ADBIS 2015. Lecture Notes in Computer Science(), vol 9282. Springer, Cham. https://doi.org/10.1007/978-3-319-23135-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-23135-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23134-1
Online ISBN: 978-3-319-23135-8
eBook Packages: Computer ScienceComputer Science (R0)