Abstract
In location-based services, every query object usually has multiple attributes including its location in road networks. However, when making a decision to choose an object, there is probably no such an object that is best in every attribute. To have a balance among all the attributes, a monotone aggregation function can be used, in which every attribute is an independent variable of the function. To find k objects which have the minimal (maximal) values of the function is a typical combining top-k problem. In this paper, we address this problem in road network environment. To answer such a query more efficiently, we propose a novel algorithm called ATC (Access with Topology Changed). By making use of road networks’ locality, the algorithm changes the networks’ topology and reduces the number of data access. Extensive experiments show that our algorithm can obviously outperform existing algorithms that solve the combining top-k problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fagin, R.: Combining Fuzzy Information: an Overview. ACM SIGMOD Record 31(2), 109–118 (2002)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. ACM SIGMOD Record (1995)
Cheung, K.L., Fu, A.W.: Enhanced Nearest Neighbour Search on the R-tree. ACM SIGMOD Record 27(3), 16–21 (1998)
Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. TODS 24(2), 265–318 (1999)
Yoo, J.S., Shekhar, S.: In-route nearest neighbor queries. Geoinformatica (2005)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. IEEE Conf. on Data Engineering, Heidelberg, Germany (2001)
Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB 2006: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 751–762. VLDB Endowment (2006)
Son, W., Lee, M.W., Ahn, H.K., Hwang, S.W.: Spatial Skyline Queries: An Efficient Geometric Algorithm. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 247–264. Springer, Heidelberg (2009)
Zheng, B., Lee, K.C.K., Lee, W.C.: Location-Dependent Skyline Query. In: Proc. of MDM, pp. 148–155 (2008)
Yiu, M.L., Dai, X., Mamoulis, N., Vaitis, M.: Top-k spatial preference queries. In: ICDE (2007)
Rocha-Junior, J.B., Vlachou, A., Doulkeridis, C., Norvag, K.: Efficient processing of top-k spatial preference queries. In: VLDB (2010)
Jung, H., Cho, B., Chung, Y.D., Liu, L.: On processing location based top-k queries in the wireless broadcasting system. In: ACMSAC (2010)
Guttman, A.: R-trees: a Dynamic Index Structure for Spatial Searching. ACM SIGMOD Record, 47–57 (1984)
Real Datasets for Spatial Databases: Road Networks and Points of Interest – California Road Network and North America Road Network, http://www.cs.fsu.edu/~lifeifei/SpatialDataset.htm
Hadjieleftheriou, M., Hoel, E., Tsotras, V.J.: Sail: A spatial index library for efficient application integration. Geoinformatica 9(4) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, W., Jing, Y., Chen, K., Sun, W. (2012). Combining Top-k Query in Road Networks. In: Wang, L., Jiang, J., Lu, J., Hong, L., Liu, B. (eds) Web-Age Information Management. WAIM 2011. Lecture Notes in Computer Science, vol 7142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28635-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-28635-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28634-6
Online ISBN: 978-3-642-28635-3
eBook Packages: Computer ScienceComputer Science (R0)