Processing a large number of continuous preference top-k queries

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2012, Pages 397-408

  Yu, Albert ^a   Agarwal, Pankaj K ^a   Yang, Jun ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

continuous top k queries; linear preference; reverse top k queries

Indexed keywords

ATTRIBUTE VALUES; DYNAMIC INDICES; LINEAR COMBINATIONS; LINEAR PREFERENCE; QUERY RESULTS; SCALABLE SOLUTION; TOP-K QUERY;

DATABASE SYSTEMS;

INFORMATION RETRIEVAL;

EID: 84862656298     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213836.2213882     Document Type: Conference Paper

References (30)

1. P. Afshani and T. M. Chan. Optimal halfspace range reporting in three dimensions. In SODA '09, pages 180-186, 2009.
2. P. K. Agarwal, L. Arge, J. Erickson, P. G. Franciosa, and J. S. Vitter. Efficient searching with linear constraints. J. Comput. Syst. Sci., 61(2):194-216, 2000.
3. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. Journal of the ACM, 51:606-635, 2004.
4. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via coresets. In J. E. Goodman, J. Pach, and E.Welzl, editors, Combinatorial and Computational Geometry, pages 1-30. Cambridge University Press, New York, 2005.
5. P. K. Agarwal, S. Har-Peled, and H. Yu. Robust shape fitting via peeling and grating coresets. In SODA '06, pages 182-191, 2006.
6. P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Algorithmica, pages 325-345, 1995.
7. P. K. Agarwal, J. M. Phillips, and H. Yu. Stability of epsilon-kernels. In ESA'10, pages 487-499, 2010. Springer-Verlag.
8. P. K. Agarwal and M. Sharir. Arrangements and their applications. In Handbook of Computational Geometry, pages 49-119. Elsevier Science Publishers B.V. North-Holland, 1998.
9. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6):891-923, 1998.
10. G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. In SODA '99, pages 82-91, Philadelphia, PA, USA, 1999.
11. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE'01, pages 421-430, Washington, DC, USA, 2001.
12. H. Brönnimann, B. Chazelle, and J. Pach. How hard is half-space range searching. Discrete & Comput. Geom., 10:143-155, 1993.
13. T. M. Chan. Three problems about dynamic convex hulls. In SoCG'11, pages 27-36, New York, NY, USA, 2011.
14. B. Chandramouli, J. Xie, and J. Yang. On the database/network interface in large-scale publish/subscribe systems. In SIGMOD'06, pages 587-598, Chicago, Illinois, USA, June 2006.
15. Y.-C. Chang, L. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith. The onion technique: indexing for linear optimization queries. SIGMOD Rec., 29:391-402, May 2000.
16. B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. BIT, 25:76-90, June 1985.
17. G. Das, D. Gunopulos, N. Koudas, and N. Sarkas. Ad-hoc top-k query answering for data streams. In VLDB'07, pages 183-194, 2007.
18. G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In VLDB '06, pages 451-462. 2006.
19. V. Hristidis, N. Koudas, and Y. Papakonstantinou. Prefer: a system for the efficient execution of multi-parametric ranked queries. SIGMOD Rec., 30:259-270, May 2001.
20. I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys, 40(4), 2008.
21. M. Jacob and Z. G. Ives. Sharing work in keyword search over databases. In SIGMOD '11 , pages 577-588, 2011.
22. J. Matousek. Reporting points in halfspaces. Comput. Geom., 2:169-186, 1992.
23. J. Matousek. Lectures on Discrete Geometry. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2002.
24. K. Mouratidis, S. Bakiras, and D. Papadias. Continuous monitoring of top-k queries over sliding windows. In SIGMOD '06, pages 635-646, New York, NY, USA, 2006.
25. D. Papadias and Y. Tao. Reverse nearest neighbor query. In L. Liu and M. T. Özsu, editors, Encyclopedia of Database Systems, pages 2434-2438. Springer, 2009.
26. M. A. Soliman, I. F. Ilyas, D. Martinenghi, and M. Tagliasacchi. Ranking with uncertain scoring functions: semantics and sensitivity measures. In SIGMOD '11, pages 805-816, 2011.
27. P. Tsaparas, N. Koudas, Y. Kotidis, T. Palpanas, and D. Srivastava. Ranked join indices. In ICDE '03, pages 277-288, 2003.
28. A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Nørvåg. Reverse top-k queries. In ICDE '10, pages 365-376, 2010.
29. A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Nørvåg. Monochromatic and bichromatic reverse top-k queries. IEEE Trans. Knowl. Data Eng., 23(8):1215-1229, 2011.
30. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. Practical methods for shape fitting and kinetic data structures using core sets. In SCG '04, pages 263-272, 2004.