Efficient top-k queries for orthogonal ranges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6552 LNCS, Issue , 2011, Pages 110-121

  Rahul, Saladi ^a   Gupta, Prosenjit ^b   Janardan, Ravi ^c   Rajan, K S ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

^b Yahoo Research and Development   (India)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY ORDER; DATA GATHERING; DATA ITEMS; INFORMATION OVERLOADS; INSERTIONS AND DELETIONS; K POINTS; OUTPUT-SENSITIVE SOLUTIONS; SIGNIFICANT POINTS; SPATIAL DATASETS; TOP-K QUERY;

ALGORITHMS;

EID: 79952295757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19094-0_13     Document Type: Conference Paper

References (21)

1. Agarwal, P.K., Arge, L., Yang, J., Yi, K.: I/O-efficient structures for orthogonal range-max and stabbing-max queries. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 7-18. Springer, Heidelberg (2003)
2. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 23, pp. 1-56. American Mathematical Society Press, Providence (1999)
3. Agarwal, S., Chaudhuri, S., Das, G., Gionis, A.: Automated ranking of database query results. In: First Biennial Conference on Innovative Data Systems Research (2003)
4. Brodal, G.S., Fagerberg, R., Greve, M., López-Ortiz, A.: Online sorted range reporting. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 173-182. Springer, Heidelberg (2009)
5. Buckley, C., Salton, G., Allan, J.: The effect of adding relevance information in a relevance feedback environment. In: 17th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, pp. 292-300 (1994)
6. Chaudhuri, S., Gravano, L., Marian, A.: Optimizing top-k selection queries over multimedia repositories. IEEE Transactions on Knowledge and Data Engineering 16(8), 992-1009 (2004)
7. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM Journal of Computing 17(3), 427-462 (1988)
8. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2000)
9. Culpepper, J.S., Navarro, G., Puglisi, S.J., Turpin, A.: Top-k Ranked Document Search in General Text Databases. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6347, pp. 194-205. Springer, Heidelberg (2010)
10. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38, 86-124 (1989)
11. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and Related Techniques for Geometry Problems. In: 16th Annual ACM Symposium on Theory of Computing, pp. 135-143 (1984)
12. Gagie, T., Navarro, G., Puglisi, S.J.: Colored Range Reporting and Document Retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 67-81. Springer, Heidelberg (2010)
13. Gagie, T., Puglisi, S.J., Turpin, A.: Range quantile queries: another virtue of wavelet trees. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 1-6. Springer, Heidelberg (2009)
14. Gupta, P., Janardan, R., Smid, M.: A technique for adding range restrictions to generalized searching problems. Information Processing Letters 64, 263-269 (1997)
15. Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys 40(4) (2008)
16. Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramakrishnan, R.: On the integration of structure indexes and inverted lists. In: International Conference on Management of Data (SIGMOD 2004), pp. 779-790 (2004)
17. Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Transactions On Database Systems 29(2), 319-362 (2004)
18. Mehlhorn, K., Naher, S.: Dynamic Fractional Cascading. Algorthmica 5, 215-241 (1990)
19. Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. SIAM Journal of Computing (2), 33-43 (1973)
20. Tao, Y., Papadias, D.: Range aggregate processing in spatial databases. IEEE Transactions on Knowledge and Data Engineering 16(12), 1555-1570 (2004)
21. Willard, D.E., Lueker, G.S.: Adding range restriction capability to dynamic data structures. Journal of the ACM (32), 597-617 (1982)