Int J Performability Eng ›› 2018, Vol. 14 ›› Issue (11): 2842-2851.doi: 10.23940/ijpe.18.11.p30.28422851
Previous Articles Next Articles
Lianyin Jiaa, Binglin Shena, Mengjuan Lib, Jing Zhanga, and Jiaman Dinga, *
Submitted on
;
Contact:
* E-mail address: tjom2008@163.com
About author:Lianyin Jia is an associate professor in the Faculty of Information Engineering and Automation at Kunming University of Science and Technology, Kunming, China. He received his Ph.D. in computer science from South China University of Technology, Guangzhou, China in 2013. His current research interests include databases, data mining, information retrieval, and parallel computing.Binglin Shen is an MPhil student in the Faculty of Information Engineering and Automation at Kunming University of Science and Technology, Kunming, China. Her current research interests include databases, information retrieval, and parallel computing.Mengjuan Li is a librarian in the Department of Technology at Yunnan Normal University, Kunming, China. She received her Master's degree in computer science from Kunming University of Science and Technology, Kunming, China in 2008. Her main research interests include information retrieval and parallel computing. Jing Zhang is a professor in the Faculty of Information Engineering and Automation at Kunming University of Science and Technology, Kunming, China. He received his Ph.D. from Kunming University of Science and Technology, Kunming, China in 2009. His current research interests include software engineering and management information systems.Jiaman Ding is an associate professor in the Faculty of Information Engineering and Automation at Kunming University of Science and Technology, Kunming, China. He is currently a Ph.D. candidate at Kunming University of Science and Technology. His current research interests include data mining and cloud computing.
Lianyin Jia, Binglin Shen, Mengjuan Li, Jing Zhang, and Jiaman Ding. Spatio-Textual Query: Review and Opportunities [J]. Int J Performability Eng, 2018, 14(11): 2842-2851.
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
| [1] L. Chen, G. Cong, C. S. Jensen,D. Wu, “Spatial Keyword Query Processing: An Experimental Evaluation,” [2] C. Gao and C. S. Jensen, “Querying Geo-Textual Data: Spatial Keyword Queries and Beyond,” in [3] X. P. Liu, C. X. Wan, D. X. Liu,G. Q. Liao, “Survey on Spatial Keyword Search,” [4] J. Nievergelt, H. Hinterberger,K. C. Sevcik, “The Grid File: An Adaptable, Symmetric Multi-Key File Structure,” [5] R. A.Finkel and J. L. Bentley, “Quad Trees a Data Structure for Retrieval on Composite Keys,” [6] J. L. Bentley, “Multidimensional Binary Search Trees Used for Associative Searching,” [7] N. Beckmann, H. P. Kriegel, R. Schneider,B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” in [8] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” in [9] T. K. Sellis, N. Roussopoulos,C. Faloutsos, “The R+-Tree: A Dynamic Index for Multi-Dimensional Objects,” in [10] R. Bayer, “The Universal B-Tree for Multidimensional Indexing: General Concepts,” in [11] P. Nagarkar, K. S. Candan,A. Bhat, “Compressed Spatial Hierarchical Bitmap (Cshb) Indexes for Efficiently Processing Spatial Range Query Workloads,” [12] P. Bozanis and P. Foteinos, “Wer-Trees,” [13] S. Brakatsoulas, D. Pfoser,Y. Theodoridis, “Revisiting R-Tree Construction Principles,” [14] I. Kamel and C. Faloutsos, “Hilbert R-Tree: An Improved R-Tree Using Fractals,” in [15] S. T. Leutenegger, J. M. Edgington,M. A. Lopez, “Str: A Simple and Efficient Algorithm for R-Tree Packing,” in [16] T. Skopal, M. Krátký, J. Pokorný,V. Snášel, “A New Range Query Algorithm for Universal B-Trees ☆,” [17] R. Ganti, M. Srivatsa, D. Agrawal, P. Zerfos,J. Ortiz, “Mp-Trie: Fast Spatial Queries on Moving Objects,” in [18] Y. Ishikawa, H. Kitagawa,N. Ohbo, “Evaluation of Signature Files as Set Access Facilities in Oodbs,” in [19] H. Kitagawa and K. Fukushima, “Composite Bit-Sliced Signature File: An Efficient Access Method for Set-Valued Object Retrieval,”CODAS, 1996 [20] J. M.Hellerstein and A. Pfeffer, “The Rd-Tree: An Index Structure for Sets,” University of Wisconsin, Madison, 1994 [21] B. Ding, “Fast Set Intersection in Memory,” [22] O. Kaser and D. Lemire, “Compressed Bitmap Indexes: Beyond Unions and Intersections,” [23] S. Helmer and G. Moerkotte, “A Performance Study of Four Index Structures for Set-Valued Attributes of Low Cardinality,” [24] E. D.Demaine and J. I. Munro, “Experiments on Adaptive Set Intersections for Text Retrieval Systems,” in [25] C. D.Manning and P. Raghavan, “Introduction to Information Retrieval,” Cambridge University Press, 2010 [26] J. Wang, C. Lin, R. He, M. Chae, Y. Papakonstantinou,S. Swanson, “Milc: Inverted List Compression in Memory,” [27] M. Yu, G. Li, D. Deng,J. Feng, “String Similarity Search and Join: A Survey,” [28] Y. Kim and K. Shim, “Efficient Top-K Algorithms for Approximate Substring Matching,” in [29] M. Hadjieleftheriou and D. Srivastava, “Weighted Set-based String Similarity,” [30] A. Arasu, V. Ganti,R. Kaushik, “Efficient Exact Set-Similarity Joins,” in [31] S. Chaudhuri, V. Ganti,R. Kaushik, “A Primitive Operator for Similarity Joins in Data Cleaning,” inProceedings of the 22nd International Conference on Data Engineering, 2006 [32] S. Sarawagi and A. Kirpal, “Efficient Set Joins on Similarity Predicates,” in [33] C. Xiao, W. Wang, X. Lin, J. X. Yu,G. Wang, “Efficient Similarity Joins for near-Duplicate Detection,” [34] J. Wang, G. Li,J. Feng, “Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search,” in [35] C. Li, J. Lu,Y. Lu, “Efficient Merging and Filtering Algorithms for Approximate String Searches,” inProceedings of the 2008 IEEE 24th International Conference on Data Engineering, 2008 [36] D. Fenz, D. Lange, F. Naumann,U. Leser, “Efficient Similarity Search in Very Large String Sets,” in [37] J. Feng, J. Wang,G. Li, “Trie-Join: A Trie-based Method for Efficient String Similarity Joins,” [38] Z. Zhang, M. Hadjieleftheriou, B. C. Ooi,D. Srivastava, “Bed-Tree: An All-Purpose Index Structure for String Similarity Search based on Edit Distance,” in [39] L. Jia, L. Zhang, G. Yu, J. You, J. Ding,M. Li, “A Survey on Set Similarity Search and Join,” [40] I. D. Felipe, V. Hristidis,N. Rishe, “Keyword Search on Spatial Databases,” in [41] R. Hariharan, B. Hore, C. Li,S. Mehrotra, “Processing Spatial-Keyword (Sk) Queries in Geographic Information Retrieval (Gir) Systems,” in [42] D. Zhang, Y. M. Chee, A. Mondal, A. K. H.Tung, and M. Kitsuregawa, “Keyword Search in Spatial Databases: Towards Searching by Document,” in [43] Z. Li, K. C. K.Lee, B. Zheng, W. C. Lee, D. Lee, and X. Wang, “Ir-Tree: An Efficient Index for Geographic Document Search,” [44] S. Vaid, C. B. Jones, H. Joho,M. Sanderson, “Spatio-Textual Indexing for Geographical Search on the Web,” Springer Berlin Heidelberg, 2005 [45] A. Skovsgaard and C. S. Jensen, “Top-K Point of Interest Retrieval Using Standard Indexes,” [46] M. Christoforaki, J. He, C. Dimopoulos, A. Markowetz,T. Suel, “Text Vs. Space:Efficient Geo-Search Query Processing,” in [47] A. Khodaei, C. Shahabi,C. Li, “Hybrid Indexing and Seamless Ranking of Spatial and Textual Features of Web Documents,” in [48] A. Cary, O. Wolfson,N. Rishe, “Efficient and Scalable Method for Processing Top-K Spatial Boolean Queries,” in [49] Y. Zhou, X. Xie, C. Wang, Y. Gong,W. Y. Ma, “Hybrid Index Structures for Location-based Web Search,” in [50] D. Wu, L. Y. Man, G. Cong,C. S. Jensen, “Joint Top-K Spatial Keyword Query Processing,” [51] L. Chen, G. Cong,X. Cao, “An Efficient Query Indexing Mechanism for Filtering Geo-Textual Data,” in [52] G. Li, Y. Wang, T. Wang,J. Feng, “Location-Aware Publish/Subscribe,” in [53] M. Yu, G. Li,J. Feng, “A Cost-based Method for Location-Aware Publish/Subscribe Services,” in [54] X. Wang, Y. Zhang, W. Zhang, X. Lin,W. Wang, “Ap-Tree: Efficiently Support Continuous Spatial-Keyword Queries over Stream,” in [55] Z. Chen, G. Cong, Z. Zhang, T. Z. J.Fuz, and L. Chen, “Distributed Publish/Subscribe Query Processing on the Spatio-Textual Data Stream,” inProceedings of IEEE International Conference on Data Engineering, 2017 [56] G. Cong, C. S. Jensen,D. Wu, “Efficient Retrieval of the Top-K Most Relevant Spatial Web Objects,” [57] J. Fan, G. Li, L. Zhou, S. Chen,J. Hu, “Seal: Spatio-Textual Similarity Search,” in [58] J. B.Rocha-Junior, O. Gkorgkas, S. Jonassen, and K. Nørvåg, “Efficient Processing of Top-K Spatial Keyword Queries,” in [59] L. Chen, G. Cong, X. Cao,K. L. Tan, “Temporal Spatial-Keyword Top-K Publish/Subscribe,” in [60] H. Hu, Y. Liu, G. Li,J. Feng, “A Location-Aware Publish/Subscribe Framework for Parameterized Spatio-Textual Subscriptions,” in [61] M. Zhu, D. Shen, L. Liu,G. Yu, “Hybrid-Lsh for Spatio-Textual Similarity Queries,” in [62] J. Liu, K. Deng, H. Sun, Y. Ge, X. Zhou,C. S. Jensen, “Clue-based Spatio-Textual Query,” [63] S. Liu, G. Li,J. Feng, “Star-Join: Spatio-Textual Similarity Join,” pp. 2194-2198, 2012 [64] S. Liu, G. Li,J. Feng, “A Prefix-Filter based Method for Spatio-Textual Similarity Join,” [65] P. Bouros, G. Shen,N. Mamoulis, “Spatio-Textual Similarity Joins,” [66] J. Rao, J. Lin,H. Samet, “Partitioning Strategies for Spatio-Textual Similarity Join,” in |
| No related articles found! |
|
||
