E. Bugnion, S. Fhei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In R. Baeza-Yates and N. Ziviani, editors, Proc. 1st South American Workshop on String Processing (WSP'93), pages 43--53, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Searching in Metric Spaces - Chávez, Navarro, Baeza-Yates, .. (1999) (8 citations) (Correct)
.... ff ) FQA [24] nhb bits O(nh) O(log n) O(n ff log n) VPT [62, 68, 26] n pointers O(n log n) O(log n) MVPT [16, 15] n pointers O(n log n) O(log n) VPF [69] n pointers O(n 2 Gammaff ) O(n 1 Gammaff log n) BST [44, 52] n pointers O(n log n) not analyzed GHT [62, 18] n pointers O(n log n) not analyzed GNAT [16] nm 2 distances O(nm log m n) not analyzed VT [32, 51, 63] n pointers O(n log n) not analyzed MT [27] n pointers O(n(m: m 2 ) log m n) not analyzed SAT [48] n pointers O(n log n= log log n) O(n 1 Gamma Theta(1= loglog n) ....
....if d(q; c 1 ) Gamma r d(q; c 2 ) r and into the right subtree if d(q; c 2 ) Gamma r d(q; c 1 ) r. Again, it is possible to enter into both subtrees. In [62] it is argued that GHTs could work better than VPTs in high dimensions. The same idea of reusing the parent node is proposed in [18], this time to avoid performing two distance evaluations at each node. GNAT The GHT is extended in [16] to an m ary tree, called GNAT (Geometric Near neighbor Access Tree) keeping the same essential idea. We select, for the first level, m centers c 1 : c m , and define U i = fu 2 U; d(c i ; u) ....
E. Bugnion, S. Fhei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In R. Baeza-Yates and N. Ziviani, editors, Proc. 1st South American Workshop on String Processing (WSP'93), pages 43--53, 1993.
Incremental Similarity Search in Multimedia Databases - Hjaltason, Samet (2000) (3 citations) (Correct)
....used to determine when to visit children. 34 4.3. 3 Other Methods Related to Generalized Hyperplane Partitioning A structure very similar to the gh tree, termed the monotonous (sic) bisector tree (abbreviated below as mb tree) was proposed by Noltemeier et al. 52] and used by Bugnion et al. [10]) The intended application was to point data using Minkowskimetrics (and an extension, the mb tree, was defined for complex objects, such as lines and polygons) but the mb tree is generally applicable to arbitrary metrics. In the mb tree, one of the two pivots in each nonleaf node n, except for ....
E. Bugnion, S. Fei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In Proceedings of the 1st South American Workshop on String Processing (WSP'93), R. Baeza-Yates and N. Ziviani, eds., pages 43--53, Belo Horizonte, Brazil, September 1993. 64
Searching in Metric Spaces - Chavez, Navarro, Baeza-Yates.. (1999) (8 citations) (Correct)
....c 1 ) Gamma r d(q; c 2 ) r and into the right subtree if d(q; c 2 ) Gamma r d(q; c 1 ) r. Again, it is possible to enter into both subtrees. In [Uhlmann 1991b] it is argued that GHTs could work better than VPTs in high dimensions. The same idea of reusing the parent node is proposed in [Bugnion et al. 1993], this time to avoid performing two distance evaluations at each node. 5.1.2.6 GNAT. The GHT is extended in [Brin 1995] to an m ary tree, called GNAT (Geometric Near neighbor Access Tree) keeping the same essential idea. We select, for the first level, m centers c 1 : c m , and define U i = fu ....
Bugnion, E., Fhei, S., Roos, T., Widmayer, P., and Widmer, F. 1993. A spatial index for approximate multiple string matching. In R. Baeza-Yates and N. Ziviani Eds., Proc. 56 \Delta E. Ch'avez et al.
Searching in Metric Spaces - Chávez, Navarro, Baeza-Yates, .. (1999) (8 citations) (Correct)
....r. Again, it is possible to enter into both subtrees. The reporting is done as always, as well as the extension to handle queries of type (b) In [54] it is argued that this could work better than VPTs in high dimensions. To avoid performing two distance evaluations at each node, it is proposed in [18] to reuse one of the pivots of the previous level. Figure 5 illustrates the first step of the tree construction. No analysis is given in [54] but we obtain it by specializing the more general GNATs. p2 p5 p4 p6 p12 p10 p9 p8 p3 p7 p11 p15 p14 p1 p13 p10 p13 p5 p4 p11 p2 p12 p3 p7 p1 ....
E. Bugnion, S. Fhei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In R. Baeza-Yates and N. Ziviani, editors, Proc. 1st South American Workshop on String Processing (WSP'93), pages 43--53, 1993.
Searching in Metric Spaces - Chávez, Navarro, Baeza-Yates, .. (1999) (8 citations) (Correct)
.... O(log n) O(n ) FQA [24] nhb bits O(nh) O(log n) O(n log n) VPT [61, 67, 25] n pointers O(n log n) O(log n) MVPT [16, 15] n pointers O(n log n) O(log n) VPF [68] n pointers O(n 2 ) O(n 1 log n) BST [43, 51] n pointers O(n log n) not analyzed GHT [61, 18] n pointers O(n log n) not analyzed GNAT [16] nm 2 distances O(nm log m n) not analyzed VT [31, 50, 62] n pointers O(n log n) not analyzed MT [26] n pointers O(n(m: m 2 ) log m n) not analyzed SAT [47] n pointers O(n log n= log log n) O(n 1 (1= log log n) AESA [63] n 2 ....
....the left subtree if d(q; c 1 ) r d(q; c 2 ) r and into the right subtree if d(q; c 2 ) r d(q; c 1 ) r. Again, it is possible to enter into both subtrees. In [61] it is argued that GHTs could work better than VPTs in high dimensions. The same idea of reusing the parent node is proposed in [18], this time to avoid performing two distance evaluations at each node. GNAT The GHT is extended in [16] to an m ary tree, called GNAT (Geometric Near neighbor Access Tree) keeping the same essential idea. We select, for the rst level, m centers c 1 : c m , and de ne U i = fu 2 U; d(c i ; u) ....
E. Bugnion, S. Fhei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In R. Baeza-Yates and N. Ziviani, editors, Proc. 1st South American Workshop on String Processing (WSP'93), pages 43-53, 1993.
Proximity Matching Using Fixed-Queries Trees - Baeza-Yates, Cunto, Manber, Wu (Correct)
No context found.
Bugnion, E. and Roos, T. and Shi, F. and Widmayer, P. and Widmer, F. "A Spatial Index for Approximate Multiple String Matching", 1st South American Workshop on String Processing, Belo Horizonte, Sept 1993, 43--54.
Near Neighbor Search in Large Metric Spaces - Brin (1995) (78 citations) (Correct)
No context found.
E. Bugnion, S. Fei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In Proc. First South American Workshop on String Processing, Belo Horizonte, Brazil, pages 43--53, nivio@dcc.ufmg.br, September 1993.
Near Neighbor Search in Large Metric Spaces - Brin (1995) (78 citations) (Correct)
No context found.
E. Bugnion, S. Fei, T. Roos, P. Widmayer, and F. Widmer. A spatial index for approximate multiple string matching. In Proc. First South American Workshop on String Processing, Belo Horizonte, Brazil, September 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC