Scalable and efficient processing of top-k multiple-type integrated queries
- 19 November 2015
- journal article
- research article
- Published by Springer Science and Business Media LLC in World Wide Web
- Vol. 19 (6), 1051-1075
- https://doi.org/10.1007/s11280-015-0373-x
Abstract
No abstract availableKeywords
Funding Information
- National Research Foundation of Korea (NRF) grant funded by Korean Government (2012R1A2A1A05026326)
This publication has 16 references indexed in Scilit:
- DB-IR integration using tight-coupling in the Odysseus DBMSWorld Wide Web, 2013
- RASIM: a rank-aware separate index method for answering top-k spatial keyword queriesWorld Wide Web, 2012
- Efficient processing of exact top-k queries over disk-resident sorted listsThe VLDB Journal, 2009
- Tightly-coupled spatial database features in the Odysseus/OpenGIS DBMS for high-performanceGeoInformatica, 2009
- A survey of top- k query processing techniques in relational database systemsACM Computing Surveys, 2008
- Distance browsing in spatial databasesACM Transactions on Database Systems, 1999
- Spatial join processing using corner transformationIEEE Transactions on Knowledge and Data Engineering, 1999
- Dynamic maintenance of data distribution for selectivity estimationThe VLDB Journal, 1994
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990
- R-treesACM SIGMOD Record, 1984