¸c˜ao por apresentar conceitos e estruturas utilizadas no processamento das consulta por locais influentes.
[Arroyuelo et al. 2014] Arroyuelo, D., Bonacic, C., Gil-Costa, V., Marin, M., e Dis- tributed text search using suffix arrays. Parallel Computing, 40(9):471–495.
[Athayde-Novaes 2017] Athayde-Novaes, T. F. (2017). Processamento distribu´ıdo da consulta espa¸co textual top-k. 2017. 80p. Disserta¸c˜ao, Universidade Estadual de Feira de Santana, Programa de P´os-Gradua¸c˜ao em Computa¸c˜ao Aplicada.
[Beckmann et al. 1990] Beckmann, N., Kriegel, H.-P., Schneider, R., e Seeger, B.
(1990). The r*-tree: an efficient and robust access method for points and rectan- gles. In Acm Sigmod Record, volume 19, pp. 322–331. ACM.
[Cambazoglu et al. 2006] Cambazoglu, B. B., Catal, A., e Aykanat, C. (2006). Effect of inverted index partitioning schemes on performance of query processing in parallel text retrieval systems. In ISCIS, pp. 717–725. Springer.
[Cao et al. 2012] Cao, X., Chen, L., Cong, G., Jensen, C. S., Qu, Q., Skovsgaard, A., Wu, D., e Yiu, M. L. (2012). Spatial keyword querying. In International Conference on Conceptual Modeling, pp. 16–29. Springer.
[Chen et al. 2013] Chen, L., Cong, G., Jensen, C. S., e Wu, D. (2013). Spatial keyword query processing: an experimental evaluation. In Proceedings of the VLDB Endowment, volume 6, pp. 217–228. VLDB Endowment.
[Chen et al. 2014] Chen, Z., Liu, Y., Wong, R. C.-W., Xiong, J., Mai, G., e Long, C. (2014). Efficient algorithms for optimal location queries in road networks. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp. 123–134. ACM.
[Chen et al. 2015] Chen, Z., Liu, Y., Wong, R. C.-W., Xiong, J., Mai, G., e Long, C. (2015). Optimal location queries in road networks. ACM Transactions on Database Systems (TODS), 40(3):17.
[Choudhury et al. 2016] Choudhury, F. M., Culpepper, J. S., Sellis, T., e Cao, X.
(2016). Maximizing bichromatic reverse spatial and textual k nearest neighbor queries. Proceedings of the VLDB Endowment, 9(6):456–467.
[Chung et al. 2018] Chung, Y.-C., Su, I.-F., e Lee, C. (2018). k-most suitable loca- tions selection. GeoInformatica, pp. 1–32.
45
[Cohen et al. 2003] Cohen, W., Ravikumar, P., e Fienberg, S. (2003). A comparison of string metrics for matching names and records.
[Comer 1979] Comer, D. (1979). Ubiquitous b-tree. ACM Computing Surveys (CSUR), 11(2):121–137.
[Cong et al. 2009] Cong, G., Jensen, C. S., e Wu, D. (2009). Efficient retrieval of the top-k most relevant spatial web objects. Proceedings of the VLDB Endowment, 2(1):337–348.
[de Almeida e Rocha-Junior 2016] de Almeida, J. P. D. e Rocha-Junior, J. B.
(2016). Top-k spatial keyword preference query. Journal of Information and Data Management, 6(3):162.
[Du et al. 2005] Du, Y., Zhang, D., e Xia, T. (2005). The optimal-location query.
In International Symposium on Spatial and Temporal Databases, pp. 163–180.
Springer.
[G¨uting 1994] G¨uting, R. H. (1994). An introduction to spatial database sys- tems. The VLDB Journal-The International Journal on Very Large Data Bases, 3(4):357–399.
[Huang et al. 2011] Huang, J., Wen, Z., Qi, J., Zhang, R., Chen, J., e He, Z. (2011).
Top-k most influential locations selection. In Proceedings of the 20th ACM inter- national conference on Information and knowledge management, pp. 2377–2380.
ACM.
[Kang et al. 2007] Kang, J. M., Mokbel, M. F., Shekhar, S., Xia, T., e Zhang, D.
(2007). Continuous evaluation of monochromatic and bichromatic reverse nea- rest neighbors. In Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on, pp. 806–815. IEEE.
[Korn e Muthukrishnan 2000] Korn, F. e Muthukrishnan, S. (2000). Influence sets based on reverse nearest neighbor queries. In ACM Sigmod Record, volume 29, pp. 201–212. ACM.
[Li et al. 2011] Li, Z., Lee, K. C., Zheng, B., Lee, W.-C., Lee, D., e Wang, X. (2011).
Ir-tree: An efficient index for geographic document search. IEEE Transactions on Knowledge and Data Engineering, 23(4):585–599.
[Liu et al. 2013] Liu, Y., Wong, R. C.-W., Wang, K., Li, Z., Chen, C., e Chen, Z.
(2013). A new approach for maximizing bichromatic reverse nearest neighbor search. Knowledge and information systems, 36(1):23–58.
[Lu et al. 2011] Lu, J., Lu, Y., e Cong, G. (2011). Reverse spatial and textual k nearest neighbor search. InProceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 349–360. ACM.
[Lu et al. 2014] Lu, Y., Lu, J., Cong, G., Wu, W., e Shahabi, C. (2014). Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search.
ACM Transactions on Database Systems (TODS), 39(2):13.
[Manning et al. 2008] Manning, C. D., Raghavan, P., Sch¨utze, H., et al. (2008). In- troduction to information retrieval, volume 1. Cambridge university press Cam- bridge.
[Papadias et al. 2001] Papadias, D., Kalnis, P., Zhang, J., e Tao, Y. (2001). Efficient olap operations in spatial data warehouses. Advances in spatial and temporal databases, pp. 443–459.
[Prodanov e de Freitas 2013] Prodanov, C. C. e de Freitas, E. C. (2013). Meto- dologia do Trabalho Cient´ıfico: M´etodos e T´ecnicas da Pesquisa e do Trabalho Acadˆemico-2a Edi¸c˜ao. Editora Feevale.
[Qi et al. 2014] Qi, J., Zhang, R., Wang, Y., Xue, A. Y., Yu, G., e Kulik, L. (2014).
The min-dist location selection and facility replacement queries. World Wide Web, 17(6):1261–1293.
[Rigaux et al. 2001] Rigaux, P., Scholl, M., e Voisard, A. (2001). Spatial databases:
with application to GIS. Morgan Kaufmann.
[Rocha-Junior 2012] Rocha-Junior, J. B. (2012). Efficient Processing of Prefe- rence Queries in Distributed and Spatial Databases. PhD thesis, Norges teknisk- naturvitenskapelige universitet, Fakultet for informasjonsteknologi, matematikk og elektroteknikk, Institutt for datateknikk og informasjonsvitenskap.
[Rocha-Junior et al. 2011] Rocha-Junior, J. B., Gkorgkas, O., Jonassen, S., e Nørv˚ag, K. (2011). Efficient processing of top-k spatial keyword queries. In SSTD, volume 6849, pp. 205–222. Springer.
[Salminen e Tompa 1994] Salminen, A. e Tompa, F. W. (1994). Pat expressions: an algebra for text search. Acta Linguistica Hungarica, 41(1):277–306.
[Stanoi et al. 2001] Stanoi, I., Riedewald, M., e Agrawal, D. (2001). Discovery of influence sets in frequently updated databases. In VLDB, volume 2001, pp. 99–
108.
[Vaid et al. 2005] Vaid, S., Jones, C. B., Joho, H., e Sanderson, M. (2005). Spatio- textual indexing for geographical search on the web. InInternational Symposium on Spatial and Temporal Databases, pp. 218–235. Springer.
[Wong et al. 2011] Wong, R. C.-W., ¨Ozsu, M. T., Fu, A. W.-C., Yu, P. S., Liu, L., e Liu, Y. (2011). Maximizing bichromatic reverse nearest neighbor for lp-norm in two-and three-dimensional spaces. The VLDB Journal-The International Journal on Very Large Data Bases, 20(6):893–919.
[Wong et al. 2009] Wong, R. C.-W., ¨Ozsu, M. T., Yu, P. S., Fu, A. W.-C., e Liu, L. (2009). Efficient method for maximizing bichromatic reverse nearest neighbor.
Proceedings of the VLDB Endowment, 2(1):1126–1137.
[Wu et al. 2012] Wu, D., Yiu, M. L., Cong, G., e Jensen, C. S. (2012). Joint top-k spatial keyword query processing. IEEE Transactions on Knowledge and Data Engineering, 24(10):1889–1903.