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 Michel Cordeiro(michel.brasil.c@gmail.com)
2 Rodrigo Blanco(rodrigomorante@gmail.com)
3 Wagner Nunan Zola(zola@ufpr.br)

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

Reference
# Reference
1 Ashkiani, S., Davidson, A., Meyer, U., and Owens, J. D. (2017). GPU Multisplit: an extended study of a parallel algorithm. ACM Transactions on Parallel Computing (TOPC), 4(1):1–44.
2 Axtmann, M., Witt, S., Ferizovic, D., and Sanders, P. (2022). Engineering in-place (shared-memory) sorting algorithms. ACM Transactions on Parallel Computing (TOPC), 9(1):1–62.
3 Bing-Chao, H. and Knuth, D. E. (1986). A one-way, stackless quicksort algorithm. BIT Numerical Mathematics, 26(1):127–130.
4 Bingmann, T., Eberle, A., and Sanders, P. (2017). Engineering parallel string sorting. Algorithmica, 77:235–286.
5 Blanco, R. M., Cordeiro, M. B., and Zola, W. M. N. (2025). Ordenação distribuída de pares chave-valor utilizando MPI. In Escola Regional de Alto Desempenho da Região Sul (ERAD-RS). SBC.
6 Casimiro, A., Broinizi, M. E., and Ferreira, J. (2014). Principais componentes na ordenação de anúncios: Um experimento em ambiente real de publicidade computacional. In Anais do XXIX Simpósio Brasileiro de Banco de Dados (SBBD 2014), pages 147–156. SBC.
7 Cavalcante, P. S. and Pinheiro, W. A. (2013). Mecanismo de encadeamento de notícias por reconhecimento de implicação textual. In Anais do XXVIII Simpósio Brasileiro de Banco de Dados (SBBD 2013), pages 157–162. SBC.
8 Cordeiro, M., Blanco, R., and Zola, W. (2025). Algoritmo paralelo e distribuído para ordenação chave-valor. In Anais da XX Escola Regional de Banco de Dados (ERBD 2025), pages 133–136. SBC.
9 Cordeiro, M. and Zola, W. (2025). Multiparticionamento de dados em GPU. In Anais da XXV Escola Regional de Alto Desempenho da Região Sul, pages 165–166. SBC.
10 Edelkamp, S. and Weiß, A. (2019). Blockquicksort: Avoiding branch mispredictions in quicksort. Journal of Experimental Algorithmics (JEA), 24:1–22.
11 Ferreira, D. P., González, S., and Vieira, G. M. D. (2023). Replicação descentralizada em bancos de dados distribuídos usando o algoritmo Paxos. In Anais do XXXVIII Simpósio Brasileiro de Banco de Dados (SBBD 2023), pages 282–294. SBC.
12 Frazer, W. D. and McKellar, A. C. (1970). Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM (JACM), 17(3):496–507.
13 Hoare, C. A. R. (1962). Quicksort. The Computer Journal, 5(1):10–16.
14 Hou, K., Wang, H., and Feng, W.-c. (2015). ASPaS: A framework for automatic SIMDization of parallel sorting on x86-based many-core processors. In Proceedings of the 29th ACM on International Conference on Supercomputing, pages 383–392.
15 Huang, J. S. and Chow, Y. C. (1983). Parallel sorting and data partitioning by sampling. In Proceedings of the Seventh International Computer Software and Applications Conference (COMPSAC), pages 627–631. IEEE.
16 Kokot, M., Deorowicz, S., and Długosz, M. (2018). Even faster sorting of (not only) integers. In Man-Machine Interactions 5: 5th International Conference on Man-Machine Interactions, ICMMI 2017 Held at Kraków, Poland, October 3-6, 2017, pages 481–491. Springer.
17 Kushagra, S., López-Ortiz, A., Qiao, A., and Munro, J. I. (2014). Multi-pivot quicksort: Theory and experiments. In 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 47–60. SIAM.
18 Merrill, D. and Grimshaw, A. (2011). High performance and scalable radix sorting: A case study of implementing dynamic parallelism for GPU computing. Parallel Processing Letters, 21(02):245–272.
19 Musser, D. R. (1997). Introspective sorting and selection algorithms. Software: Practice and Experience, 27(8):983–993.
20 Novaes, L. P., Vianna, D., and da Silva, A. (2023). Modelagem de tópicos para a tarefa de recuperação de casos legais. In Anais do XXXVIII Simpósio Brasileiro de Banco de Dados (SBBD 2023), pages 128–140. SBC.
21 Reinders, J. (2007). Intel threading building blocks: outfitting C++ for multi-core processor parallelism. O’Reilly Media, Inc.
22 Rodrigues, E., Pires, C. E., and Filho, D. N. (2024). Evolução incremental de esquemas de banco de dados orientado a documentos. In Anais do XXXIX Simpósio Brasileiro de Banco de Dados (SBBD 2024), pages 260–273. SBC.
23 Sanders, P. and Winkel, S. (2004). Super scalar sample sort. In European Symposium on Algorithms, pages 784–796. Springer.
24 Siebert, C. (2011). A scalable parallel sorting algorithm using exact splitting.
25 Sundar, H., Malhotra, D., and Biros, G. (2013). HykSort: a new variant of hypercube quicksort on distributed memory architectures. In Proceedings of the 27th international ACM conference on international conference on supercomputing, pages 293–302.
26 Tavares, T., Belloze, K., Goldschmidt, R., and Soares, J. (2024). Avaliação de diferentes técnicas de agrupamento no contexto da imputação em cascata. In Anais do XXXIX Simpósio Brasileiro de Banco de Dados (SBBD 2024), pages 687–693. SBC.