Progressive and selective merge: Computing top-k with ad-hoc ranking functions

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 103-114

  Xin, Dong ^a   Han, Jiawei ^a   Chang, Kevin C ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Progressive merge; Selective merge; Top k query

Indexed keywords

DATA LISTS; PROGRESSIVE MERGING; SELECTIVE MERGING; THRESHOLD ALGORITHM (TA);

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; DATA STRUCTURES; DECISION TREES; MATHEMATICAL MODELS; MERGING;

QUERY PROCESSING;

EID: 35448935270     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247494     Document Type: Conference Paper

References (23)

1. H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum. Io-top-k: Index-access optimized top-k query processing. In VLDB, pages 475-486, 2006.
2. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In SIGMOD Conference, pages 359-370, 1999.
3. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
4. C. Bohm and H.-P. Kriegel. Determining the convex hull in large multidimensional databases. In DaWaK, pages 294-306. Springer-Verlag, 2001.
5. S. Borzsonyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421-430, 2001.
6. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using r-trees. In SIGMOD Conference, pages 237-246, 1993.
7. N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, 2002.
8. K. Chakrabarti, V. Ganti, J. Han, and D. Xin. Ranking objects by exploiting relationships: computing top-k over aggregation. In SIGMOD Conference, pages 371-382, 2006.
9. S. Churdhuri and U. Dayal. An overview of data warehousing and data cube. SIGMOD Record, 26:65-74, 1997.
10. R. Fagin. Fuzzy queries in multimedia database systems. In PODS, pages 1-10, 1998.
11. R. Fagin. Combining fuzzy information: an overview. SIGMOD Record, 31(2):109-118, 2002.
12. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
13. A. Fraenkel and S. Klein. Novel compression of sparse bit-strings - preliminary report. Combinatorial Algorithms on Words, NATO ASI Series, 12:169-183, 1985.
14. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2002.
15. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In SIGMOD Conference, pages 237-248, 1998.
16. S. Michel, P. Triantafillou, and G. Weikum. Klee: a framework for distributed top-k query algorithms. In VLDB, pages 637-648, 2005.
17. K. Morfonios and Y. Ioannidis. Cure for cubes: cubing using a rolap engine. In VLDB, pages 379-390, 2006.
18. D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. ACM Trans. Database Syst., 30(1):41-82, 2005.
19. H. Shin, B. Moon, and S. Lee. Adaptive and incremental processing for distance join queries. IEEE Trans. Knowl. Data Eng., 15(6):1561-1578, 2003.
20. P. Valduriez. Join indices. ACM Trans. Database Systems, 12:218-246, 1987.
21. D. Xin, J. Han, H. Cheng, and X. Li. Answering top-k queries with multi-dimensional selections: The ranking cube approach. In VLDB, pages 463-475, 2006.
22. Z. Zhang, S. won Hwang, K. C.-C. Chang, M. Wang, C. A. Lang, and Y.-C. Chang. Boolean + ranking: querying a database by k-constrained optimization. In SIGMOD Conference, pages 359-370, 2006.
23. M. Zhu, D. Papadias, J. Zhang, and D. L. Lee. Top-k spatial joins. IEEE Trans. Knowl. Data Eng., 17(4):567-579, 2005.