Rank join queries in NoSQL databases

Article English OPEN
Ntarmos, N.; Patlakas, I.; Triantafillou, P.;
(2014)
  • Publisher: VLDB Endowment Inc.

Rank (i.e., top-k) join queries play a key role in modern analytics\ud tasks. However, despite their importance and unlike\ud centralized settings, they have been completely overlooked\ud in cloud NoSQL settings. We attempt to fill this gap: We\ud contribute a suite of ... View more
  • References (29)
    29 references, page 1 of 3

    [1] A. Abouzeid, et al. HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads. PVLDB, 2(1):922{933, 2009.

    [2] F. N. Afrati and J. D. Ullman. Optimizing joins in a map-reduce environment. In Proc. EDBT, 2010.

    [3] B. H. Bloom. Space/time trade-o s in hash coding with allowable errors. Commun. ACM, 13(7):422{426.

    [4] C. Bohm and H.-P. Kriegel. A cost model and index architecture for the similarity join. In Proc. ICDE, 2001.

    [5] P. Cao and Z. Wang. E cient top-k query calculation in distributed networks. In Proc. ACM PODC, 2004.

    [6] S. Cohen and Y. Matias. Spectral Bloom lters. In Proc. ACM SIGMOD, 2003.

    [7] J. Dittrich, et al. Hadoop++: Making a yellow elephant run like a cheetah (without it even noticing). PVLDB, 3(1-2):515{529, 2010.

    [8] C. Doulkeridis, et al. Processing of rank joins in highly distributed systems. In IEEE ICDE, 2012.

    [9] DynamoDB pricing scheme: http://aws.amazon.com/dynamodb/#pricing.

    [10] R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proc. ACM PODS, 2001.

  • Metrics
Share - Bookmark