SBBD

Paper Registration

1

Select Book

2

Select Paper

3

Fill in paper information

4

Congratulations

Fill in your paper information

English Information

(*) To change the order drag the item to the new position.

Authors
# Name
1 Luiz Brito(luiz.brito@ufu.br)
2 Marcelo Albertini(albertini@ufu.br)

(*) To change the order drag the item to the new position.

Reference
# Reference
1 Camoglu, O., Kahveci, T., and Singh, A. K. (2003). Towards index-based similarity search for protein structure databases. In Computational Systems Bioinformatics, pages 148–158. IEEE.
2 Ciaccia, P., Patella, M., and Zezula, P. (1997). M-tree: An efficient access method for similarity search in metric spaces. In VLDB ’97, pages 426–435. M. K. Publishers Inc.
3 Faloutsos, C., Ranganathan, M., and Manolopoulos, Y. (1994). Fast subsequence matching in time-series databases. In SIGMOD Rec., volume 23, pages 419–429. ACM.
4 Fu, A. W.-C., Keogh, E., Lau, L. Y., Ratanamahatana, C. A., and Wong, R. C.-W. (2008). Scaling and time warping in time series querying. In The VLDB Journal, volume 17, pages 899–921. Springer-Verlag New York, Inc.
5 Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In SIGMOD Rec., volume 14, pages 47–57. ACM.
6 Kotsifakos, A., Karlsson, I., Papapetrou, P., Athitsos, V., and Gunopulos, D. (2015). Embedding-based subsequence matching with gaps-range-tolerances: A query-by-humming application. In The VLDB Journal, volume 24, pages 519–536. Springer-Verlag New York, Inc.
7 Moon, Y.-S., Whang, K.-Y., and Loh, W.-K. (2001). Duality-based subsequence matching in time-series databases. In Proc. 17th Int. Conf. Data Engineering, pages 263–272. IEEE.
8 Orchard, M. T. (1991). A fast nearest-neighbor search algorithm. In ICASSP 91: 1991 Int. Conf. Acoustics, Speech, and Signal Processing, volume 4, pages 2297–2300. IEEE.
9 Park, H.-S. and Jun, C.-H. (2009). A simple and fast algorithm for k-medoids clustering. In Expert Systems with Applications, volume 36, pages 3336–3341. Elsevier.