Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education (Renmin University of China), Beijing 100872, China;School of Information, Renmin University, Beijing 100872, China 在期刊界中查找 在百度中查找 在本站中查找
Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education (Renmin University of China), Beijing 100872, China;School of Information, Renmin University, Beijing 100872, China 在期刊界中查找 在百度中查找 在本站中查找
Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education (Renmin University of China), Beijing 100872, China;School of Information, Renmin University, Beijing 100872, China 在期刊界中查找 在百度中查找 在本站中查找
Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education (Renmin University of China), Beijing 100872, China;School of Information, Renmin University, Beijing 100872, China 在期刊界中查找 在百度中查找 在本站中查找
Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education (Renmin University of China), Beijing 100872, China;School of Information, Renmin University, Beijing 100872, China 在期刊界中查找 在百度中查找 在本站中查找
Location-Based services guide a user to find the object which provides services located in a particular position or region (e.g., looking for a coffee shop near a university). Given a query location and multiple keywords, location-based services return the most relevant objects ranked according to location proximity and text relevancy. Various hybrid indexes have been proposed in recent years which combine R-tree and inverted index to improve query efficiency. Unfortunately, the state-of-the-art approaches require more space in order to reduce response time. Cache mechanism is inefficient due to huge storage overhead. In this paper, a novel index based on index compressed technology (CSTI) is proposed, to answer top-k SKQ. CSTI significantly reduces storage overhead (by at least 80%), while maintaining efficient query performance. Extensive experiments based on real dataset and simulated dataset confirm CSTI is effective and efficient.
[1] Chen YY, Suel T, Markowetz A. Efficient query processing in geographic Web search engines. In: Chaudhuri S, Hristidis V, Polyzotis N, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Chicago: ACM, 2006. 277-288.
[2] Hariharan R, Hore B, Li C, Mehrotra S. Processing spatial-keyword queries in geographic information retrieval systems. In: Proc. of the 19th Int'l Conf. on Scientific and Statistical Database Management (SSDBM 2007). Banff: IEEE Computer Society, 2007. 16.
[3] Zhou Y, Xie X, Wang C, Gong Y, Ma WY. Hybrid index structures for location-based Web search. In: Herzog O, Schek HJ, Fuhr N, Chowdhury A, Teiken W, eds. Proc. of the 2005 ACM CIKM Int'l Conf. on Information and Knowledge Management. Bremen: ACM, 2005. 155-162.
[4] Khodaei A, Shahabi A, Li C. Hybrid indexing and seamless ranking of spatial and textual features of Web documents. In: Bringas PG, Hameurlain A, Quirchmayr G, eds. Proc. of the 21st Int'l Conf. on Database and Expert Systems Applications. Bilbao: Springer-Verlag, 2010. 450-466.
[5] Li Z, Lee KCK, Zheng B, Lee WC, Lee DL, Wang X. Ir-Tree: An efficient index for geographic document search. IEEE Trans. on Knowledge and Data Engineering, 2011,23(4):585-599.
[6] Felipe ID, Hristidis V, Rishe N. Keyword search on spatial databases. In: Alonso GA, Blakeley JLP, Chen A, eds. Proc. of the 24th Int'l Conf. on Data Engineering (ICDE 2008). Cancún: IEEE, 2008. 656-665.
[7] Cong G, Jensen CS, Wu D. Efficient retrieval of the top-k most relevant spatial Web objects. PVLDB, 2009,2(1):337-348.
[8] Rocha-Junior JB, Gkorgkas O, Jonassen S, Nørvåg K. Efficient processing of top-k spatial keyword queries. In: Pfoser D, Tao YF, Mouratidis K, Nascimento MA, Mokbel MF, Shekhar SS, Huang Y, eds. Proc. of the 12th Int'l Symp. on Advances in Spatial and Temporal Databases (SSTD 2011). Minneapolis: Springer-Verlag, 2011. 205-222.
[9] Papadias D, Kalnis P, Zhang J, Tao Y. Efficient OLAP operations in spatial data warehouses. In: Jensen CS, Schneider M, Seeger B, Tsotras VJ, eds. Proc. of the 7th Int'l Symp. on Advances in Spatial and Temporal Databases (SSTD 2001). Redondo Beach: Springer-Verlag, 2001. 443-459.
[10] Chen L, Cong G, Jensen CS, Wu D. Spatial keyword query processing: An experimental evaluation. PVLDB, 2013,6(3):217-228.
[11] Lu JH, Lu Y, Cong G. Reverse spatial and textual k nearest neighbor search. In: Sellis TK, Miller RJ, Kementsietsidis A, Velegrakis Y, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data (SIGMOD 2011). Athens: ACM, 2011. 349-360.
[12] Li GL, Feng JH, Xu J. Desks: Direction-Aware spatial keyword search. In: Kementsietsidis A, Salles MAV, eds. Proc. of the IEEE 28th Int'l Conf. on Data Engineering (ICDE 2012). Washington: IEEE Computer Society, 2012. 474-485.
[13] Hu J, Fan J, Li GL, Chen SS. Top-k fuzzy spatial keyword search. Chinese Journal of Computers, 2012,35(11):2237-2246 (in Chinese with English abstract).
[14] Luo SQ, Luo YF, Zhou SG, Cong G, Guan JH: Distributed spatial keyword querying on road networks.In: Amer-Yahia S, Christophides V, Kementsietsidis A, Garofalakis MN, Idreos S, Leroy V, eds. Proc. of the 17th Int'l Conf. on Extending Database Technology (EDBT). Athens: OpenProceedings, 2014. 235-246.
[15] Zhang CY, Zhang Y, Zhang WJ, Lin XM, Cheema MA, Wang XY. Diversified spatial keyword search on road networks. In: Amer-Yahia S, Christophides V, Kementsietsidis A, Garofalakis MN, Idreos S, Leroy V, eds. Proc. of the 17th Int'l Conf. on Extending Database Technology (EDBT). Athens: OpenProceedings, 2014. 367-378.
[16] Yan H, Ding S, Suel T. Inverted index compression and query processing with optimized document ordering. In: Quemada J, León G, Maarek YS, Nejdl W, eds. Proc. of the 18th Int'l Conf. on World Wide Web (WWW 2009). Madrid: ACM, 2009. 401-410.
[17] Zhou X, Zhang X, Wang YH, Li R, Wang S. Efficient distributed multi-dimensional index for big data management. In: Wang JY, Xiong H, Ishikawa Y, Xu JL, Zhou JF, eds. Proc. of the 14th Int'l Conf. on Web-Age Information Management (WAIM 2013). Beidaihe: Springer-Verlag, 2013. 130-141.