-
2
-
-
85011117106
-
Anytime measures for top-k algorithms
-
B. Arai, G. Das, D. Gunopulos, and N. Koudas. Anytime measures for top-k algorithms. In Proceedings of the 33rd International Conference on Very Large Data Bases, pages 914-925, 2007.
-
(2007)
Proceedings of the 33rd International Conference on Very Large Data Bases
, pp. 914-925
-
-
Arai, B.1
Das, G.2
Gunopulos, D.3
Koudas, N.4
-
5
-
-
70849105269
-
Robust and efficient algorithms for rank join evaluation
-
University of California Santa Cruz
-
J. Finger and N. Polyzotis. Robust and efficient algorithms for rank join evaluation. Technical Report UCSC-SOE-09-01, University of California Santa Cruz, 2009.
-
(2009)
Technical Report UCSC-SOE-09-01
-
-
Finger, J.1
Polyzotis, N.2
-
6
-
-
0027608375
-
Query evaluation techniques for large databases
-
G. Graefe. Query evaluation techniques for large databases. ACM Comput. Surv., 25(2):73-169, 1993.
-
(1993)
ACM Comput. Surv.
, vol.25
, Issue.2
, pp. 73-169
-
-
Graefe, G.1
-
7
-
-
85011072071
-
Efficiently answering top-k typicality queries on large databases
-
M. Hua, J. Pei, A. W.-C. Fu, X. Lin, and H.-F. Leung. Efficiently answering top-k typicality queries on large databases. In Proceedings of the 33rd International Conference on Very Large Data Bases, pages 890-901, 2007.
-
(2007)
Proceedings of the 33rd International Conference on Very Large Data Bases
, pp. 890-901
-
-
Hua, M.1
Pei, J.2
Fu, A.W.-C.3
Lin, X.4
Leung, H.-F.5
-
8
-
-
6344287791
-
Supporting top-k join queries in relational databases
-
I. Ilyas, W. Aref, and K. Elmagarmid. Supporting top-k join queries in relational databases. International Journal on Very Large Databases, 13(3):207-221, 2004.
-
(2004)
International Journal on Very Large Databases
, vol.13
, Issue.3
, pp. 207-221
-
-
Ilyas, I.1
Aref, W.2
Elmagarmid, K.3
-
10
-
-
29844457931
-
RankSQL: Query algebra and optimization for relational top-k queries
-
C. Li, K. C.-C. Chang, I. Ilyas, and S. Song. RankSQL: query algebra and optimization for relational top-k queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 131-142, 2005.
-
(2005)
Proceedings of the ACM SIGMOD International Conference on Management of Data
, pp. 131-142
-
-
Li, C.1
Chang, K.C.-C.2
Ilyas, I.3
Song, S.4
-
11
-
-
34548407283
-
Efficient top-k aggregation of ranked inputs
-
N. Mamoulis, M. L. Yiu, K. H. Cheng, and D. W. Cheung. Efficient top-k aggregation of ranked inputs. ACM Transactions on Database Systems, 32(3):19, 2007.
-
(2007)
ACM Transactions on Database Systems
, vol.32
, Issue.3
, pp. 19
-
-
Mamoulis, N.1
Yiu, M.L.2
Cheng, K.H.3
Cheung, D.W.4
-
12
-
-
28444479935
-
Supporting incremental join queries on ranked inputs
-
A. Natsev, Y.-C. Chang, J. R. Smith, C.-S. Li, and J. S. Vitter. Supporting incremental join queries on ranked inputs. In Proceedings of 27th International Conference on Very Large Data Bases, pages 281-290, 2001.
-
(2001)
Proceedings of 27th International Conference on Very Large Data Bases
, pp. 281-290
-
-
Natsev, A.1
Chang, Y.-C.2
Smith, J.R.3
Li, C.-S.4
Vitter, J.S.5
-
14
-
-
85011048571
-
Depth estimation for ranking query optimization
-
K. Schnaitter, J. Spiegel, and N. Polyzotis. Depth estimation for ranking query optimization. In Proceedings of the 33rd International Conference on Very Large Databases, pages 902-913, 2007.
-
(2007)
In
, pp. 902-913
-
-
Schnaitter, K.1
Spiegel, J.2
Polyzotis, N.3
-
15
-
-
51149112283
-
Probabilistic top-k and ranking-aggregate queries
-
M.A. Soliman, I.F. Ilyas, and K.C.-C. Chang. Probabilistic top-k and ranking-aggregate queries. ACM Trans. Database Syst., 33(3):1-54, 2008.
-
(2008)
ACM Trans. Database Syst.
, vol.33
, Issue.3
, pp. 1-54
-
-
Soliman, M.A.1
Ilyas, I.F.2
Chang, K.-C.3
|