TJJE: An efficient algorithm for top-k join on massive data-Reference-Cited by-同舟云学术

TJJE: An efficient algorithm for top-k join on massive data

Published:2013-02 Issue: Volume:222 Page:362-383
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Han Xixian,Li Jianzhong,Wang Jinbao,Yang Donghua

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference38 articles.

1. P. Agrawal, J. Widom, Confidence-aware join algorithms, in: ICDE, 2009, pp. 628–639.

2. R. Akbarinia, E. Pacitti, P. Valduriez, Best position algorithms for top-k queries, in: VLDB, 2007, pp. 495–506.

3. H. Bast, D. Majumdar, R. Schenkel, M. Theobald, G. Weikum, Io-top-k: Index-access optimized top-k query processing, in: VLDB, 2006, pp. 475–486.

4. P.A. Boncz, S. Manegold, M.L. Kersten, Database architecture optimized for the new bottleneck: Memory access, in: VLDB, 1999, pp. 54–65.

5. S. Börzsönyi, D. Kossmann, K. Stocker, The skyline operator, in: ICDE, 2001, pp. 421–430.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integrating Real-Time Entity Resolution with Top-N Join Query Processing;Knowledge Science, Engineering and Management;2021

2. Evaluating Top-N queries in n-dimensional normed spaces;Information Sciences;2016-12

3. Evaluating a Stream of Relational KNNQueries by a Knowledge Base;International Journal of Cooperative Information Systems;2015-06

4. Efficiently processing -approximate join aggregation on massive data;Information Sciences;2014-09