Abstract
We consider the recently introduced monochromatic reverse top−k query which asks for, given a (possibly new) tuple q and a dataset \(\mathcal{D}\), all possible top−k queries on \(\mathcal{D}\cup\{q\}\) for which q is in the result. Towards this problem, we introduce the first query-agnostic approach, which leads to an efficient index. We present the novel insight that by representing the dataset as an arrangement of lines, a critical k-polygon can be identified and can singularly answer reverse top−k queries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer TELOS, Santa Clara (2008)
Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Indexing for vector projections. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part II. LNCS, vol. 6588, pp. 367–376. Springer, Heidelberg (2011)
Das, G., Gunopulos, D., Koudas, N., Sarkas, N.: Ad-hoc top-k query answering for data streams. In: Proc. VLDB, pp. 183–194. ACM, New York (2007)
Hugg, J., Rafalin, E., Seyboth, K., Souvaine, D.: An experimental study of old and new depth measures. In: Proc. ALENEX, pp. 51–64. Springer (2006)
Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys 40 (October 2008)
Meliou, A., Gatterbauer, W., Suciu, D.: Reverse data management. In: Proc. VLDB, vol. 4(12) (August 2011)
Ranu, S., Singh, A.K.: Answering top-k queries over a mixture of attractive and repulsive dimensions. In: Proc. VLDB, vol. 5(3) (2011)
Rousseeuw, P.J., Hubert, M.: Depth in an arrangement of hyperplanes. Discrete & Computational Geometry 22(1), 167–176 (1999)
Sharir, M.: Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 109–121. Springer, Heidelberg (1995)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Norvag, K.: Reverse top-k queries. In: Proc. ICDE, pp. 365–376. IEEE (March 2010)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Norvag, K.: Monochromatic and bichromatic reverse top-k queries. TKDE 23, 1215–1229 (2011)
Wang, B., Dai, Z., Li, C., Chen, H.: Efficient computation of monochromatic reverse top-k queries. In: Proc. FSKD, vol. 4, pp. 1788–1792. IEEE (August 2010)
Zuo, Y., Serfling, R.: Structural properties and convergence results for contours of sample statistical depth functions. Annals of Statistics 28, 483–499 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chester, S., Thomo, A., Venkatesh, S., Whitesides, S. (2013). Indexing Reverse Top-k Queries in Two Dimensions. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds) Database Systems for Advanced Applications. DASFAA 2013. Lecture Notes in Computer Science, vol 7825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37487-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-37487-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37486-9
Online ISBN: 978-3-642-37487-6
eBook Packages: Computer ScienceComputer Science (R0)