Abstract
A t-spanner, a subgraph that approximates graph distances within a precision factor t, is a well known concept in graph theory. In this paper we use it in a novel way, namely as a data structure for searching metric spaces. The key idea is to consider the t-spanner as an approximation of the complete graph of distances among the objects, and use it as a compact device to simulate the large matrix of distances required by successful search algorithms like AESA [Vidal 1986]. The t-spanner provides a time-space tradeoff where full AESA is just one extreme. We show that the resulting algorithm is competitive against current approaches, e.g., 1.5 times the time cost of AESA using only 3.21% of its space requirement, in a metric space of strings; and 1.09 times the time cost of AESA using only 3.83 % of its space requirement, in a metric space of documents. We also show that t-spanners provide better space-time tradeoffs than classical alternatives such as pivot-based indexes. Furthermore, we show that the concept of t-spanners has potential for large improvements.
This work has been supported in part by the Millenium Nucleus Center for Web Research, Grant P01-029-F, Mideplan, Chile (1st and 2nd authors), CYTED VII.19 RIBIDI Project (all authors), and AT&T LA Chile (2nd author).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
B. Bustos and G. Navarro. Probabilistic proximity searching algorithms based on compact partitions. In Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002), LNCS. Springer, 2002. To appear.
E. Chávez and G. Navarro. A probabilistic spell for the curse of dimensionality. In Proc. 3rd Workshop on Algorithm Engineering and Experiments (ALENEX’01), LNCS 2153, pages 147–160, 2001.
E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquin. Proximity searching in metric spaces. A CM Computing Surveys, 33(3):273–321, September 2001.
E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. on Computing, 28:210–236, 1998.
V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170–231, 1998.
J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. In Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000), LNCS v. 1851, pages 314–327, 2000.
G. Navarro and R. Paredes. Practical construction of metric t-spanners. Technical Report TR/DCC-2002-4, Dept. of Computer Science, Univ. of Chile, July 2002.
D. Peleg and A. Schaffer. Graph spanners. Journal of Graph Theory, 13(1):99–116, 1989.
E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Patt. Recog. Lett., 4:145–157, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Navarro, G., Paredes, R., Chávez, E. (2002). t-Spanners as a Data Structure for Metric Space Searching. In: Laender, A.H.F., Oliveira, A.L. (eds) String Processing and Information Retrieval. SPIRE 2002. Lecture Notes in Computer Science, vol 2476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45735-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-45735-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44158-8
Online ISBN: 978-3-540-45735-0
eBook Packages: Springer Book Archive