ABSTRACT
Top-k query processing has recently received a significant amount of attention due to its wide application in information retrieval, multimedia search and recommendation generation. In this work, we consider the problem of how to efficiently answer a top-k query by using previously cached query results. While there has been some previous work on this problem, existing algorithms suffer from either limited scope or lack of scalability. In this paper, we propose two novel algorithms for handling this problem. The first algorithm LPTA+ provides significantly improved efficiency compared to the state-of-the-art LPTA algorithm [26] by reducing the number of expensive linear programming problems that need to be solved. The second algorithm we propose leverages a standard space partition-based index structure in order to avoid many of the drawbacks of LPTA-based algorithms, thereby further improving the efficiency of query processing. Through extensive experiments on various datasets, we demonstrate that our algorithms significantly outperform the state of the art.
- Auto123 consumer car ratings. http://www.auto123.com/en/car-reviews/consumer-ratings/.Google Scholar
- Flickr. http://www.flickr.com.Google Scholar
- IMDB. http://imdb.com.Google Scholar
- Memcached. http://memcached.org.Google Scholar
- Metacritics. http://www.metacritic.com.Google Scholar
- Metascore. http://www.metacritic.com/about-metascores.Google Scholar
- Nba basketball statistics. http://www.databasebasketball.com.Google Scholar
- Rottentomatoes. http://www.rottentomatoes.com.Google Scholar
- Twitter. http://twitter.com.Google Scholar
- U.s. news best cars. http://usnews.rankingsandreviews.com/cars-trucks/rankings/cars/.Google Scholar
- U.s. news best collage rankings. http://www.usnews.com/rankings.Google Scholar
- Wikipedia. http://www.wikipedia.org.Google Scholar
- World university rankings. http://www.timeshighereducation.co.uk/world-university-rankings/.Google Scholar
- Youtube. http://www.youtube.com.Google Scholar
- S. Abiteboul and O. M. Duschka. Complexity of answering queries using materialized views. In PODS, pages 254--263, 1998. Google ScholarDigital Library
- R. Akbarinia, E. Pacitti, and P. Valduriez. Best position algorithms for top-k queries. In VLDB, pages 495--506, 2007. Google ScholarDigital Library
- G. J. Badros, A. Borning, and P. J. Stuckey. The Cassowary linear arithmetic constraint solving algorithm. ACM Trans. Comput.-Hum. Interact., 8(4):267--306, 2001. Google ScholarDigital Library
- E. Baikousi and P. Vassiliadis. View usability and safety for the answering of top-k queries via materialized views. In DOLAP, pages 97--104, 2009. Google ScholarDigital Library
- C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33(3):322--373, 2001. Google ScholarDigital Library
- S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--430, 2001. Google ScholarDigital Library
- A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77--90, 1977. Google ScholarDigital Library
- Y.-C. Chang, L. D. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith. The onion technique: Indexing for linear optimization queries. In SIGMOD, pages 391--402, 2000. Google ScholarDigital Library
- H.-T. Chou and D. J. DeWitt. An evaluation of buffer management strategies for relational database systems. In VLDB, pages 127--141, 1985. Google ScholarDigital Library
- G. Dantzig. Linear Programming and Extensions. Princeton University, 1998.Google Scholar
- G. Das, D. Gunopulos, N. Koudas, and N. Sarkas. Ad-hoc top-k query answering for data streams. In VLDB, pages 183--194, 2007. Google ScholarDigital Library
- G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In VLDB, pages 451--462, 2006. Google ScholarDigital Library
- R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003. Google ScholarDigital Library
- A. Y. Halevy. Answering queries using views: A survey. VLDB J., 10(4):270--294, 2001. Google ScholarDigital Library
- J.-S. Heo, J. Cho, and K.-Y. Whang. The hybrid-layer index: A synergic approach to answering top-k queries in arbitrary subspaces. In ICDE, pages 445--448, 2010.Google ScholarCross Ref
- V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD, pages 259--270, 2001. Google ScholarDigital Library
- I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754--765, 2003. Google ScholarDigital Library
- I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008. Google ScholarDigital Library
- Y. E. Ioannidis. The history of histograms. In VLDB, pages 19--30, 2003. Google ScholarDigital Library
- T. Johnson and D. Shasha. 2Q: A low overhead high performance buffer management replacement algorithm. In VLDB, pages 439--450, 1994. Google ScholarDigital Library
- H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.Google ScholarCross Ref
- C. T. Kwok and D. S. Weld. Planning to gather information. In AAAI/IAAI, Vol. 1, pages 32--39, 1996. Google ScholarDigital Library
- J. Lee, H. Cho, and S. won Hwang. Efficient dual-resolution layer indexing for top-k queries. In ICDE, pages 1084--1095, 2012. Google ScholarDigital Library
- A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, pages 95--104, 1995. Google ScholarDigital Library
- C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song. RankSQL: Query algebra and optimization for relational top-k queries. In SIGMOD, pages 131--142, 2005. Google ScholarDigital Library
- S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Pearson Education, third edition, 2010. Google ScholarDigital Library
- N. H. Ryeng, A. Vlachou, C. Doulkeridis, and K. Nørvåg. Efficient distributed top-k query processing with caching. In DASFAA, pages 280--295, 2011. Google ScholarDigital Library
- D. Theodoratos and T. K. Sellis. Data warehouse configuration. In VLDB, pages 126--135, 1997. Google ScholarDigital Library
- P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, and D. Srivastava. Ranked join indices. In ICDE, pages 277--288, 2003.Google ScholarCross Ref
- D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In VLDB, pages 235--246, 2006. Google ScholarDigital Library
- A. Yu, P. K. Agarwal, and J. Yang. Processing a large number of continuous preference top-k queries. In SIGMOD, pages 397--408, 2012. Google ScholarDigital Library
Index Terms
- Efficient top-k query answering using cached views
Recommendations
Efficient Top-k Query Answering through its Top-N Rewritings Using Views
PIKM '15: Proceedings of the 8th Workshop on Ph.D. Workshop in Information and Knowledge ManagementRecently, various algorithms were proposed to speed up top-k query answering by using multiple materialized query results. Nevertheless, for most of the proposed algorithms, a potentially costly view selection operation is required. In fact, the ...
Answering top-k queries using views
VLDB '06: Proceedings of the 32nd international conference on Very large data basesThe problem of obtaining efficient answers to top-k queries has attracted a lot of research attention. Several algorithms and numerous variants of the top-k retrieval problem have been introduced in recent years. The general form of this problem ...
Efficient approximate top-k query algorithm using cube index
APWeb'11: Proceedings of the 13th Asia-Pacific web conference on Web technologies and applicationsExact top-k query processing has attracted much attention recently because of its wide use in many research areas. Since missing the truly best answers is inherent and unavoidable due to the user's subjective judgment, and the cost of processing exact ...
Comments