The partitioned-layer index: Answering monotone top-k queries using the convex skyline and partitioning-merging technique
Authors:
- Jun-Seok HeoJHJun-Seok Heo
- Kyu-Young WhangKWKyu-Young Whang
- Min-Soo KimMKMin-Soo Kim
- Yi-Reun KimYKYi-Reun Kim
- Il-Yeol SongISIl-Yeol Song
- 1 September 2009
- journal article
- Published by Elsevier in Information Sciences
- Vol. 179 (19) , 3286-3308
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficient search for the top-k probable nearest neighbors in uncertain databasesProceedings of the VLDB Endowment, 2008
- Ranking queries on uncertain data2008
- On Efficient Processing of Subspace Skyline Queries on High Dimensional Data2007
- Stratified computation of skylines with partially-ordered domains2005
- Algorithms and applications for answering ranked queries using ranked viewsThe VLDB Journal, 2004
- Optimal aggregation algorithms for middleware2001
- The onion techniqueACM SIGMOD Record, 2000
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- On the average number of maxima in a set of vectorsInformation Processing Letters, 1989
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978