Subspace top-k query processing using the hybrid-layer index with a tight bound
- 1 January 2013
- journal article
- research article
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 83, 1-19
Abstract
No abstract availableKeywords
Funding Information
- National Research Foundation of Korea (NRF)
- Korean government (MEST) (2012R1A2A1A05026326)
This publication has 11 references indexed in Scilit:
- Efficient processing of exact top-k queries over disk-resident sorted listsThe VLDB Journal, 2009
- The partitioned-layer index: Answering monotone top-k queries using the convex skyline and partitioning-merging techniqueInformation Sciences, 2009
- A survey of top- k query processing techniques in relational database systemsACM Computing Surveys, 2008
- Efficient top-k processing in large-scaled distributed environmentsData & Knowledge Engineering, 2007
- Efficient Skyline and Top-k Retrieval in SubspacesIEEE Transactions on Knowledge and Data Engineering, 2007
- Optimizing top-k queries for middleware accessACM Transactions on Database Systems, 2007
- Toward a generalized theory of uncertainty (GTU)––an outlineInformation Sciences, 2005
- Progressive skyline computation in database systemsACM Transactions on Database Systems, 2005
- Algorithms and applications for answering ranked queries using ranked viewsThe VLDB Journal, 2004
- Top- k selection queries over relational databasesACM Transactions on Database Systems, 2002